./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy1_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy1_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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 32bit --witnessprinter.graph.data.programhash 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-635dfa2 [2018-12-02 15:43:50,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:43:50,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:43:50,072 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:43:50,072 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:43:50,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:43:50,073 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:43:50,074 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:43:50,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:43:50,075 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:43:50,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:43:50,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:43:50,076 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:43:50,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:43:50,077 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:43:50,077 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:43:50,078 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:43:50,079 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:43:50,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:43:50,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:43:50,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:43:50,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:43:50,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:43:50,083 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:43:50,083 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:43:50,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:43:50,084 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:43:50,084 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:43:50,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:43:50,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:43:50,085 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:43:50,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:43:50,086 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:43:50,086 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:43:50,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:43:50,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:43:50,087 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 15:43:50,095 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:43:50,095 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:43:50,096 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:43:50,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:43:50,096 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 15:43:50,096 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 15:43:50,096 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 15:43:50,096 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 15:43:50,097 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 15:43:50,097 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 15:43:50,097 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 15:43:50,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:43:50,097 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:43:50,097 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 15:43:50,097 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:43:50,097 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:43:50,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:43:50,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 15:43:50,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 15:43:50,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 15:43:50,098 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:43:50,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:43:50,098 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 15:43:50,098 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:43:50,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 15:43:50,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:43:50,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:43:50,099 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 15:43:50,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:43:50,099 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 15:43:50,099 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 15:43:50,100 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 15:43:50,100 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_410bdcfe-0853-41a6-a0ff-17f7d0568697/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 [2018-12-02 15:43:50,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:43:50,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:43:50,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:43:50,131 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:43:50,131 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:43:50,131 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/toy1_false-unreach-call_false-termination.cil.c [2018-12-02 15:43:50,171 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/data/785d815fb/e62dcc09009943678f9875579a2aad69/FLAG7e13befaa [2018-12-02 15:43:50,462 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:43:50,462 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/sv-benchmarks/c/systemc/toy1_false-unreach-call_false-termination.cil.c [2018-12-02 15:43:50,467 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/data/785d815fb/e62dcc09009943678f9875579a2aad69/FLAG7e13befaa [2018-12-02 15:43:50,476 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/data/785d815fb/e62dcc09009943678f9875579a2aad69 [2018-12-02 15:43:50,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:43:50,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:43:50,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:43:50,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:43:50,481 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:43:50,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:43:50" (1/1) ... [2018-12-02 15:43:50,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cdf4af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50, skipping insertion in model container [2018-12-02 15:43:50,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:43:50" (1/1) ... [2018-12-02 15:43:50,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:43:50,506 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:43:50,615 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:43:50,619 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:43:50,645 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:43:50,654 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:43:50,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50 WrapperNode [2018-12-02 15:43:50,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:43:50,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:43:50,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:43:50,655 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:43:50,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50" (1/1) ... [2018-12-02 15:43:50,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50" (1/1) ... [2018-12-02 15:43:50,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:43:50,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:43:50,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:43:50,709 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:43:50,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50" (1/1) ... [2018-12-02 15:43:50,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50" (1/1) ... [2018-12-02 15:43:50,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50" (1/1) ... [2018-12-02 15:43:50,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50" (1/1) ... [2018-12-02 15:43:50,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50" (1/1) ... [2018-12-02 15:43:50,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50" (1/1) ... [2018-12-02 15:43:50,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50" (1/1) ... [2018-12-02 15:43:50,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:43:50,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:43:50,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:43:50,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:43:50,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:43:50,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:43:51,031 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:43:51,032 INFO L280 CfgBuilder]: Removed 28 assue(true) statements. [2018-12-02 15:43:51,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:43:51 BoogieIcfgContainer [2018-12-02 15:43:51,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:43:51,032 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 15:43:51,032 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 15:43:51,034 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 15:43:51,035 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:43:51,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 03:43:50" (1/3) ... [2018-12-02 15:43:51,036 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73b65cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:43:51, skipping insertion in model container [2018-12-02 15:43:51,036 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:43:51,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:43:50" (2/3) ... [2018-12-02 15:43:51,036 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73b65cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:43:51, skipping insertion in model container [2018-12-02 15:43:51,036 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:43:51,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:43:51" (3/3) ... [2018-12-02 15:43:51,037 INFO L375 chiAutomizerObserver]: Analyzing ICFG toy1_false-unreach-call_false-termination.cil.c [2018-12-02 15:43:51,067 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:43:51,068 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 15:43:51,068 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 15:43:51,068 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 15:43:51,068 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:43:51,068 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:43:51,068 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 15:43:51,068 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:43:51,068 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 15:43:51,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states. [2018-12-02 15:43:51,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-12-02 15:43:51,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:51,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:51,099 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,099 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,099 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 15:43:51,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states. [2018-12-02 15:43:51,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-12-02 15:43:51,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:51,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:51,103 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,103 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,108 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRYtrue ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 15#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 29#L406true assume !(1 == ~c_req_up~0); 16#L406-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 31#L417-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 49#L422-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 72#L427-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 93#L432-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 106#L437-1true assume !(0 == ~e_f~0); 3#L442-1true assume !(0 == ~e_g~0); 33#L447-1true assume !(0 == ~e_e~0); 54#L452-1true assume !(0 == ~e_c~0); 77#L457-1true assume !(0 == ~e_wl~0); 97#L462-1true assume !(1 == ~wl_pc~0); 67#L474true assume !(2 == ~wl_pc~0); 21#L475true assume !(1 == ~c1_pc~0); 65#L485true assume !(1 == ~c2_pc~0); 24#L494true assume !(1 == ~wb_pc~0); 118#L503true assume !(1 == ~e_c~0); 90#L512-1true assume !(1 == ~e_e~0); 94#L517-1true assume !(1 == ~e_f~0); 122#L522-1true assume !(1 == ~e_g~0); 25#L527-1true assume !(1 == ~e_c~0); 46#L532-1true assume !(1 == ~e_wl~0); 101#L674-1true [2018-12-02 15:43:51,109 INFO L796 eck$LassoCheckResult]: Loop: 101#L674-1true assume !false; 10#L544true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 126#L379true assume !true; 30#L395true start_simulation_~kernel_st~0 := 2; 112#L550true assume !(1 == ~c_req_up~0); 95#L550-2true start_simulation_~kernel_st~0 := 3; 62#L562true assume 0 == ~e_f~0;~e_f~0 := 1; 64#L562-2true assume 0 == ~e_g~0;~e_g~0 := 1; 87#L567-1true assume 0 == ~e_e~0;~e_e~0 := 1; 114#L572-1true assume !(0 == ~e_c~0); 11#L577-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 41#L582-1true assume 1 == ~wl_pc~0; 8#L588true assume 1 == ~e_wl~0;~wl_st~0 := 0; 61#L595true assume !(1 == ~c1_pc~0); 108#L605true assume !(1 == ~c2_pc~0); 80#L614true assume !(1 == ~wb_pc~0); 51#L623true assume 1 == ~e_c~0;~r_st~0 := 0; 6#L632-1true assume 1 == ~e_e~0;~e_e~0 := 2; 38#L637-1true assume 1 == ~e_f~0;~e_f~0 := 2; 58#L642-1true assume 1 == ~e_g~0;~e_g~0 := 2; 81#L647-1true assume !(1 == ~e_c~0); 103#L652-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 129#L657-1true assume 0 == ~wl_st~0; 101#L674-1true [2018-12-02 15:43:51,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2018-12-02 15:43:51,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:51,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:51,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:51,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:51,218 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:43:51,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,218 INFO L82 PathProgramCache]: Analyzing trace with hash 476885301, now seen corresponding path program 1 times [2018-12-02 15:43:51,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:51,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:51,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:51,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:43:51,226 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:43:51,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 15:43:51,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 15:43:51,237 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2018-12-02 15:43:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:51,246 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2018-12-02 15:43:51,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 15:43:51,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 221 transitions. [2018-12-02 15:43:51,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-12-02 15:43:51,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 121 states and 215 transitions. [2018-12-02 15:43:51,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2018-12-02 15:43:51,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2018-12-02 15:43:51,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 215 transitions. [2018-12-02 15:43:51,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:43:51,255 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2018-12-02 15:43:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 215 transitions. [2018-12-02 15:43:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-02 15:43:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 15:43:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 215 transitions. [2018-12-02 15:43:51,275 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2018-12-02 15:43:51,275 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2018-12-02 15:43:51,275 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 15:43:51,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 215 transitions. [2018-12-02 15:43:51,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-12-02 15:43:51,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:51,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:51,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,277 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 292#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 293#L406 assume !(1 == ~c_req_up~0); 294#L406-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 295#L417-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 318#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 341#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 363#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 376#L437-1 assume !(0 == ~e_f~0); 263#L442-1 assume !(0 == ~e_g~0); 264#L447-1 assume !(0 == ~e_e~0); 321#L452-1 assume !(0 == ~e_c~0); 346#L457-1 assume !(0 == ~e_wl~0); 366#L462-1 assume !(1 == ~wl_pc~0); 360#L474 assume !(2 == ~wl_pc~0); 303#L475 assume !(1 == ~c1_pc~0); 299#L485 assume !(1 == ~c2_pc~0); 308#L494 assume !(1 == ~wb_pc~0); 309#L503 assume !(1 == ~e_c~0); 373#L512-1 assume !(1 == ~e_e~0); 374#L517-1 assume !(1 == ~e_f~0); 377#L522-1 assume !(1 == ~e_g~0); 311#L527-1 assume !(1 == ~e_c~0); 312#L532-1 assume !(1 == ~e_wl~0); 267#L674-1 [2018-12-02 15:43:51,278 INFO L796 eck$LassoCheckResult]: Loop: 267#L674-1 assume !false; 281#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 282#L379 assume !false; 372#L297 assume !(0 == ~wl_st~0); 340#L301 assume !(0 == ~c1_st~0); 331#L304 assume !(0 == ~c2_st~0); 297#L307 assume !(0 == ~wb_st~0); 278#L310 assume !(0 == ~r_st~0); 280#L395 start_simulation_~kernel_st~0 := 2; 317#L550 assume !(1 == ~c_req_up~0); 359#L550-2 start_simulation_~kernel_st~0 := 3; 353#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 354#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 357#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 371#L572-1 assume !(0 == ~e_c~0); 283#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 284#L582-1 assume 1 == ~wl_pc~0; 275#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 276#L595 assume !(1 == ~c1_pc~0); 352#L605 assume !(1 == ~c2_pc~0); 327#L614 assume !(1 == ~wb_pc~0); 344#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 270#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 271#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 328#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 350#L647-1 assume !(1 == ~e_c~0); 368#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 380#L657-1 assume 0 == ~wl_st~0; 267#L674-1 [2018-12-02 15:43:51,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2018-12-02 15:43:51,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:51,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:51,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:51,301 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:43:51,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,301 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 1 times [2018-12-02 15:43:51,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:51,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:51,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:51,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:51,320 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:43:51,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:51,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:51,320 INFO L87 Difference]: Start difference. First operand 121 states and 215 transitions. cyclomatic complexity: 95 Second operand 3 states. [2018-12-02 15:43:51,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:51,331 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2018-12-02 15:43:51,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:51,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 214 transitions. [2018-12-02 15:43:51,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-12-02 15:43:51,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 214 transitions. [2018-12-02 15:43:51,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2018-12-02 15:43:51,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2018-12-02 15:43:51,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 214 transitions. [2018-12-02 15:43:51,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:43:51,335 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2018-12-02 15:43:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 214 transitions. [2018-12-02 15:43:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-02 15:43:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 15:43:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 214 transitions. [2018-12-02 15:43:51,339 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2018-12-02 15:43:51,339 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2018-12-02 15:43:51,339 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 15:43:51,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 214 transitions. [2018-12-02 15:43:51,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-12-02 15:43:51,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:51,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:51,341 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,341 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,341 INFO L794 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 541#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 542#L406 assume !(1 == ~c_req_up~0); 543#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 544#L417-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 567#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 590#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 612#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 625#L437-1 assume !(0 == ~e_f~0); 512#L442-1 assume !(0 == ~e_g~0); 513#L447-1 assume !(0 == ~e_e~0); 570#L452-1 assume !(0 == ~e_c~0); 595#L457-1 assume !(0 == ~e_wl~0); 615#L462-1 assume !(1 == ~wl_pc~0); 609#L474 assume !(2 == ~wl_pc~0); 552#L475 assume !(1 == ~c1_pc~0); 548#L485 assume !(1 == ~c2_pc~0); 557#L494 assume !(1 == ~wb_pc~0); 558#L503 assume !(1 == ~e_c~0); 622#L512-1 assume !(1 == ~e_e~0); 623#L517-1 assume !(1 == ~e_f~0); 626#L522-1 assume !(1 == ~e_g~0); 560#L527-1 assume !(1 == ~e_c~0); 561#L532-1 assume !(1 == ~e_wl~0); 516#L674-1 [2018-12-02 15:43:51,341 INFO L796 eck$LassoCheckResult]: Loop: 516#L674-1 assume !false; 530#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 531#L379 assume !false; 621#L297 assume !(0 == ~wl_st~0); 589#L301 assume !(0 == ~c1_st~0); 580#L304 assume !(0 == ~c2_st~0); 546#L307 assume !(0 == ~wb_st~0); 527#L310 assume !(0 == ~r_st~0); 529#L395 start_simulation_~kernel_st~0 := 2; 566#L550 assume !(1 == ~c_req_up~0); 608#L550-2 start_simulation_~kernel_st~0 := 3; 602#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 603#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 606#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 620#L572-1 assume !(0 == ~e_c~0); 532#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 533#L582-1 assume 1 == ~wl_pc~0; 524#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 525#L595 assume !(1 == ~c1_pc~0); 601#L605 assume !(1 == ~c2_pc~0); 576#L614 assume !(1 == ~wb_pc~0); 593#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 519#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 520#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 577#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 599#L647-1 assume !(1 == ~e_c~0); 617#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 629#L657-1 assume 0 == ~wl_st~0; 516#L674-1 [2018-12-02 15:43:51,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2018-12-02 15:43:51,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:51,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:51,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:51,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:51,358 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:43:51,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,358 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 2 times [2018-12-02 15:43:51,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:51,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:51,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:51,372 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:43:51,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:51,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:51,373 INFO L87 Difference]: Start difference. First operand 121 states and 214 transitions. cyclomatic complexity: 94 Second operand 3 states. [2018-12-02 15:43:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:51,381 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2018-12-02 15:43:51,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:51,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 213 transitions. [2018-12-02 15:43:51,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-12-02 15:43:51,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 213 transitions. [2018-12-02 15:43:51,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2018-12-02 15:43:51,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2018-12-02 15:43:51,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 213 transitions. [2018-12-02 15:43:51,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:43:51,385 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2018-12-02 15:43:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 213 transitions. [2018-12-02 15:43:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-02 15:43:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 15:43:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2018-12-02 15:43:51,388 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2018-12-02 15:43:51,389 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2018-12-02 15:43:51,389 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 15:43:51,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 213 transitions. [2018-12-02 15:43:51,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-12-02 15:43:51,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:51,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:51,390 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,390 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,390 INFO L794 eck$LassoCheckResult]: Stem: 873#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 790#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 791#L406 assume !(1 == ~c_req_up~0); 792#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 793#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 816#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 839#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 861#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 874#L437-1 assume !(0 == ~e_f~0); 761#L442-1 assume !(0 == ~e_g~0); 762#L447-1 assume !(0 == ~e_e~0); 819#L452-1 assume !(0 == ~e_c~0); 844#L457-1 assume !(0 == ~e_wl~0); 864#L462-1 assume !(1 == ~wl_pc~0); 858#L474 assume !(2 == ~wl_pc~0); 801#L475 assume !(1 == ~c1_pc~0); 797#L485 assume !(1 == ~c2_pc~0); 806#L494 assume !(1 == ~wb_pc~0); 807#L503 assume !(1 == ~e_c~0); 871#L512-1 assume !(1 == ~e_e~0); 872#L517-1 assume !(1 == ~e_f~0); 875#L522-1 assume !(1 == ~e_g~0); 809#L527-1 assume !(1 == ~e_c~0); 810#L532-1 assume !(1 == ~e_wl~0); 765#L674-1 [2018-12-02 15:43:51,390 INFO L796 eck$LassoCheckResult]: Loop: 765#L674-1 assume !false; 779#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 780#L379 assume !false; 870#L297 assume !(0 == ~wl_st~0); 838#L301 assume !(0 == ~c1_st~0); 829#L304 assume !(0 == ~c2_st~0); 795#L307 assume !(0 == ~wb_st~0); 776#L310 assume !(0 == ~r_st~0); 778#L395 start_simulation_~kernel_st~0 := 2; 815#L550 assume !(1 == ~c_req_up~0); 857#L550-2 start_simulation_~kernel_st~0 := 3; 851#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 852#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 855#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 869#L572-1 assume !(0 == ~e_c~0); 781#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 782#L582-1 assume 1 == ~wl_pc~0; 773#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 774#L595 assume !(1 == ~c1_pc~0); 850#L605 assume !(1 == ~c2_pc~0); 825#L614 assume !(1 == ~wb_pc~0); 842#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 768#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 769#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 826#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 848#L647-1 assume !(1 == ~e_c~0); 866#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 878#L657-1 assume 0 == ~wl_st~0; 765#L674-1 [2018-12-02 15:43:51,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2018-12-02 15:43:51,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:51,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:51,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:51,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:51,408 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:43:51,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,409 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 3 times [2018-12-02 15:43:51,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:51,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:51,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:51,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:51,425 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:43:51,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:51,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:51,426 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. cyclomatic complexity: 93 Second operand 3 states. [2018-12-02 15:43:51,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:51,432 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2018-12-02 15:43:51,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:51,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 212 transitions. [2018-12-02 15:43:51,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-12-02 15:43:51,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 212 transitions. [2018-12-02 15:43:51,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2018-12-02 15:43:51,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2018-12-02 15:43:51,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 212 transitions. [2018-12-02 15:43:51,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:43:51,436 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2018-12-02 15:43:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 212 transitions. [2018-12-02 15:43:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-02 15:43:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 15:43:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2018-12-02 15:43:51,438 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2018-12-02 15:43:51,438 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2018-12-02 15:43:51,438 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 15:43:51,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 212 transitions. [2018-12-02 15:43:51,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2018-12-02 15:43:51,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:51,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:51,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,440 INFO L794 eck$LassoCheckResult]: Stem: 1122#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1039#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1040#L406 assume !(1 == ~c_req_up~0); 1041#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1042#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1065#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1088#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1110#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1123#L437-1 assume !(0 == ~e_f~0); 1010#L442-1 assume !(0 == ~e_g~0); 1011#L447-1 assume !(0 == ~e_e~0); 1068#L452-1 assume !(0 == ~e_c~0); 1093#L457-1 assume !(0 == ~e_wl~0); 1113#L462-1 assume !(1 == ~wl_pc~0); 1107#L474 assume !(2 == ~wl_pc~0); 1050#L475 assume !(1 == ~c1_pc~0); 1046#L485 assume !(1 == ~c2_pc~0); 1055#L494 assume !(1 == ~wb_pc~0); 1056#L503 assume !(1 == ~e_c~0); 1120#L512-1 assume !(1 == ~e_e~0); 1121#L517-1 assume !(1 == ~e_f~0); 1124#L522-1 assume !(1 == ~e_g~0); 1058#L527-1 assume !(1 == ~e_c~0); 1059#L532-1 assume !(1 == ~e_wl~0); 1014#L674-1 [2018-12-02 15:43:51,440 INFO L796 eck$LassoCheckResult]: Loop: 1014#L674-1 assume !false; 1028#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1029#L379 assume !false; 1119#L297 assume !(0 == ~wl_st~0); 1087#L301 assume !(0 == ~c1_st~0); 1078#L304 assume !(0 == ~c2_st~0); 1044#L307 assume !(0 == ~wb_st~0); 1025#L310 assume !(0 == ~r_st~0); 1027#L395 start_simulation_~kernel_st~0 := 2; 1064#L550 assume !(1 == ~c_req_up~0); 1106#L550-2 start_simulation_~kernel_st~0 := 3; 1100#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 1101#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1104#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1118#L572-1 assume !(0 == ~e_c~0); 1030#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1031#L582-1 assume !(1 == ~wl_pc~0); 1024#L594 assume !(2 == ~wl_pc~0); 1023#L595 assume !(1 == ~c1_pc~0); 1099#L605 assume !(1 == ~c2_pc~0); 1074#L614 assume !(1 == ~wb_pc~0); 1091#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 1017#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1018#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1075#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1097#L647-1 assume !(1 == ~e_c~0); 1115#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1127#L657-1 assume 0 == ~wl_st~0; 1014#L674-1 [2018-12-02 15:43:51,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,440 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2018-12-02 15:43:51,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:51,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:51,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,467 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 1 times [2018-12-02 15:43:51,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:51,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:51,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:51,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:51,481 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:43:51,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:51,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:51,481 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. cyclomatic complexity: 92 Second operand 3 states. [2018-12-02 15:43:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:51,510 INFO L93 Difference]: Finished difference Result 153 states and 272 transitions. [2018-12-02 15:43:51,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:51,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 272 transitions. [2018-12-02 15:43:51,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2018-12-02 15:43:51,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 272 transitions. [2018-12-02 15:43:51,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2018-12-02 15:43:51,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2018-12-02 15:43:51,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 272 transitions. [2018-12-02 15:43:51,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:43:51,513 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2018-12-02 15:43:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 272 transitions. [2018-12-02 15:43:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-02 15:43:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-02 15:43:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 272 transitions. [2018-12-02 15:43:51,516 INFO L728 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2018-12-02 15:43:51,516 INFO L608 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2018-12-02 15:43:51,516 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 15:43:51,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 272 transitions. [2018-12-02 15:43:51,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2018-12-02 15:43:51,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:51,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:51,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,518 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:51,518 INFO L794 eck$LassoCheckResult]: Stem: 1406#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1319#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1320#L406 assume !(1 == ~c_req_up~0); 1321#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1322#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1345#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1369#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1393#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1407#L437-1 assume !(0 == ~e_f~0); 1293#L442-1 assume !(0 == ~e_g~0); 1294#L447-1 assume !(0 == ~e_e~0); 1348#L452-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1375#L457-1 assume !(0 == ~e_wl~0); 1396#L462-1 assume !(1 == ~wl_pc~0); 1390#L474 assume !(2 == ~wl_pc~0); 1330#L475 assume !(1 == ~c1_pc~0); 1326#L485 assume !(1 == ~c2_pc~0); 1335#L494 assume !(1 == ~wb_pc~0); 1336#L503 assume 1 == ~e_c~0;~r_st~0 := 0; 1416#L512-1 assume !(1 == ~e_e~0); 1408#L517-1 assume !(1 == ~e_f~0); 1409#L522-1 assume !(1 == ~e_g~0); 1338#L527-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1339#L532-1 assume !(1 == ~e_wl~0); 1292#L674-1 [2018-12-02 15:43:51,518 INFO L796 eck$LassoCheckResult]: Loop: 1292#L674-1 assume !false; 1308#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1309#L379 assume !false; 1403#L297 assume !(0 == ~wl_st~0); 1368#L301 assume !(0 == ~c1_st~0); 1359#L304 assume !(0 == ~c2_st~0); 1324#L307 assume !(0 == ~wb_st~0); 1305#L310 assume !(0 == ~r_st~0); 1307#L395 start_simulation_~kernel_st~0 := 2; 1344#L550 assume !(1 == ~c_req_up~0); 1389#L550-2 start_simulation_~kernel_st~0 := 3; 1383#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 1384#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1387#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1402#L572-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1415#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1442#L582-1 assume 1 == ~wl_pc~0; 1440#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1438#L595 assume !(1 == ~c1_pc~0); 1436#L605 assume !(1 == ~c2_pc~0); 1398#L614 assume !(1 == ~wb_pc~0); 1372#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 1373#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1355#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1356#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1378#L647-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1397#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1412#L657-1 assume 0 == ~wl_st~0; 1292#L674-1 [2018-12-02 15:43:51,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,518 INFO L82 PathProgramCache]: Analyzing trace with hash 785152729, now seen corresponding path program 1 times [2018-12-02 15:43:51,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:51,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:51,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:51,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:43:51,534 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:43:51,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:51,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1254823475, now seen corresponding path program 1 times [2018-12-02 15:43:51,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:51,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:51,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:51,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:51,651 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:51,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:51,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:51,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:51,653 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:43:51,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:51,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:51,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:51,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-12-02 15:43:51,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:51,653 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:51,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,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-12-02 15:43:51,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,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-12-02 15:43:51,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,864 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:51,864 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:51,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:51,868 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:51,873 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:51,873 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:51,888 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:51,888 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:51,904 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:43:51,905 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:51,907 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:43:51,920 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:51,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:51,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:51,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:51,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:43:51,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:51,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:51,921 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:51,921 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-12-02 15:43:51,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:51,921 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:51,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:51,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,122 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:52,127 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:43:52,128 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-12-02 15:43:52,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:52,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:52,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:52,131 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 15:43:52,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:52,133 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 15:43:52,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:52,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:52,137 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-12-02 15:43:52,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:52,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:52,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:52,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:52,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:52,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:52,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:52,142 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:43:52,144 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:43:52,144 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:43:52,146 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:43:52,146 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:43:52,146 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:43:52,146 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2018-12-02 15:43:52,147 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:43:52,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:52,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:52,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:52,219 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 15:43:52,219 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120 Second operand 5 states. [2018-12-02 15:43:52,286 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120. Second operand 5 states. Result 474 states and 835 transitions. Complement of second has 5 states. [2018-12-02 15:43:52,286 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-12-02 15:43:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 15:43:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2018-12-02 15:43:52,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 28 letters. [2018-12-02 15:43:52,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:52,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 52 letters. Loop has 28 letters. [2018-12-02 15:43:52,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:52,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 56 letters. [2018-12-02 15:43:52,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:52,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 474 states and 835 transitions. [2018-12-02 15:43:52,297 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 302 [2018-12-02 15:43:52,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 474 states to 459 states and 805 transitions. [2018-12-02 15:43:52,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2018-12-02 15:43:52,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2018-12-02 15:43:52,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 805 transitions. [2018-12-02 15:43:52,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:52,301 INFO L705 BuchiCegarLoop]: Abstraction has 459 states and 805 transitions. [2018-12-02 15:43:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 805 transitions. [2018-12-02 15:43:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 351. [2018-12-02 15:43:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-12-02 15:43:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 616 transitions. [2018-12-02 15:43:52,313 INFO L728 BuchiCegarLoop]: Abstraction has 351 states and 616 transitions. [2018-12-02 15:43:52,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:43:52,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:43:52,314 INFO L87 Difference]: Start difference. First operand 351 states and 616 transitions. Second operand 4 states. [2018-12-02 15:43:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:52,411 INFO L93 Difference]: Finished difference Result 640 states and 1104 transitions. [2018-12-02 15:43:52,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:43:52,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 640 states and 1104 transitions. [2018-12-02 15:43:52,415 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2018-12-02 15:43:52,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 640 states to 640 states and 1104 transitions. [2018-12-02 15:43:52,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 456 [2018-12-02 15:43:52,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 456 [2018-12-02 15:43:52,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 640 states and 1104 transitions. [2018-12-02 15:43:52,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:52,420 INFO L705 BuchiCegarLoop]: Abstraction has 640 states and 1104 transitions. [2018-12-02 15:43:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states and 1104 transitions. [2018-12-02 15:43:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 610. [2018-12-02 15:43:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-12-02 15:43:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1062 transitions. [2018-12-02 15:43:52,434 INFO L728 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2018-12-02 15:43:52,434 INFO L608 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2018-12-02 15:43:52,434 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 15:43:52,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 610 states and 1062 transitions. [2018-12-02 15:43:52,436 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2018-12-02 15:43:52,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:52,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:52,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:52,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:52,437 INFO L794 eck$LassoCheckResult]: Stem: 3323#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3145#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3146#L406 assume !(1 == ~c_req_up~0); 3147#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3148#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3189#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3379#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3324#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3325#L437-1 assume !(0 == ~e_f~0); 3088#L442-1 assume !(0 == ~e_g~0); 3089#L447-1 assume !(0 == ~e_e~0); 3194#L452-1 assume !(0 == ~e_c~0); 3255#L457-1 assume !(0 == ~e_wl~0); 3373#L462-1 assume !(1 == ~wl_pc~0); 3371#L474 assume !(2 == ~wl_pc~0); 3370#L475 assume !(1 == ~c1_pc~0); 3411#L485 assume !(1 == ~c2_pc~0); 3409#L494 assume !(1 == ~wb_pc~0); 3407#L503 assume 1 == ~e_c~0;~r_st~0 := 0; 3321#L512-1 assume !(1 == ~e_e~0); 3322#L517-1 assume !(1 == ~e_f~0); 3326#L522-1 assume !(1 == ~e_g~0); 3176#L527-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3177#L532-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3092#L674-1 [2018-12-02 15:43:52,438 INFO L796 eck$LassoCheckResult]: Loop: 3092#L674-1 assume !false; 3336#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 3646#L379 assume !false; 3645#L297 assume !(0 == ~wl_st~0); 3644#L301 assume !(0 == ~c1_st~0); 3214#L304 assume !(0 == ~c2_st~0); 3151#L307 assume !(0 == ~wb_st~0); 3153#L310 assume !(0 == ~r_st~0); 3639#L395 start_simulation_~kernel_st~0 := 2; 3637#L550 assume !(1 == ~c_req_up~0); 3327#L550-2 start_simulation_~kernel_st~0 := 3; 3328#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 3283#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3284#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3315#L572-1 assume !(0 == ~e_c~0); 3492#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3491#L582-1 assume 1 == ~wl_pc~0; 3489#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3488#L595 assume !(1 == ~c1_pc~0); 3481#L605 assume !(1 == ~c2_pc~0); 3475#L614 assume !(1 == ~wb_pc~0); 3471#L623 assume !(1 == ~e_c~0); 3468#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3465#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3462#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3459#L647-1 assume !(1 == ~e_c~0); 3306#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3356#L657-1 assume 0 == ~wl_st~0; 3092#L674-1 [2018-12-02 15:43:52,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash 198346713, now seen corresponding path program 1 times [2018-12-02 15:43:52,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:52,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:52,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:52,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:52,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:52,480 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:43:52,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:52,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2018715509, now seen corresponding path program 1 times [2018-12-02 15:43:52,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:52,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:52,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:52,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:52,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:52,562 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:52,563 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:52,563 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:52,563 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:52,563 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:43:52,563 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:52,563 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:52,563 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:52,563 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-12-02 15:43:52,563 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:52,563 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:52,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,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-12-02 15:43:52,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,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-12-02 15:43:52,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,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-12-02 15:43:52,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-12-02 15:43:52,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:52,711 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:52,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:52,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:52,716 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:52,716 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:52,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:52,731 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:52,733 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:52,733 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=7} Honda state: {~e_c~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:52,748 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:52,748 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:52,750 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:52,750 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:52,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:52,765 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:52,767 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:52,767 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:52,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:52,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:52,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:52,784 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-1} Honda state: {~c1_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:52,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:52,800 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:52,802 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:52,802 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=7} Honda state: {~wb_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:52,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:52,817 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:52,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:43:52,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:52,837 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:43:52,850 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:52,850 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:52,850 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:52,850 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:52,850 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:43:52,851 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:52,851 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:52,851 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:52,851 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-12-02 15:43:52,851 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:52,851 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:52,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:52,997 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:52,998 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:43:52,998 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-12-02 15:43:52,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:52,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:52,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:52,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:52,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:52,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:52,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:53,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:53,000 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-12-02 15:43:53,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:53,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:53,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:53,001 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 15:43:53,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:53,001 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 15:43:53,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:53,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:53,002 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-12-02 15:43:53,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:53,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:53,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:53,003 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 15:43:53,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:53,003 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 15:43:53,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:53,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:53,004 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-12-02 15:43:53,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:53,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:53,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:53,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:53,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:53,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:53,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:53,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:53,006 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-12-02 15:43:53,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:53,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:53,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:53,006 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 15:43:53,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:53,007 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 15:43:53,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:53,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:53,008 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-12-02 15:43:53,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:53,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:53,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:53,008 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 15:43:53,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:53,009 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 15:43:53,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:53,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:53,010 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-12-02 15:43:53,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:53,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:53,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:53,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:53,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:53,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:53,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:53,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:53,012 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-12-02 15:43:53,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:53,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:53,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:53,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:53,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:53,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:53,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:53,015 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:43:53,016 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:43:53,016 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:43:53,017 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:43:53,017 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:43:53,017 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:43:53,017 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] [2018-12-02 15:43:53,017 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:43:53,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:53,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:53,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:53,064 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 15:43:53,064 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458 Second operand 5 states. [2018-12-02 15:43:53,088 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458. Second operand 5 states. Result 1027 states and 1790 transitions. Complement of second has 5 states. [2018-12-02 15:43:53,088 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-12-02 15:43:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 15:43:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2018-12-02 15:43:53,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 28 letters. [2018-12-02 15:43:53,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:53,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 52 letters. Loop has 28 letters. [2018-12-02 15:43:53,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:53,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 56 letters. [2018-12-02 15:43:53,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:53,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1027 states and 1790 transitions. [2018-12-02 15:43:53,096 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 573 [2018-12-02 15:43:53,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1027 states to 1021 states and 1780 transitions. [2018-12-02 15:43:53,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 657 [2018-12-02 15:43:53,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 663 [2018-12-02 15:43:53,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1021 states and 1780 transitions. [2018-12-02 15:43:53,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:53,102 INFO L705 BuchiCegarLoop]: Abstraction has 1021 states and 1780 transitions. [2018-12-02 15:43:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states and 1780 transitions. [2018-12-02 15:43:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 818. [2018-12-02 15:43:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-12-02 15:43:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1432 transitions. [2018-12-02 15:43:53,118 INFO L728 BuchiCegarLoop]: Abstraction has 818 states and 1432 transitions. [2018-12-02 15:43:53,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:53,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:53,119 INFO L87 Difference]: Start difference. First operand 818 states and 1432 transitions. Second operand 3 states. [2018-12-02 15:43:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:53,167 INFO L93 Difference]: Finished difference Result 1080 states and 1855 transitions. [2018-12-02 15:43:53,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:53,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1080 states and 1855 transitions. [2018-12-02 15:43:53,171 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 546 [2018-12-02 15:43:53,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1080 states to 1080 states and 1855 transitions. [2018-12-02 15:43:53,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 632 [2018-12-02 15:43:53,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 632 [2018-12-02 15:43:53,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1080 states and 1855 transitions. [2018-12-02 15:43:53,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:53,174 INFO L705 BuchiCegarLoop]: Abstraction has 1080 states and 1855 transitions. [2018-12-02 15:43:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states and 1855 transitions. [2018-12-02 15:43:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1076. [2018-12-02 15:43:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-12-02 15:43:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1851 transitions. [2018-12-02 15:43:53,184 INFO L728 BuchiCegarLoop]: Abstraction has 1076 states and 1851 transitions. [2018-12-02 15:43:53,184 INFO L608 BuchiCegarLoop]: Abstraction has 1076 states and 1851 transitions. [2018-12-02 15:43:53,184 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 15:43:53,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1076 states and 1851 transitions. [2018-12-02 15:43:53,186 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 546 [2018-12-02 15:43:53,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:53,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:53,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:53,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:53,187 INFO L794 eck$LassoCheckResult]: Stem: 7037#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6857#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 6858#L406 assume !(1 == ~c_req_up~0); 6859#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6860#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6948#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6949#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7002#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 7061#L437-1 assume !(0 == ~e_f~0); 7062#L442-1 assume !(0 == ~e_g~0); 6900#L447-1 assume !(0 == ~e_e~0); 6901#L452-1 assume !(0 == ~e_c~0); 7007#L457-1 assume !(0 == ~e_wl~0); 7008#L462-1 assume !(1 == ~wl_pc~0); 6995#L474 assume !(2 == ~wl_pc~0); 6996#L475 assume !(1 == ~c1_pc~0); 7097#L485 assume !(1 == ~c2_pc~0); 6880#L494 assume !(1 == ~wb_pc~0); 6881#L503 assume !(1 == ~e_c~0); 7035#L512-1 assume !(1 == ~e_e~0); 7036#L517-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7105#L522-1 assume !(1 == ~e_g~0); 6883#L527-1 assume !(1 == ~e_c~0); 6884#L532-1 assume !(1 == ~e_wl~0); 7409#L674-1 assume !false; 7410#L544 [2018-12-02 15:43:53,187 INFO L796 eck$LassoCheckResult]: Loop: 7410#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 7511#L379 assume !false; 7512#L297 assume !(0 == ~wl_st~0); 7507#L301 assume !(0 == ~c1_st~0); 7508#L304 assume !(0 == ~c2_st~0); 7500#L307 assume !(0 == ~wb_st~0); 7501#L310 assume !(0 == ~r_st~0); 7573#L395 start_simulation_~kernel_st~0 := 2; 7568#L550 assume !(1 == ~c_req_up~0); 7565#L550-2 start_simulation_~kernel_st~0 := 3; 7562#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 7560#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7561#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7556#L572-1 assume !(0 == ~e_c~0); 7557#L577-1 assume !(0 == ~e_wl~0); 7551#L582-1 assume !(1 == ~wl_pc~0); 7552#L594 assume !(2 == ~wl_pc~0); 7547#L595 assume !(1 == ~c1_pc~0); 7546#L605 assume !(1 == ~c2_pc~0); 7539#L614 assume !(1 == ~wb_pc~0); 7540#L623 assume !(1 == ~e_c~0); 7535#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7536#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7528#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7529#L647-1 assume !(1 == ~e_c~0); 7524#L652-1 assume !(1 == ~e_wl~0); 7525#L657-1 assume 0 == ~wl_st~0; 7514#L674-1 assume !false; 7410#L544 [2018-12-02 15:43:53,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash -668024006, now seen corresponding path program 1 times [2018-12-02 15:43:53,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:53,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:53,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:53,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:53,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:53,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:43:53,200 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:43:53,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:53,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1837628252, now seen corresponding path program 1 times [2018-12-02 15:43:53,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:53,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:53,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:53,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:53,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:53,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:53,208 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:43:53,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:43:53,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:43:53,208 INFO L87 Difference]: Start difference. First operand 1076 states and 1851 transitions. cyclomatic complexity: 786 Second operand 4 states. [2018-12-02 15:43:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:53,276 INFO L93 Difference]: Finished difference Result 1310 states and 2219 transitions. [2018-12-02 15:43:53,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:43:53,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1310 states and 2219 transitions. [2018-12-02 15:43:53,283 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 623 [2018-12-02 15:43:53,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1310 states to 1310 states and 2219 transitions. [2018-12-02 15:43:53,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 778 [2018-12-02 15:43:53,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 778 [2018-12-02 15:43:53,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1310 states and 2219 transitions. [2018-12-02 15:43:53,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:53,290 INFO L705 BuchiCegarLoop]: Abstraction has 1310 states and 2219 transitions. [2018-12-02 15:43:53,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states and 2219 transitions. [2018-12-02 15:43:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1271. [2018-12-02 15:43:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2018-12-02 15:43:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2169 transitions. [2018-12-02 15:43:53,307 INFO L728 BuchiCegarLoop]: Abstraction has 1271 states and 2169 transitions. [2018-12-02 15:43:53,307 INFO L608 BuchiCegarLoop]: Abstraction has 1271 states and 2169 transitions. [2018-12-02 15:43:53,307 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 15:43:53,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1271 states and 2169 transitions. [2018-12-02 15:43:53,311 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 620 [2018-12-02 15:43:53,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:53,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:53,312 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:53,312 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:53,312 INFO L794 eck$LassoCheckResult]: Stem: 9429#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 9256#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 9257#L406 assume !(1 == ~c_req_up~0); 9291#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9296#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9297#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9400#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9401#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9430#L437-1 assume !(0 == ~e_f~0); 9203#L442-1 assume !(0 == ~e_g~0); 9204#L447-1 assume !(0 == ~e_e~0); 9302#L452-1 assume !(0 == ~e_c~0); 9358#L457-1 assume !(0 == ~e_wl~0); 9518#L462-1 assume !(1 == ~wl_pc~0); 9509#L474 assume !(2 == ~wl_pc~0); 9503#L475 assume !(1 == ~c1_pc~0); 9493#L485 assume !(1 == ~c2_pc~0); 9485#L494 assume !(1 == ~wb_pc~0); 9478#L503 assume !(1 == ~e_c~0); 9473#L512-1 assume !(1 == ~e_e~0); 9468#L517-1 assume !(1 == ~e_f~0); 9465#L522-1 assume !(1 == ~e_g~0); 9282#L527-1 assume !(1 == ~e_c~0); 9283#L532-1 assume !(1 == ~e_wl~0); 9341#L674-1 assume !false; 9853#L544 [2018-12-02 15:43:53,312 INFO L796 eck$LassoCheckResult]: Loop: 9853#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 10286#L379 assume !false; 10282#L297 assume !(0 == ~wl_st~0); 10283#L301 assume !(0 == ~c1_st~0); 10285#L304 assume !(0 == ~c2_st~0); 10280#L307 assume !(0 == ~wb_st~0); 10281#L310 assume !(0 == ~r_st~0); 10284#L395 start_simulation_~kernel_st~0 := 2; 10398#L550 assume !(1 == ~c_req_up~0); 10399#L550-2 start_simulation_~kernel_st~0 := 3; 10425#L562 assume !(0 == ~e_f~0); 10424#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 10423#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 10422#L572-1 assume !(0 == ~e_c~0); 10421#L577-1 assume !(0 == ~e_wl~0); 10419#L582-1 assume !(1 == ~wl_pc~0); 10418#L594 assume !(2 == ~wl_pc~0); 10416#L595 assume !(1 == ~c1_pc~0); 10414#L605 assume !(1 == ~c2_pc~0); 10411#L614 assume !(1 == ~wb_pc~0); 10410#L623 assume !(1 == ~e_c~0); 10409#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 9315#L637-1 assume !(1 == ~e_f~0); 9316#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 9368#L647-1 assume !(1 == ~e_c~0); 9415#L652-1 assume !(1 == ~e_wl~0); 10318#L657-1 assume 0 == ~wl_st~0; 10297#L674-1 assume !false; 9853#L544 [2018-12-02 15:43:53,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:53,312 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2018-12-02 15:43:53,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:53,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:53,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:53,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:53,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash 520452640, now seen corresponding path program 1 times [2018-12-02 15:43:53,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:53,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:53,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:53,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:53,333 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:43:53,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:53,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:53,334 INFO L87 Difference]: Start difference. First operand 1271 states and 2169 transitions. cyclomatic complexity: 909 Second operand 3 states. [2018-12-02 15:43:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:53,356 INFO L93 Difference]: Finished difference Result 1965 states and 3310 transitions. [2018-12-02 15:43:53,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:53,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1965 states and 3310 transitions. [2018-12-02 15:43:53,362 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 990 [2018-12-02 15:43:53,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1965 states to 1965 states and 3310 transitions. [2018-12-02 15:43:53,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1131 [2018-12-02 15:43:53,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1131 [2018-12-02 15:43:53,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1965 states and 3310 transitions. [2018-12-02 15:43:53,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:53,368 INFO L705 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2018-12-02 15:43:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states and 3310 transitions. [2018-12-02 15:43:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1965. [2018-12-02 15:43:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2018-12-02 15:43:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 3310 transitions. [2018-12-02 15:43:53,384 INFO L728 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2018-12-02 15:43:53,384 INFO L608 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2018-12-02 15:43:53,384 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 15:43:53,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1965 states and 3310 transitions. [2018-12-02 15:43:53,388 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 990 [2018-12-02 15:43:53,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:53,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:53,389 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:53,389 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:53,389 INFO L794 eck$LassoCheckResult]: Stem: 12681#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 12498#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 12499#L406 assume !(1 == ~c_req_up~0); 12534#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 12537#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 12538#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 12651#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 12652#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 12702#L437-1 assume !(0 == ~e_f~0); 12445#L442-1 assume !(0 == ~e_g~0); 12446#L447-1 assume !(0 == ~e_e~0); 12613#L452-1 assume !(0 == ~e_c~0); 12614#L457-1 assume !(0 == ~e_wl~0); 12657#L462-1 assume !(1 == ~wl_pc~0); 12646#L474 assume !(2 == ~wl_pc~0); 12512#L475 assume !(1 == ~c1_pc~0); 12505#L485 assume !(1 == ~c2_pc~0); 12521#L494 assume !(1 == ~wb_pc~0); 12522#L503 assume !(1 == ~e_c~0); 12712#L512-1 assume !(1 == ~e_e~0); 12729#L517-1 assume !(1 == ~e_f~0); 12715#L522-1 assume !(1 == ~e_g~0); 12524#L527-1 assume !(1 == ~e_c~0); 12525#L532-1 assume !(1 == ~e_wl~0); 12593#L674-1 assume !false; 13019#L544 [2018-12-02 15:43:53,389 INFO L796 eck$LassoCheckResult]: Loop: 13019#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 13534#L379 assume !false; 13582#L297 assume !(0 == ~wl_st~0); 13584#L301 assume !(0 == ~c1_st~0); 13648#L304 assume !(0 == ~c2_st~0); 13649#L307 assume !(0 == ~wb_st~0); 13643#L310 assume !(0 == ~r_st~0); 13645#L395 start_simulation_~kernel_st~0 := 2; 13779#L550 assume !(1 == ~c_req_up~0); 13777#L550-2 start_simulation_~kernel_st~0 := 3; 13774#L562 assume !(0 == ~e_f~0); 13772#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 13769#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 13766#L572-1 assume !(0 == ~e_c~0); 13764#L577-1 assume !(0 == ~e_wl~0); 13762#L582-1 assume !(1 == ~wl_pc~0); 13760#L594 assume 2 == ~wl_pc~0; 13758#L596 assume 1 == ~e_e~0;~wl_st~0 := 0; 13757#L595 assume !(1 == ~c1_pc~0); 13755#L605 assume !(1 == ~c2_pc~0); 13752#L614 assume !(1 == ~wb_pc~0); 13751#L623 assume !(1 == ~e_c~0); 13750#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 13749#L637-1 assume !(1 == ~e_f~0); 13748#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 13747#L647-1 assume !(1 == ~e_c~0); 13746#L652-1 assume !(1 == ~e_wl~0); 13744#L657-1 assume 0 == ~wl_st~0; 13743#L674-1 assume !false; 13019#L544 [2018-12-02 15:43:53,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:53,389 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2018-12-02 15:43:53,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:53,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:53,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:53,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:53,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1794894215, now seen corresponding path program 1 times [2018-12-02 15:43:53,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:53,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:53,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:53,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1157500386, now seen corresponding path program 1 times [2018-12-02 15:43:53,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:53,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:53,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:53,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:53,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:53,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:53,524 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:53,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:53,525 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:53,525 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:53,525 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:43:53,525 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:53,525 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:53,525 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:53,525 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-12-02 15:43:53,525 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:53,525 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:53,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,730 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:53,730 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:53,732 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:53,732 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:53,734 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:53,734 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:53,751 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:53,751 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:53,755 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:53,755 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=7} Honda state: {~e_c~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:53,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:53,780 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:53,782 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:43:53,783 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:53,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:43:53,799 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/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-12-02 15:43:53,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:43:53,816 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:43:53,820 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:43:53,843 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:43:53,843 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:43:53,843 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:43:53,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:43:53,844 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:43:53,844 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:43:53,844 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:43:53,844 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:43:53,844 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-12-02 15:43:53,844 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:43:53,844 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:43:53,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:53,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:43:54,024 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:43:54,024 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:43:54,024 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-12-02 15:43:54,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:54,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:54,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:54,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:54,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:54,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:54,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:54,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:54,027 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-12-02 15:43:54,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:54,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:54,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:54,027 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 15:43:54,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:54,028 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 15:43:54,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:54,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:43:54,029 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-12-02 15:43:54,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:43:54,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:43:54,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:43:54,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:43:54,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:43:54,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:43:54,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:43:54,032 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:43:54,033 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:43:54,033 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:43:54,033 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:43:54,034 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:43:54,034 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:43:54,034 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2018-12-02 15:43:54,034 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:43:54,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:54,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:54,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:54,071 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 15:43:54,071 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1965 states and 3310 transitions. cyclomatic complexity: 1356 Second operand 5 states. [2018-12-02 15:43:54,114 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1965 states and 3310 transitions. cyclomatic complexity: 1356. Second operand 5 states. Result 5576 states and 9355 transitions. Complement of second has 5 states. [2018-12-02 15:43:54,114 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-12-02 15:43:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 15:43:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2018-12-02 15:43:54,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 25 letters. Loop has 29 letters. [2018-12-02 15:43:54,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:54,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 54 letters. Loop has 29 letters. [2018-12-02 15:43:54,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:54,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 25 letters. Loop has 58 letters. [2018-12-02 15:43:54,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:43:54,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5576 states and 9355 transitions. [2018-12-02 15:43:54,138 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1920 [2018-12-02 15:43:54,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5576 states to 5576 states and 9355 transitions. [2018-12-02 15:43:54,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2105 [2018-12-02 15:43:54,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2138 [2018-12-02 15:43:54,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5576 states and 9355 transitions. [2018-12-02 15:43:54,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:54,164 INFO L705 BuchiCegarLoop]: Abstraction has 5576 states and 9355 transitions. [2018-12-02 15:43:54,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5576 states and 9355 transitions. [2018-12-02 15:43:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5576 to 5543. [2018-12-02 15:43:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5543 states. [2018-12-02 15:43:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5543 states to 5543 states and 9295 transitions. [2018-12-02 15:43:54,232 INFO L728 BuchiCegarLoop]: Abstraction has 5543 states and 9295 transitions. [2018-12-02 15:43:54,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:54,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:54,232 INFO L87 Difference]: Start difference. First operand 5543 states and 9295 transitions. Second operand 3 states. [2018-12-02 15:43:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:54,260 INFO L93 Difference]: Finished difference Result 5023 states and 8398 transitions. [2018-12-02 15:43:54,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:54,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5023 states and 8398 transitions. [2018-12-02 15:43:54,277 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1747 [2018-12-02 15:43:54,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5023 states to 5023 states and 8398 transitions. [2018-12-02 15:43:54,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1932 [2018-12-02 15:43:54,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1932 [2018-12-02 15:43:54,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5023 states and 8398 transitions. [2018-12-02 15:43:54,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:54,298 INFO L705 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2018-12-02 15:43:54,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states and 8398 transitions. [2018-12-02 15:43:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 5023. [2018-12-02 15:43:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2018-12-02 15:43:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 8398 transitions. [2018-12-02 15:43:54,348 INFO L728 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2018-12-02 15:43:54,348 INFO L608 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2018-12-02 15:43:54,348 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 15:43:54,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5023 states and 8398 transitions. [2018-12-02 15:43:54,356 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1747 [2018-12-02 15:43:54,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:54,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:54,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:54,357 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:54,357 INFO L794 eck$LassoCheckResult]: Stem: 30991#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 30789#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 30790#L406 assume !(1 == ~c_req_up~0); 30835#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 30839#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 30840#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 30957#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 30958#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 31007#L437-1 assume !(0 == ~e_f~0); 31008#L442-1 assume !(0 == ~e_g~0); 30845#L447-1 assume !(0 == ~e_e~0); 30846#L452-1 assume !(0 == ~e_c~0); 31056#L457-1 assume !(0 == ~e_wl~0); 31055#L462-1 assume !(1 == ~wl_pc~0); 31052#L474 assume !(2 == ~wl_pc~0); 31051#L475 assume !(1 == ~c1_pc~0); 31049#L485 assume !(1 == ~c2_pc~0); 31040#L494 assume !(1 == ~wb_pc~0); 31035#L503 assume !(1 == ~e_c~0); 31031#L512-1 assume !(1 == ~e_e~0); 31026#L517-1 assume !(1 == ~e_f~0); 31025#L522-1 assume !(1 == ~e_g~0); 30826#L527-1 assume !(1 == ~e_c~0); 30827#L532-1 assume !(1 == ~e_wl~0); 31481#L674-1 assume !false; 31476#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 31477#L379 [2018-12-02 15:43:54,357 INFO L796 eck$LassoCheckResult]: Loop: 31477#L379 assume !false; 31493#L297 assume 0 == ~wl_st~0; 31492#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 31472#L323 assume !(0 != eval_~tmp~0); 31473#L319 assume !(0 == ~c1_st~0); 31602#L334 assume !(0 == ~c2_st~0); 31575#L349 assume !(0 == ~wb_st~0); 31523#L364 assume !(0 == ~r_st~0); 31477#L379 [2018-12-02 15:43:54,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:54,357 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2018-12-02 15:43:54,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:54,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:54,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:54,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:54,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:54,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1289372155, now seen corresponding path program 1 times [2018-12-02 15:43:54,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:54,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:54,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:54,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:54,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:54,370 INFO L82 PathProgramCache]: Analyzing trace with hash 370417651, now seen corresponding path program 1 times [2018-12-02 15:43:54,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:54,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:54,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:54,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:54,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:54,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:54,410 INFO L87 Difference]: Start difference. First operand 5023 states and 8398 transitions. cyclomatic complexity: 3408 Second operand 3 states. [2018-12-02 15:43:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:54,438 INFO L93 Difference]: Finished difference Result 7959 states and 13148 transitions. [2018-12-02 15:43:54,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:54,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7959 states and 13148 transitions. [2018-12-02 15:43:54,455 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2732 [2018-12-02 15:43:54,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7959 states to 7959 states and 13148 transitions. [2018-12-02 15:43:54,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3015 [2018-12-02 15:43:54,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3015 [2018-12-02 15:43:54,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7959 states and 13148 transitions. [2018-12-02 15:43:54,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:54,477 INFO L705 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2018-12-02 15:43:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states and 13148 transitions. [2018-12-02 15:43:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7959. [2018-12-02 15:43:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7959 states. [2018-12-02 15:43:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7959 states to 7959 states and 13148 transitions. [2018-12-02 15:43:54,531 INFO L728 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2018-12-02 15:43:54,531 INFO L608 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2018-12-02 15:43:54,531 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 15:43:54,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7959 states and 13148 transitions. [2018-12-02 15:43:54,544 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2732 [2018-12-02 15:43:54,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:54,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:54,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:54,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:54,544 INFO L794 eck$LassoCheckResult]: Stem: 43968#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 43776#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 43777#L406 assume !(1 == ~c_req_up~0); 43820#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 43823#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 43824#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 43941#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 43942#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 43988#L437-1 assume !(0 == ~e_f~0); 43989#L442-1 assume !(0 == ~e_g~0); 43829#L447-1 assume !(0 == ~e_e~0); 43830#L452-1 assume !(0 == ~e_c~0); 44041#L457-1 assume !(0 == ~e_wl~0); 44040#L462-1 assume !(1 == ~wl_pc~0); 44037#L474 assume !(2 == ~wl_pc~0); 44036#L475 assume !(1 == ~c1_pc~0); 44034#L485 assume !(1 == ~c2_pc~0); 44025#L494 assume !(1 == ~wb_pc~0); 44020#L503 assume !(1 == ~e_c~0); 44016#L512-1 assume !(1 == ~e_e~0); 44011#L517-1 assume !(1 == ~e_f~0); 44010#L522-1 assume !(1 == ~e_g~0); 43810#L527-1 assume !(1 == ~e_c~0); 43811#L532-1 assume !(1 == ~e_wl~0); 44728#L674-1 assume !false; 44729#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 44716#L379 [2018-12-02 15:43:54,544 INFO L796 eck$LassoCheckResult]: Loop: 44716#L379 assume !false; 44634#L297 assume 0 == ~wl_st~0; 44603#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 44596#L323 assume !(0 != eval_~tmp~0); 44597#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 47915#L338 assume !(0 != eval_~tmp___0~0); 44734#L334 assume !(0 == ~c2_st~0); 44732#L349 assume !(0 == ~wb_st~0); 44722#L364 assume !(0 == ~r_st~0); 44716#L379 [2018-12-02 15:43:54,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:54,545 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2018-12-02 15:43:54,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:54,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:54,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:54,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:54,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:54,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 1 times [2018-12-02 15:43:54,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:54,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:54,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:54,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:54,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:54,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1452726936, now seen corresponding path program 1 times [2018-12-02 15:43:54,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:54,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:54,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:54,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:54,597 INFO L87 Difference]: Start difference. First operand 7959 states and 13148 transitions. cyclomatic complexity: 5222 Second operand 3 states. [2018-12-02 15:43:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:54,648 INFO L93 Difference]: Finished difference Result 12649 states and 20599 transitions. [2018-12-02 15:43:54,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:54,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12649 states and 20599 transitions. [2018-12-02 15:43:54,685 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2018-12-02 15:43:54,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12649 states to 12649 states and 20599 transitions. [2018-12-02 15:43:54,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4840 [2018-12-02 15:43:54,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4840 [2018-12-02 15:43:54,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12649 states and 20599 transitions. [2018-12-02 15:43:54,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:54,723 INFO L705 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2018-12-02 15:43:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12649 states and 20599 transitions. [2018-12-02 15:43:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12649 to 12649. [2018-12-02 15:43:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12649 states. [2018-12-02 15:43:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12649 states to 12649 states and 20599 transitions. [2018-12-02 15:43:54,824 INFO L728 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2018-12-02 15:43:54,824 INFO L608 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2018-12-02 15:43:54,824 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 15:43:54,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12649 states and 20599 transitions. [2018-12-02 15:43:54,865 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2018-12-02 15:43:54,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:54,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:54,865 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:54,865 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:54,866 INFO L794 eck$LassoCheckResult]: Stem: 64580#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 64392#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 64393#L406 assume !(1 == ~c_req_up~0); 64433#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 64436#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 64437#L422-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 64547#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 64548#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 64598#L437-1 assume !(0 == ~e_f~0); 64599#L442-1 assume !(0 == ~e_g~0); 66129#L447-1 assume !(0 == ~e_e~0); 66128#L452-1 assume !(0 == ~e_c~0); 66127#L457-1 assume !(0 == ~e_wl~0); 66126#L462-1 assume !(1 == ~wl_pc~0); 64660#L474 assume !(2 == ~wl_pc~0); 64661#L475 assume !(1 == ~c1_pc~0); 64656#L485 assume !(1 == ~c2_pc~0); 64655#L494 assume !(1 == ~wb_pc~0); 64643#L503 assume !(1 == ~e_c~0); 64644#L512-1 assume !(1 == ~e_e~0); 64630#L517-1 assume !(1 == ~e_f~0); 64631#L522-1 assume !(1 == ~e_g~0); 64423#L527-1 assume !(1 == ~e_c~0); 64424#L532-1 assume !(1 == ~e_wl~0); 65800#L674-1 assume !false; 65795#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 65796#L379 [2018-12-02 15:43:54,866 INFO L796 eck$LassoCheckResult]: Loop: 65796#L379 assume !false; 65934#L297 assume 0 == ~wl_st~0; 65933#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 65930#L323 assume !(0 != eval_~tmp~0); 65929#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 65888#L338 assume !(0 != eval_~tmp___0~0); 65919#L334 assume !(0 == ~c2_st~0); 65921#L349 assume !(0 == ~wb_st~0); 65901#L364 assume !(0 == ~r_st~0); 65796#L379 [2018-12-02 15:43:54,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:54,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2018-12-02 15:43:54,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:54,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:54,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:54,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:54,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:54,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:54,874 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:43:54,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 2 times [2018-12-02 15:43:54,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:54,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:54,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:54,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:54,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:54,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:54,911 INFO L87 Difference]: Start difference. First operand 12649 states and 20599 transitions. cyclomatic complexity: 7983 Second operand 3 states. [2018-12-02 15:43:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:54,931 INFO L93 Difference]: Finished difference Result 12547 states and 20414 transitions. [2018-12-02 15:43:54,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:54,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12547 states and 20414 transitions. [2018-12-02 15:43:54,955 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2018-12-02 15:43:54,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12547 states to 12547 states and 20414 transitions. [2018-12-02 15:43:54,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4741 [2018-12-02 15:43:54,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4741 [2018-12-02 15:43:54,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12547 states and 20414 transitions. [2018-12-02 15:43:54,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:54,980 INFO L705 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2018-12-02 15:43:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12547 states and 20414 transitions. [2018-12-02 15:43:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12547 to 12547. [2018-12-02 15:43:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12547 states. [2018-12-02 15:43:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12547 states to 12547 states and 20414 transitions. [2018-12-02 15:43:55,055 INFO L728 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2018-12-02 15:43:55,055 INFO L608 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2018-12-02 15:43:55,055 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 15:43:55,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12547 states and 20414 transitions. [2018-12-02 15:43:55,072 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2018-12-02 15:43:55,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:55,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:55,073 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:55,073 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:55,073 INFO L794 eck$LassoCheckResult]: Stem: 89791#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 89595#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 89596#L406 assume !(1 == ~c_req_up~0); 89638#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 89641#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 89642#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 89760#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 89761#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 89810#L437-1 assume !(0 == ~e_f~0); 89811#L442-1 assume !(0 == ~e_g~0); 89647#L447-1 assume !(0 == ~e_e~0); 89648#L452-1 assume !(0 == ~e_c~0); 89867#L457-1 assume !(0 == ~e_wl~0); 89866#L462-1 assume !(1 == ~wl_pc~0); 89863#L474 assume !(2 == ~wl_pc~0); 89862#L475 assume !(1 == ~c1_pc~0); 89860#L485 assume !(1 == ~c2_pc~0); 89851#L494 assume !(1 == ~wb_pc~0); 89846#L503 assume !(1 == ~e_c~0); 89842#L512-1 assume !(1 == ~e_e~0); 89837#L517-1 assume !(1 == ~e_f~0); 89836#L522-1 assume !(1 == ~e_g~0); 89628#L527-1 assume !(1 == ~e_c~0); 89629#L532-1 assume !(1 == ~e_wl~0); 91148#L674-1 assume !false; 91149#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 91095#L379 [2018-12-02 15:43:55,073 INFO L796 eck$LassoCheckResult]: Loop: 91095#L379 assume !false; 95831#L297 assume 0 == ~wl_st~0; 95826#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 95824#L323 assume !(0 != eval_~tmp~0); 95822#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91014#L338 assume !(0 != eval_~tmp___0~0); 95820#L334 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 91144#L353 assume !(0 != eval_~tmp___1~0); 91105#L349 assume !(0 == ~wb_st~0); 91097#L364 assume !(0 == ~r_st~0); 91095#L379 [2018-12-02 15:43:55,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:55,073 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2018-12-02 15:43:55,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:55,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:55,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:55,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:55,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:55,081 INFO L82 PathProgramCache]: Analyzing trace with hash 560500646, now seen corresponding path program 1 times [2018-12-02 15:43:55,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:55,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:55,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:55,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:55,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2086482018, now seen corresponding path program 1 times [2018-12-02 15:43:55,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:55,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:55,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:55,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:43:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:43:55,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:43:55,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:43:55,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:43:55,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:43:55,133 INFO L87 Difference]: Start difference. First operand 12547 states and 20414 transitions. cyclomatic complexity: 7900 Second operand 3 states. [2018-12-02 15:43:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:55,175 INFO L93 Difference]: Finished difference Result 21409 states and 34276 transitions. [2018-12-02 15:43:55,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:43:55,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21409 states and 34276 transitions. [2018-12-02 15:43:55,216 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 7356 [2018-12-02 15:43:55,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21409 states to 21409 states and 34276 transitions. [2018-12-02 15:43:55,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8025 [2018-12-02 15:43:55,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8025 [2018-12-02 15:43:55,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21409 states and 34276 transitions. [2018-12-02 15:43:55,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:43:55,255 INFO L705 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2018-12-02 15:43:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21409 states and 34276 transitions. [2018-12-02 15:43:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21409 to 21409. [2018-12-02 15:43:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21409 states. [2018-12-02 15:43:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21409 states to 21409 states and 34276 transitions. [2018-12-02 15:43:55,376 INFO L728 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2018-12-02 15:43:55,376 INFO L608 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2018-12-02 15:43:55,376 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 15:43:55,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21409 states and 34276 transitions. [2018-12-02 15:43:55,402 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 7356 [2018-12-02 15:43:55,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:43:55,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:43:55,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:55,403 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:55,403 INFO L794 eck$LassoCheckResult]: Stem: 123758#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 123558#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 123559#L406 assume !(1 == ~c_req_up~0); 123603#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 123607#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 123608#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 123725#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 123726#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 123775#L437-1 assume !(0 == ~e_f~0); 123776#L442-1 assume !(0 == ~e_g~0); 123613#L447-1 assume !(0 == ~e_e~0); 123614#L452-1 assume !(0 == ~e_c~0); 123847#L457-1 assume !(0 == ~e_wl~0); 123846#L462-1 assume !(1 == ~wl_pc~0); 123843#L474 assume !(2 == ~wl_pc~0); 123842#L475 assume !(1 == ~c1_pc~0); 123840#L485 assume !(1 == ~c2_pc~0); 123831#L494 assume !(1 == ~wb_pc~0); 123826#L503 assume !(1 == ~e_c~0); 123822#L512-1 assume !(1 == ~e_e~0); 123817#L517-1 assume !(1 == ~e_f~0); 123816#L522-1 assume !(1 == ~e_g~0); 123594#L527-1 assume !(1 == ~e_c~0); 123595#L532-1 assume !(1 == ~e_wl~0); 125339#L674-1 assume !false; 125340#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 124987#L379 [2018-12-02 15:43:55,403 INFO L796 eck$LassoCheckResult]: Loop: 124987#L379 assume !false; 124984#L297 assume 0 == ~wl_st~0; 124981#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 124977#L323 assume !(0 != eval_~tmp~0); 124978#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 126122#L338 assume !(0 != eval_~tmp___0~0); 125605#L334 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 125560#L353 assume !(0 != eval_~tmp___1~0); 125303#L349 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 125300#L368 assume !(0 != eval_~tmp___2~0); 125299#L364 assume !(0 == ~r_st~0); 124987#L379 [2018-12-02 15:43:55,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2018-12-02 15:43:55,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:55,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:55,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:55,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:55,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash 195616437, now seen corresponding path program 1 times [2018-12-02 15:43:55,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:55,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:55,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:43:55,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:55,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash -256467523, now seen corresponding path program 1 times [2018-12-02 15:43:55,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:43:55,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:43:55,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:43:55,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:43:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:55,695 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2018-12-02 15:43:55,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 03:43:55 BoogieIcfgContainer [2018-12-02 15:43:55,747 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 15:43:55,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:43:55,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:43:55,747 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:43:55,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:43:51" (3/4) ... [2018-12-02 15:43:55,750 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-02 15:43:55,792 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_410bdcfe-0853-41a6-a0ff-17f7d0568697/bin-2019/uautomizer/witness.graphml [2018-12-02 15:43:55,792 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:43:55,792 INFO L168 Benchmark]: Toolchain (without parser) took 5314.18 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 424.7 MB). Free memory was 956.0 MB in the beginning and 1.4 GB in the end (delta: -396.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:55,793 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:43:55,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.26 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:55,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:55,793 INFO L168 Benchmark]: Boogie Preprocessor took 17.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:43:55,793 INFO L168 Benchmark]: RCFGBuilder took 305.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:55,794 INFO L168 Benchmark]: BuchiAutomizer took 4714.47 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -278.4 MB). Peak memory consumption was 480.5 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:55,794 INFO L168 Benchmark]: Witness Printer took 44.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:55,795 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.26 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 305.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4714.47 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -278.4 MB). Peak memory consumption was 480.5 MB. Max. memory is 11.5 GB. * Witness Printer took 44.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. 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 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_f + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 21409 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 417 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 21409 states and ocurred in iteration 14. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4213 SDtfs, 3526 SDslu, 2462 SDs, 0 SdLazy, 323 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI5 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital80 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf190 smp75 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 296]: 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 {p_out=0, wb_st=0, processed=0, \result=0, c2_st=0, wl_pc=0, e_wl=2, tmp=0, e_c=2, e_e=2, kernel_st=1, e_p_in=0, tmp___1=0, t_b=0, tmp___2=0, p_in=0, wb_pc=0, data=0, tmp___0=0, wb_i=1, c_req_up=0, tmp___3=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a559181=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59109ab1=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c31f678=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11a933ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3663208d=0, r_i=0, d=0, e_f=2, e_g=2, r_st=2, __retres1=0, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 296]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L691] int __retres1 ; [L695] e_wl = 2 [L696] e_c = e_wl [L697] e_g = e_c [L698] e_f = e_g [L699] e_e = e_f [L700] wl_pc = 0 [L701] c1_pc = 0 [L702] c2_pc = 0 [L703] wb_pc = 0 [L704] wb_i = 1 [L705] c2_i = wb_i [L706] c1_i = c2_i [L707] wl_i = c1_i [L708] r_i = 0 [L709] c_req_up = 0 [L710] d = 0 [L711] c = 0 [L402] int kernel_st ; [L405] kernel_st = 0 [L406] COND FALSE !((int )c_req_up == 1) [L417] COND TRUE (int )wl_i == 1 [L418] wl_st = 0 [L422] COND TRUE (int )c1_i == 1 [L423] c1_st = 0 [L427] COND TRUE (int )c2_i == 1 [L428] c2_st = 0 [L432] COND TRUE (int )wb_i == 1 [L433] wb_st = 0 [L437] COND FALSE !((int )r_i == 1) [L440] r_st = 2 [L442] COND FALSE !((int )e_f == 0) [L447] COND FALSE !((int )e_g == 0) [L452] COND FALSE !((int )e_e == 0) [L457] COND FALSE !((int )e_c == 0) [L462] COND FALSE !((int )e_wl == 0) [L467] COND FALSE !((int )wl_pc == 1) [L475] COND FALSE !((int )wl_pc == 2) [L485] COND FALSE !((int )c1_pc == 1) [L494] COND FALSE !((int )c2_pc == 1) [L503] COND FALSE !((int )wb_pc == 1) [L512] COND FALSE !((int )e_c == 1) [L517] COND FALSE !((int )e_e == 1) [L522] COND FALSE !((int )e_f == 1) [L527] COND FALSE !((int )e_g == 1) [L532] COND FALSE !((int )e_c == 1) [L537] COND FALSE !((int )e_wl == 1) [L543] COND TRUE 1 [L546] kernel_st = 1 [L288] int tmp ; [L289] int tmp___0 ; [L290] int tmp___1 ; [L291] int tmp___2 ; [L292] int tmp___3 ; Loop: [L296] COND TRUE 1 [L298] COND TRUE (int )wl_st == 0 [L319] COND TRUE (int )wl_st == 0 [L321] tmp = __VERIFIER_nondet_int() [L323] COND FALSE !(\read(tmp)) [L334] COND TRUE (int )c1_st == 0 [L336] tmp___0 = __VERIFIER_nondet_int() [L338] COND FALSE !(\read(tmp___0)) [L349] COND TRUE (int )c2_st == 0 [L351] tmp___1 = __VERIFIER_nondet_int() [L353] COND FALSE !(\read(tmp___1)) [L364] COND TRUE (int )wb_st == 0 [L366] tmp___2 = __VERIFIER_nondet_int() [L368] COND FALSE !(\read(tmp___2)) [L379] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...