./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/toy2_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/systemc/toy2_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8989412e094655bcf4508d76eb9764ed06d0b34 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-0ed9222-m [2019-01-14 04:42:50,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:42:50,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:42:50,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:42:50,155 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:42:50,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:42:50,158 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:42:50,160 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:42:50,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:42:50,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:42:50,164 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:42:50,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:42:50,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:42:50,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:42:50,167 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:42:50,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:42:50,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:42:50,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:42:50,173 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:42:50,175 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:42:50,176 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:42:50,177 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:42:50,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:42:50,180 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:42:50,181 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:42:50,182 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:42:50,185 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:42:50,186 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:42:50,187 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:42:50,188 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:42:50,188 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:42:50,189 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:42:50,189 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:42:50,189 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:42:50,192 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:42:50,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:42:50,195 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:42:50,228 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:42:50,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:42:50,230 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:42:50,230 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:42:50,230 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:42:50,230 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:42:50,230 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:42:50,233 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:42:50,233 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:42:50,233 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:42:50,233 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:42:50,233 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:42:50,234 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:42:50,234 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:42:50,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:42:50,235 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:42:50,235 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:42:50,235 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:42:50,235 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:42:50,235 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:42:50,235 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:42:50,236 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:42:50,238 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:42:50,238 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:42:50,238 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:42:50,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:42:50,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:42:50,239 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:42:50,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:42:50,240 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:42:50,240 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:42:50,242 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:42:50,243 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8989412e094655bcf4508d76eb9764ed06d0b34 [2019-01-14 04:42:50,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:42:50,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:42:50,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:42:50,296 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:42:50,296 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:42:50,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2019-01-14 04:42:50,349 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7d2b441/9fd2e2e3d2004582998da916355e940f/FLAGd45271a28 [2019-01-14 04:42:50,797 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:42:50,799 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2019-01-14 04:42:50,818 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7d2b441/9fd2e2e3d2004582998da916355e940f/FLAGd45271a28 [2019-01-14 04:42:51,130 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7d2b441/9fd2e2e3d2004582998da916355e940f [2019-01-14 04:42:51,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:42:51,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:42:51,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:42:51,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:42:51,140 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:42:51,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:42:51" (1/1) ... [2019-01-14 04:42:51,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e21fa69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51, skipping insertion in model container [2019-01-14 04:42:51,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:42:51" (1/1) ... [2019-01-14 04:42:51,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:42:51,209 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:42:51,494 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:42:51,507 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:42:51,603 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:42:51,623 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:42:51,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51 WrapperNode [2019-01-14 04:42:51,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:42:51,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:42:51,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:42:51,626 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:42:51,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51" (1/1) ... [2019-01-14 04:42:51,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51" (1/1) ... [2019-01-14 04:42:51,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:42:51,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:42:51,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:42:51,779 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:42:51,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51" (1/1) ... [2019-01-14 04:42:51,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51" (1/1) ... [2019-01-14 04:42:51,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51" (1/1) ... [2019-01-14 04:42:51,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51" (1/1) ... [2019-01-14 04:42:51,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51" (1/1) ... [2019-01-14 04:42:51,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51" (1/1) ... [2019-01-14 04:42:51,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51" (1/1) ... [2019-01-14 04:42:51,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:42:51,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:42:51,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:42:51,840 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:42:51,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:42:51,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:42:53,021 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:42:53,022 INFO L286 CfgBuilder]: Removed 26 assue(true) statements. [2019-01-14 04:42:53,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:42:53 BoogieIcfgContainer [2019-01-14 04:42:53,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:42:53,024 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:42:53,024 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:42:53,028 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:42:53,028 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:42:53,029 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:42:51" (1/3) ... [2019-01-14 04:42:53,030 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e9f00c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:42:53, skipping insertion in model container [2019-01-14 04:42:53,030 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:42:53,030 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:51" (2/3) ... [2019-01-14 04:42:53,031 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e9f00c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:42:53, skipping insertion in model container [2019-01-14 04:42:53,031 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:42:53,032 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:42:53" (3/3) ... [2019-01-14 04:42:53,033 INFO L375 chiAutomizerObserver]: Analyzing ICFG toy2_false-unreach-call_false-termination.cil.c [2019-01-14 04:42:53,090 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:42:53,091 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:42:53,091 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:42:53,092 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:42:53,093 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:42:53,093 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:42:53,093 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:42:53,093 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:42:53,094 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:42:53,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states. [2019-01-14 04:42:53,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-01-14 04:42:53,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:53,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:53,154 INFO L867 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] [2019-01-14 04:42:53,154 INFO L868 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] [2019-01-14 04:42:53,154 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:42:53,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states. [2019-01-14 04:42:53,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-01-14 04:42:53,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:53,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:53,166 INFO L867 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] [2019-01-14 04:42:53,167 INFO L868 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] [2019-01-14 04:42:53,176 INFO L794 eck$LassoCheckResult]: Stem: 94#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; 10#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; 74#L394true assume !(1 == ~c_req_up~0); 63#L394-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 61#L405-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 88#L410-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 109#L415-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 4#L420-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 27#L425-1true assume !(0 == ~e_f~0); 54#L430-1true assume !(0 == ~e_g~0); 79#L435-1true assume !(0 == ~e_e~0); 101#L440-1true assume !(0 == ~e_c~0); 122#L445-1true assume !(0 == ~e_wl~0); 21#L450-1true assume !(1 == ~wl_pc~0); 100#L462true assume !(2 == ~wl_pc~0); 67#L463true assume !(1 == ~c1_pc~0); 98#L473true assume !(1 == ~c2_pc~0); 70#L482true assume !(1 == ~wb_pc~0); 42#L491true assume !(1 == ~e_c~0); 120#L500-1true assume !(1 == ~e_e~0); 17#L505-1true assume !(1 == ~e_f~0); 47#L510-1true assume !(1 == ~e_g~0); 71#L515-1true assume !(1 == ~e_c~0); 96#L520-1true assume !(1 == ~e_wl~0); 24#L662-1true [2019-01-14 04:42:53,178 INFO L796 eck$LassoCheckResult]: Loop: 24#L662-1true assume !false; 45#L532true 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; 51#L367true assume !true; 75#L383true start_simulation_~kernel_st~0 := 2; 35#L538true assume !(1 == ~c_req_up~0); 18#L538-2true start_simulation_~kernel_st~0 := 3; 113#L550true assume !(0 == ~e_f~0); 97#L550-2true assume 0 == ~e_g~0;~e_g~0 := 1; 8#L555-1true assume 0 == ~e_e~0;~e_e~0 := 1; 36#L560-1true assume 0 == ~e_c~0;~e_c~0 := 1; 46#L565-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 68#L570-1true assume !(1 == ~wl_pc~0); 34#L582true assume !(2 == ~wl_pc~0); 112#L583true assume !(1 == ~c1_pc~0); 32#L593true assume !(1 == ~c2_pc~0); 125#L602true assume !(1 == ~wb_pc~0); 90#L611true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L620-1true assume !(1 == ~e_e~0); 85#L625-1true assume 1 == ~e_f~0;~e_f~0 := 2; 107#L630-1true assume 1 == ~e_g~0;~e_g~0 := 2; 126#L635-1true assume 1 == ~e_c~0;~e_c~0 := 2; 25#L640-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 40#L645-1true assume 0 == ~wl_st~0; 24#L662-1true [2019-01-14 04:42:53,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:53,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2019-01-14 04:42:53,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:53,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:53,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:53,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:53,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:53,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:53,388 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:53,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:53,389 INFO L82 PathProgramCache]: Analyzing trace with hash 25607920, now seen corresponding path program 1 times [2019-01-14 04:42:53,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:53,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:53,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:53,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:53,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:53,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:42:53,408 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:53,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:42:53,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:42:53,433 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-01-14 04:42:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:53,465 INFO L93 Difference]: Finished difference Result 124 states and 217 transitions. [2019-01-14 04:42:53,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:42:53,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 217 transitions. [2019-01-14 04:42:53,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-01-14 04:42:53,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 212 transitions. [2019-01-14 04:42:53,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-14 04:42:53,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-01-14 04:42:53,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 212 transitions. [2019-01-14 04:42:53,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:42:53,504 INFO L706 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2019-01-14 04:42:53,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 212 transitions. [2019-01-14 04:42:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-14 04:42:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-14 04:42:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 212 transitions. [2019-01-14 04:42:53,547 INFO L729 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2019-01-14 04:42:53,547 INFO L609 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2019-01-14 04:42:53,547 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:42:53,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 212 transitions. [2019-01-14 04:42:53,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-01-14 04:42:53,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:53,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:53,553 INFO L867 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] [2019-01-14 04:42:53,553 INFO L868 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] [2019-01-14 04:42:53,554 INFO L794 eck$LassoCheckResult]: Stem: 369#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; 275#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; 276#L394 assume !(1 == ~c_req_up~0); 278#L394-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 351#L405-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 352#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 366#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 260#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 261#L425-1 assume !(0 == ~e_f~0); 307#L430-1 assume !(0 == ~e_g~0); 344#L435-1 assume !(0 == ~e_e~0); 362#L440-1 assume !(0 == ~e_c~0); 372#L445-1 assume !(0 == ~e_wl~0); 297#L450-1 assume !(1 == ~wl_pc~0); 298#L462 assume !(2 == ~wl_pc~0); 284#L463 assume !(1 == ~c1_pc~0); 356#L473 assume !(1 == ~c2_pc~0); 289#L482 assume !(1 == ~wb_pc~0); 332#L491 assume !(1 == ~e_c~0); 333#L500-1 assume !(1 == ~e_e~0); 290#L505-1 assume !(1 == ~e_f~0); 291#L510-1 assume !(1 == ~e_g~0); 337#L515-1 assume !(1 == ~e_c~0); 358#L520-1 assume !(1 == ~e_wl~0); 301#L662-1 [2019-01-14 04:42:53,554 INFO L796 eck$LassoCheckResult]: Loop: 301#L662-1 assume !false; 303#L532 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; 335#L367 assume !false; 265#L285 assume !(0 == ~wl_st~0); 267#L289 assume !(0 == ~c1_st~0); 365#L292 assume !(0 == ~c2_st~0); 345#L295 assume !(0 == ~wb_st~0); 346#L298 assume !(0 == ~r_st~0); 353#L383 start_simulation_~kernel_st~0 := 2; 322#L538 assume !(1 == ~c_req_up~0); 294#L538-2 start_simulation_~kernel_st~0 := 3; 295#L550 assume !(0 == ~e_f~0); 370#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 271#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 272#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 325#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 336#L570-1 assume 1 == ~wl_pc~0; 350#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 320#L583 assume !(1 == ~c1_pc~0); 315#L593 assume !(1 == ~c2_pc~0); 317#L602 assume !(1 == ~wb_pc~0); 328#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 348#L620-1 assume !(1 == ~e_e~0); 349#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 364#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 374#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 304#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 305#L645-1 assume 0 == ~wl_st~0; 301#L662-1 [2019-01-14 04:42:53,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:53,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2019-01-14 04:42:53,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:53,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:53,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:53,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:53,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:53,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:53,636 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:53,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:53,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 1 times [2019-01-14 04:42:53,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:53,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:53,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:53,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:53,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:53,688 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:53,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:53,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:53,690 INFO L87 Difference]: Start difference. First operand 119 states and 212 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-01-14 04:42:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:53,736 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2019-01-14 04:42:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:53,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 211 transitions. [2019-01-14 04:42:53,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-01-14 04:42:53,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 211 transitions. [2019-01-14 04:42:53,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-14 04:42:53,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-01-14 04:42:53,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 211 transitions. [2019-01-14 04:42:53,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:42:53,745 INFO L706 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2019-01-14 04:42:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 211 transitions. [2019-01-14 04:42:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-14 04:42:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-14 04:42:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 211 transitions. [2019-01-14 04:42:53,759 INFO L729 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2019-01-14 04:42:53,759 INFO L609 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2019-01-14 04:42:53,759 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:42:53,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 211 transitions. [2019-01-14 04:42:53,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-01-14 04:42:53,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:53,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:53,768 INFO L867 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] [2019-01-14 04:42:53,769 INFO L868 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] [2019-01-14 04:42:53,769 INFO L794 eck$LassoCheckResult]: Stem: 614#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; 520#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; 521#L394 assume !(1 == ~c_req_up~0); 523#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 596#L405-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 597#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 611#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 505#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 506#L425-1 assume !(0 == ~e_f~0); 552#L430-1 assume !(0 == ~e_g~0); 589#L435-1 assume !(0 == ~e_e~0); 607#L440-1 assume !(0 == ~e_c~0); 617#L445-1 assume !(0 == ~e_wl~0); 542#L450-1 assume !(1 == ~wl_pc~0); 543#L462 assume !(2 == ~wl_pc~0); 529#L463 assume !(1 == ~c1_pc~0); 601#L473 assume !(1 == ~c2_pc~0); 534#L482 assume !(1 == ~wb_pc~0); 577#L491 assume !(1 == ~e_c~0); 578#L500-1 assume !(1 == ~e_e~0); 535#L505-1 assume !(1 == ~e_f~0); 536#L510-1 assume !(1 == ~e_g~0); 582#L515-1 assume !(1 == ~e_c~0); 603#L520-1 assume !(1 == ~e_wl~0); 546#L662-1 [2019-01-14 04:42:53,769 INFO L796 eck$LassoCheckResult]: Loop: 546#L662-1 assume !false; 548#L532 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; 580#L367 assume !false; 510#L285 assume !(0 == ~wl_st~0); 512#L289 assume !(0 == ~c1_st~0); 610#L292 assume !(0 == ~c2_st~0); 590#L295 assume !(0 == ~wb_st~0); 591#L298 assume !(0 == ~r_st~0); 598#L383 start_simulation_~kernel_st~0 := 2; 567#L538 assume !(1 == ~c_req_up~0); 539#L538-2 start_simulation_~kernel_st~0 := 3; 540#L550 assume !(0 == ~e_f~0); 615#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 516#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 517#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 570#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 581#L570-1 assume 1 == ~wl_pc~0; 595#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 565#L583 assume !(1 == ~c1_pc~0); 560#L593 assume !(1 == ~c2_pc~0); 562#L602 assume !(1 == ~wb_pc~0); 573#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 593#L620-1 assume !(1 == ~e_e~0); 594#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 609#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 619#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 549#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 550#L645-1 assume 0 == ~wl_st~0; 546#L662-1 [2019-01-14 04:42:53,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:53,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2019-01-14 04:42:53,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:53,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:53,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:53,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:53,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:53,830 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 2 times [2019-01-14 04:42:53,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:53,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:53,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:53,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:53,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:53,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:53,878 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:53,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:53,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:53,879 INFO L87 Difference]: Start difference. First operand 119 states and 211 transitions. cyclomatic complexity: 93 Second operand 3 states. [2019-01-14 04:42:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:53,903 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2019-01-14 04:42:53,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:53,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 210 transitions. [2019-01-14 04:42:53,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-01-14 04:42:53,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 210 transitions. [2019-01-14 04:42:53,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-14 04:42:53,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-01-14 04:42:53,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 210 transitions. [2019-01-14 04:42:53,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:42:53,912 INFO L706 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2019-01-14 04:42:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 210 transitions. [2019-01-14 04:42:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-14 04:42:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-14 04:42:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 210 transitions. [2019-01-14 04:42:53,923 INFO L729 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2019-01-14 04:42:53,924 INFO L609 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2019-01-14 04:42:53,924 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:42:53,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 210 transitions. [2019-01-14 04:42:53,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-01-14 04:42:53,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:53,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:53,932 INFO L867 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] [2019-01-14 04:42:53,932 INFO L868 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] [2019-01-14 04:42:53,933 INFO L794 eck$LassoCheckResult]: Stem: 859#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; 765#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; 766#L394 assume !(1 == ~c_req_up~0); 768#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 841#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 842#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 856#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 750#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 751#L425-1 assume !(0 == ~e_f~0); 797#L430-1 assume !(0 == ~e_g~0); 834#L435-1 assume !(0 == ~e_e~0); 852#L440-1 assume !(0 == ~e_c~0); 862#L445-1 assume !(0 == ~e_wl~0); 787#L450-1 assume !(1 == ~wl_pc~0); 788#L462 assume !(2 == ~wl_pc~0); 774#L463 assume !(1 == ~c1_pc~0); 846#L473 assume !(1 == ~c2_pc~0); 779#L482 assume !(1 == ~wb_pc~0); 822#L491 assume !(1 == ~e_c~0); 823#L500-1 assume !(1 == ~e_e~0); 780#L505-1 assume !(1 == ~e_f~0); 781#L510-1 assume !(1 == ~e_g~0); 827#L515-1 assume !(1 == ~e_c~0); 848#L520-1 assume !(1 == ~e_wl~0); 791#L662-1 [2019-01-14 04:42:53,933 INFO L796 eck$LassoCheckResult]: Loop: 791#L662-1 assume !false; 793#L532 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; 825#L367 assume !false; 755#L285 assume !(0 == ~wl_st~0); 757#L289 assume !(0 == ~c1_st~0); 855#L292 assume !(0 == ~c2_st~0); 835#L295 assume !(0 == ~wb_st~0); 836#L298 assume !(0 == ~r_st~0); 843#L383 start_simulation_~kernel_st~0 := 2; 812#L538 assume !(1 == ~c_req_up~0); 784#L538-2 start_simulation_~kernel_st~0 := 3; 785#L550 assume !(0 == ~e_f~0); 860#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 761#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 762#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 815#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 826#L570-1 assume 1 == ~wl_pc~0; 840#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 810#L583 assume !(1 == ~c1_pc~0); 805#L593 assume !(1 == ~c2_pc~0); 807#L602 assume !(1 == ~wb_pc~0); 818#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 838#L620-1 assume !(1 == ~e_e~0); 839#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 854#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 864#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 794#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 795#L645-1 assume 0 == ~wl_st~0; 791#L662-1 [2019-01-14 04:42:53,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:53,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2019-01-14 04:42:53,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:53,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:53,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:53,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:53,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:53,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:53,996 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 3 times [2019-01-14 04:42:53,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:53,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:53,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:53,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:54,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:54,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:54,070 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:54,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:54,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:54,071 INFO L87 Difference]: Start difference. First operand 119 states and 210 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-01-14 04:42:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:54,099 INFO L93 Difference]: Finished difference Result 119 states and 209 transitions. [2019-01-14 04:42:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:54,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 209 transitions. [2019-01-14 04:42:54,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-01-14 04:42:54,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 209 transitions. [2019-01-14 04:42:54,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-14 04:42:54,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-01-14 04:42:54,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 209 transitions. [2019-01-14 04:42:54,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:42:54,111 INFO L706 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2019-01-14 04:42:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 209 transitions. [2019-01-14 04:42:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-14 04:42:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-14 04:42:54,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 209 transitions. [2019-01-14 04:42:54,121 INFO L729 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2019-01-14 04:42:54,121 INFO L609 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2019-01-14 04:42:54,122 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:42:54,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 209 transitions. [2019-01-14 04:42:54,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-01-14 04:42:54,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:54,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:54,129 INFO L867 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] [2019-01-14 04:42:54,129 INFO L868 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] [2019-01-14 04:42:54,130 INFO L794 eck$LassoCheckResult]: Stem: 1104#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; 1010#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; 1011#L394 assume !(1 == ~c_req_up~0); 1013#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1086#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1087#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1101#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 995#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 996#L425-1 assume !(0 == ~e_f~0); 1042#L430-1 assume !(0 == ~e_g~0); 1079#L435-1 assume !(0 == ~e_e~0); 1097#L440-1 assume !(0 == ~e_c~0); 1107#L445-1 assume !(0 == ~e_wl~0); 1032#L450-1 assume !(1 == ~wl_pc~0); 1033#L462 assume !(2 == ~wl_pc~0); 1019#L463 assume !(1 == ~c1_pc~0); 1091#L473 assume !(1 == ~c2_pc~0); 1024#L482 assume !(1 == ~wb_pc~0); 1067#L491 assume !(1 == ~e_c~0); 1068#L500-1 assume !(1 == ~e_e~0); 1025#L505-1 assume !(1 == ~e_f~0); 1026#L510-1 assume !(1 == ~e_g~0); 1072#L515-1 assume !(1 == ~e_c~0); 1093#L520-1 assume !(1 == ~e_wl~0); 1036#L662-1 [2019-01-14 04:42:54,130 INFO L796 eck$LassoCheckResult]: Loop: 1036#L662-1 assume !false; 1038#L532 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; 1070#L367 assume !false; 1000#L285 assume !(0 == ~wl_st~0); 1002#L289 assume !(0 == ~c1_st~0); 1100#L292 assume !(0 == ~c2_st~0); 1080#L295 assume !(0 == ~wb_st~0); 1081#L298 assume !(0 == ~r_st~0); 1088#L383 start_simulation_~kernel_st~0 := 2; 1057#L538 assume !(1 == ~c_req_up~0); 1029#L538-2 start_simulation_~kernel_st~0 := 3; 1030#L550 assume !(0 == ~e_f~0); 1105#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1006#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1007#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1060#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1071#L570-1 assume 1 == ~wl_pc~0; 1085#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1055#L583 assume !(1 == ~c1_pc~0); 1050#L593 assume !(1 == ~c2_pc~0); 1052#L602 assume !(1 == ~wb_pc~0); 1063#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 1083#L620-1 assume !(1 == ~e_e~0); 1084#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1099#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1109#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1039#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1040#L645-1 assume 0 == ~wl_st~0; 1036#L662-1 [2019-01-14 04:42:54,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:54,130 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2019-01-14 04:42:54,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:54,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:54,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:54,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:54,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:54,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 4 times [2019-01-14 04:42:54,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:54,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:54,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:54,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:54,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:54,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:54,226 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:54,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:54,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:54,227 INFO L87 Difference]: Start difference. First operand 119 states and 209 transitions. cyclomatic complexity: 91 Second operand 3 states. [2019-01-14 04:42:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:54,314 INFO L93 Difference]: Finished difference Result 147 states and 260 transitions. [2019-01-14 04:42:54,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:54,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 260 transitions. [2019-01-14 04:42:54,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2019-01-14 04:42:54,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 260 transitions. [2019-01-14 04:42:54,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-01-14 04:42:54,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2019-01-14 04:42:54,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 260 transitions. [2019-01-14 04:42:54,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:42:54,322 INFO L706 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2019-01-14 04:42:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 260 transitions. [2019-01-14 04:42:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-14 04:42:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-14 04:42:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 260 transitions. [2019-01-14 04:42:54,330 INFO L729 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2019-01-14 04:42:54,330 INFO L609 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2019-01-14 04:42:54,330 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:42:54,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 260 transitions. [2019-01-14 04:42:54,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2019-01-14 04:42:54,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:54,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:54,335 INFO L867 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] [2019-01-14 04:42:54,335 INFO L868 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] [2019-01-14 04:42:54,336 INFO L794 eck$LassoCheckResult]: Stem: 1380#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; 1283#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; 1284#L394 assume !(1 == ~c_req_up~0); 1286#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1359#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1360#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1377#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1267#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1268#L425-1 assume !(0 == ~e_f~0); 1315#L430-1 assume !(0 == ~e_g~0); 1352#L435-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1372#L440-1 assume !(0 == ~e_c~0); 1383#L445-1 assume !(0 == ~e_wl~0); 1305#L450-1 assume !(1 == ~wl_pc~0); 1306#L462 assume !(2 == ~wl_pc~0); 1292#L463 assume !(1 == ~c1_pc~0); 1366#L473 assume !(1 == ~c2_pc~0); 1297#L482 assume !(1 == ~wb_pc~0); 1340#L491 assume !(1 == ~e_c~0); 1341#L500-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1298#L505-1 assume !(1 == ~e_f~0); 1299#L510-1 assume !(1 == ~e_g~0); 1345#L515-1 assume !(1 == ~e_c~0); 1368#L520-1 assume !(1 == ~e_wl~0); 1309#L662-1 [2019-01-14 04:42:54,337 INFO L796 eck$LassoCheckResult]: Loop: 1309#L662-1 assume !false; 1311#L532 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; 1343#L367 assume !false; 1272#L285 assume !(0 == ~wl_st~0); 1274#L289 assume !(0 == ~c1_st~0); 1376#L292 assume !(0 == ~c2_st~0); 1353#L295 assume !(0 == ~wb_st~0); 1354#L298 assume !(0 == ~r_st~0); 1361#L383 start_simulation_~kernel_st~0 := 2; 1330#L538 assume !(1 == ~c_req_up~0); 1302#L538-2 start_simulation_~kernel_st~0 := 3; 1303#L550 assume !(0 == ~e_f~0); 1381#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1278#L555-1 assume !(0 == ~e_e~0); 1280#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1333#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1344#L570-1 assume 1 == ~wl_pc~0; 1358#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1328#L583 assume !(1 == ~c1_pc~0); 1323#L593 assume !(1 == ~c2_pc~0); 1325#L602 assume !(1 == ~wb_pc~0); 1389#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 1388#L620-1 assume !(1 == ~e_e~0); 1357#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1375#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1385#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1312#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1313#L645-1 assume 0 == ~wl_st~0; 1309#L662-1 [2019-01-14 04:42:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1264875287, now seen corresponding path program 1 times [2019-01-14 04:42:54,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:54,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:54,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:54,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:54,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:54,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:54,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:42:54,380 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:54,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:54,381 INFO L82 PathProgramCache]: Analyzing trace with hash 922220149, now seen corresponding path program 1 times [2019-01-14 04:42:54,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:54,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:54,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:54,997 WARN L181 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-14 04:42:55,130 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-14 04:42:55,145 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:42:55,146 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:42:55,146 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:42:55,146 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:42:55,147 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:42:55,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:55,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:42:55,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:42:55,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2019-01-14 04:42:55,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:42:55,148 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:42:55,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,812 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:42:55,813 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:42:55,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:55,819 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:55,829 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:42:55,829 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:42:55,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:55,877 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:42:55,941 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:42:55,941 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:55,959 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:42:55,980 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:42:55,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:42:55,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:42:55,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:42:55,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:42:55,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:55,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:42:55,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:42:55,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2019-01-14 04:42:55,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:42:55,982 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:42:55,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:55,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:56,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:57,023 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:42:57,112 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:42:57,118 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:42:57,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:42:57,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:57,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:57,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:57,128 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:42:57,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:57,132 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:42:57,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:57,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:42:57,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:42:57,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:57,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:57,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:57,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:42:57,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:57,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:42:57,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:57,148 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:42:57,153 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:42:57,153 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:42:57,156 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:42:57,156 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:42:57,156 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:42:57,157 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2019-01-14 04:42:57,159 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:42:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:57,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:42:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:57,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:42:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:57,582 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 [2019-01-14 04:42:57,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 260 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-01-14 04:42:57,764 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 260 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 461 states and 811 transitions. Complement of second has 5 states. [2019-01-14 04:42:57,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:42:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:42:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2019-01-14 04:42:57,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 24 letters. Loop has 28 letters. [2019-01-14 04:42:57,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:57,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 52 letters. Loop has 28 letters. [2019-01-14 04:42:57,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:57,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 24 letters. Loop has 56 letters. [2019-01-14 04:42:57,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:57,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 461 states and 811 transitions. [2019-01-14 04:42:57,783 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 306 [2019-01-14 04:42:57,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 461 states to 461 states and 811 transitions. [2019-01-14 04:42:57,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2019-01-14 04:42:57,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2019-01-14 04:42:57,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 811 transitions. [2019-01-14 04:42:57,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:57,791 INFO L706 BuchiCegarLoop]: Abstraction has 461 states and 811 transitions. [2019-01-14 04:42:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 811 transitions. [2019-01-14 04:42:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 355. [2019-01-14 04:42:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-01-14 04:42:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 626 transitions. [2019-01-14 04:42:57,810 INFO L729 BuchiCegarLoop]: Abstraction has 355 states and 626 transitions. [2019-01-14 04:42:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:42:57,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:42:57,810 INFO L87 Difference]: Start difference. First operand 355 states and 626 transitions. Second operand 4 states. [2019-01-14 04:42:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:58,144 INFO L93 Difference]: Finished difference Result 595 states and 1033 transitions. [2019-01-14 04:42:58,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:42:58,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 1033 transitions. [2019-01-14 04:42:58,151 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 340 [2019-01-14 04:42:58,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 595 states and 1033 transitions. [2019-01-14 04:42:58,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2019-01-14 04:42:58,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2019-01-14 04:42:58,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 595 states and 1033 transitions. [2019-01-14 04:42:58,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:58,159 INFO L706 BuchiCegarLoop]: Abstraction has 595 states and 1033 transitions. [2019-01-14 04:42:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states and 1033 transitions. [2019-01-14 04:42:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 559. [2019-01-14 04:42:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-01-14 04:42:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 976 transitions. [2019-01-14 04:42:58,178 INFO L729 BuchiCegarLoop]: Abstraction has 559 states and 976 transitions. [2019-01-14 04:42:58,178 INFO L609 BuchiCegarLoop]: Abstraction has 559 states and 976 transitions. [2019-01-14 04:42:58,178 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:42:58,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 559 states and 976 transitions. [2019-01-14 04:42:58,184 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 340 [2019-01-14 04:42:58,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:58,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:58,189 INFO L867 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] [2019-01-14 04:42:58,190 INFO L868 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] [2019-01-14 04:42:58,190 INFO L794 eck$LassoCheckResult]: Stem: 3220#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; 3036#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; 3037#L394 assume !(1 == ~c_req_up~0); 3039#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3182#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3183#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3212#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3008#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3009#L425-1 assume !(0 == ~e_f~0); 3090#L430-1 assume !(0 == ~e_g~0); 3169#L435-1 assume !(0 == ~e_e~0); 3202#L440-1 assume !(0 == ~e_c~0); 3234#L445-1 assume !(0 == ~e_wl~0); 3073#L450-1 assume !(1 == ~wl_pc~0); 3074#L462 assume !(2 == ~wl_pc~0); 3050#L463 assume !(1 == ~c1_pc~0); 3309#L473 assume !(1 == ~c2_pc~0); 3307#L482 assume !(1 == ~wb_pc~0); 3142#L491 assume !(1 == ~e_c~0); 3143#L500-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3252#L505-1 assume !(1 == ~e_f~0); 3060#L510-1 assume !(1 == ~e_g~0); 3287#L515-1 assume !(1 == ~e_c~0); 3225#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3226#L662-1 [2019-01-14 04:42:58,190 INFO L796 eck$LassoCheckResult]: Loop: 3226#L662-1 assume !false; 3376#L532 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; 3372#L367 assume !false; 3369#L285 assume !(0 == ~wl_st~0); 3367#L289 assume !(0 == ~c1_st~0); 3364#L292 assume !(0 == ~c2_st~0); 3361#L295 assume !(0 == ~wb_st~0); 3357#L298 assume !(0 == ~r_st~0); 3352#L383 start_simulation_~kernel_st~0 := 2; 3347#L538 assume !(1 == ~c_req_up~0); 3343#L538-2 start_simulation_~kernel_st~0 := 3; 3341#L550 assume !(0 == ~e_f~0); 3337#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3338#L555-1 assume !(0 == ~e_e~0); 3335#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3336#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3455#L570-1 assume !(1 == ~wl_pc~0); 3451#L582 assume !(2 == ~wl_pc~0); 3447#L583 assume !(1 == ~c1_pc~0); 3443#L593 assume !(1 == ~c2_pc~0); 3439#L602 assume !(1 == ~wb_pc~0); 3435#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 3432#L620-1 assume !(1 == ~e_e~0); 3431#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3429#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3428#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3389#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3384#L645-1 assume 0 == ~wl_st~0; 3226#L662-1 [2019-01-14 04:42:58,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:58,190 INFO L82 PathProgramCache]: Analyzing trace with hash 253758035, now seen corresponding path program 1 times [2019-01-14 04:42:58,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:58,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:58,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:58,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:42:58,259 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1471479870, now seen corresponding path program 1 times [2019-01-14 04:42:58,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:58,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:58,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:58,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:42:58,319 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:58,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:42:58,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:42:58,320 INFO L87 Difference]: Start difference. First operand 559 states and 976 transitions. cyclomatic complexity: 423 Second operand 4 states. [2019-01-14 04:42:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:58,645 INFO L93 Difference]: Finished difference Result 1029 states and 1741 transitions. [2019-01-14 04:42:58,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:42:58,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1029 states and 1741 transitions. [2019-01-14 04:42:58,657 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 638 [2019-01-14 04:42:58,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1029 states to 1029 states and 1741 transitions. [2019-01-14 04:42:58,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 706 [2019-01-14 04:42:58,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 706 [2019-01-14 04:42:58,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1029 states and 1741 transitions. [2019-01-14 04:42:58,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:58,668 INFO L706 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2019-01-14 04:42:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states and 1741 transitions. [2019-01-14 04:42:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2019-01-14 04:42:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-01-14 04:42:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1741 transitions. [2019-01-14 04:42:58,694 INFO L729 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2019-01-14 04:42:58,694 INFO L609 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2019-01-14 04:42:58,694 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:42:58,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1029 states and 1741 transitions. [2019-01-14 04:42:58,702 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 638 [2019-01-14 04:42:58,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:58,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:58,703 INFO L867 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] [2019-01-14 04:42:58,703 INFO L868 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] [2019-01-14 04:42:58,703 INFO L794 eck$LassoCheckResult]: Stem: 4819#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; 4635#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; 4636#L394 assume !(1 == ~c_req_up~0); 4794#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4861#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4812#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4813#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4607#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4608#L425-1 assume !(0 == ~e_f~0); 4766#L430-1 assume !(0 == ~e_g~0); 4767#L435-1 assume !(0 == ~e_e~0); 4828#L440-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4829#L445-1 assume !(0 == ~e_wl~0); 4860#L450-1 assume !(1 == ~wl_pc~0); 4858#L462 assume !(2 == ~wl_pc~0); 4856#L463 assume !(1 == ~c1_pc~0); 4827#L473 assume !(1 == ~c2_pc~0); 4656#L482 assume !(1 == ~wb_pc~0); 4789#L491 assume !(1 == ~e_c~0); 4846#L500-1 assume !(1 == ~e_e~0); 4847#L505-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4864#L510-1 assume !(1 == ~e_g~0); 4865#L515-1 assume !(1 == ~e_c~0); 4938#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4675#L662-1 [2019-01-14 04:42:58,706 INFO L796 eck$LassoCheckResult]: Loop: 4675#L662-1 assume !false; 4680#L532 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; 4748#L367 assume !false; 4615#L285 assume !(0 == ~wl_st~0); 4617#L289 assume !(0 == ~c1_st~0); 4810#L292 assume !(0 == ~c2_st~0); 4768#L295 assume !(0 == ~wb_st~0); 4769#L298 assume !(0 == ~r_st~0); 4783#L383 start_simulation_~kernel_st~0 := 2; 4718#L538 assume !(1 == ~c_req_up~0); 4720#L538-2 start_simulation_~kernel_st~0 := 3; 5107#L550 assume !(0 == ~e_f~0); 4823#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 4627#L555-1 assume !(0 == ~e_e~0); 4628#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 5144#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5142#L570-1 assume !(1 == ~wl_pc~0); 5138#L582 assume !(2 == ~wl_pc~0); 5136#L583 assume !(1 == ~c1_pc~0); 5134#L593 assume !(1 == ~c2_pc~0); 5102#L602 assume !(1 == ~wb_pc~0); 5101#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 5121#L620-1 assume !(1 == ~e_e~0); 5120#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 5119#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 5118#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4682#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4683#L645-1 assume 0 == ~wl_st~0; 4675#L662-1 [2019-01-14 04:42:58,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:58,707 INFO L82 PathProgramCache]: Analyzing trace with hash 842351509, now seen corresponding path program 1 times [2019-01-14 04:42:58,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:58,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:58,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:58,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:58,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:58,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:42:58,786 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:58,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1471479870, now seen corresponding path program 2 times [2019-01-14 04:42:58,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:58,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:58,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:58,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:42:58,812 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:58,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:42:58,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:42:58,813 INFO L87 Difference]: Start difference. First operand 1029 states and 1741 transitions. cyclomatic complexity: 724 Second operand 4 states. [2019-01-14 04:42:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:59,502 INFO L93 Difference]: Finished difference Result 1300 states and 2165 transitions. [2019-01-14 04:42:59,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:42:59,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1300 states and 2165 transitions. [2019-01-14 04:42:59,514 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 808 [2019-01-14 04:42:59,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1300 states to 1300 states and 2165 transitions. [2019-01-14 04:42:59,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 892 [2019-01-14 04:42:59,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 892 [2019-01-14 04:42:59,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1300 states and 2165 transitions. [2019-01-14 04:42:59,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:59,531 INFO L706 BuchiCegarLoop]: Abstraction has 1300 states and 2165 transitions. [2019-01-14 04:42:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states and 2165 transitions. [2019-01-14 04:42:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1276. [2019-01-14 04:42:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-01-14 04:42:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 2141 transitions. [2019-01-14 04:42:59,562 INFO L729 BuchiCegarLoop]: Abstraction has 1276 states and 2141 transitions. [2019-01-14 04:42:59,562 INFO L609 BuchiCegarLoop]: Abstraction has 1276 states and 2141 transitions. [2019-01-14 04:42:59,562 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:42:59,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1276 states and 2141 transitions. [2019-01-14 04:42:59,572 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 808 [2019-01-14 04:42:59,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:59,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:59,575 INFO L867 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] [2019-01-14 04:42:59,575 INFO L868 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] [2019-01-14 04:42:59,575 INFO L794 eck$LassoCheckResult]: Stem: 7178#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; 6974#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; 6975#L394 assume !(1 == ~c_req_up~0); 7146#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7130#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7131#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7197#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6946#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6947#L425-1 assume !(0 == ~e_f~0); 7113#L430-1 assume !(0 == ~e_g~0); 7114#L435-1 assume !(0 == ~e_e~0); 7189#L440-1 assume !(0 == ~e_c~0); 7190#L445-1 assume !(0 == ~e_wl~0); 7012#L450-1 assume !(1 == ~wl_pc~0); 7013#L462 assume !(2 == ~wl_pc~0); 6994#L463 assume !(1 == ~c1_pc~0); 7139#L473 assume !(1 == ~c2_pc~0); 7217#L482 assume !(1 == ~wb_pc~0); 7082#L491 assume !(1 == ~e_c~0); 7083#L500-1 assume !(1 == ~e_e~0); 7211#L505-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7093#L510-1 assume !(1 == ~e_g~0); 7094#L515-1 assume !(1 == ~e_c~0); 7180#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7181#L662-1 [2019-01-14 04:42:59,576 INFO L796 eck$LassoCheckResult]: Loop: 7181#L662-1 assume !false; 7910#L532 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; 7615#L367 assume !false; 7905#L285 assume !(0 == ~wl_st~0); 7906#L289 assume !(0 == ~c1_st~0); 7908#L292 assume !(0 == ~c2_st~0); 7903#L295 assume !(0 == ~wb_st~0); 7904#L298 assume !(0 == ~r_st~0); 7907#L383 start_simulation_~kernel_st~0 := 2; 7939#L538 assume !(1 == ~c_req_up~0); 7937#L538-2 start_simulation_~kernel_st~0 := 3; 7936#L550 assume !(0 == ~e_f~0); 7935#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7934#L555-1 assume !(0 == ~e_e~0); 7933#L560-1 assume !(0 == ~e_c~0); 7932#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 7931#L570-1 assume !(1 == ~wl_pc~0); 7928#L582 assume !(2 == ~wl_pc~0); 7927#L583 assume !(1 == ~c1_pc~0); 7925#L593 assume !(1 == ~c2_pc~0); 7923#L602 assume !(1 == ~wb_pc~0); 7921#L611 assume !(1 == ~e_c~0); 7920#L620-1 assume !(1 == ~e_e~0); 7919#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7780#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7918#L635-1 assume !(1 == ~e_c~0); 7916#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7915#L645-1 assume 0 == ~wl_st~0; 7181#L662-1 [2019-01-14 04:42:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash 255545495, now seen corresponding path program 1 times [2019-01-14 04:42:59,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:59,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:59,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:59,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:59,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:59,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:59,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:42:59,719 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2059595392, now seen corresponding path program 1 times [2019-01-14 04:42:59,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:59,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:59,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:59,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:59,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:59,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:59,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:42:59,769 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:59,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:42:59,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:42:59,770 INFO L87 Difference]: Start difference. First operand 1276 states and 2141 transitions. cyclomatic complexity: 880 Second operand 4 states. [2019-01-14 04:43:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:00,779 INFO L93 Difference]: Finished difference Result 1415 states and 2300 transitions. [2019-01-14 04:43:00,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:43:00,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1415 states and 2300 transitions. [2019-01-14 04:43:00,792 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 891 [2019-01-14 04:43:00,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1415 states to 1415 states and 2300 transitions. [2019-01-14 04:43:00,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 967 [2019-01-14 04:43:00,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 967 [2019-01-14 04:43:00,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1415 states and 2300 transitions. [2019-01-14 04:43:00,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:00,807 INFO L706 BuchiCegarLoop]: Abstraction has 1415 states and 2300 transitions. [2019-01-14 04:43:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states and 2300 transitions. [2019-01-14 04:43:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1385. [2019-01-14 04:43:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-01-14 04:43:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2270 transitions. [2019-01-14 04:43:00,841 INFO L729 BuchiCegarLoop]: Abstraction has 1385 states and 2270 transitions. [2019-01-14 04:43:00,841 INFO L609 BuchiCegarLoop]: Abstraction has 1385 states and 2270 transitions. [2019-01-14 04:43:00,842 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:43:00,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1385 states and 2270 transitions. [2019-01-14 04:43:00,851 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 887 [2019-01-14 04:43:00,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:00,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:00,852 INFO L867 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] [2019-01-14 04:43:00,852 INFO L868 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] [2019-01-14 04:43:00,852 INFO L794 eck$LassoCheckResult]: Stem: 9877#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; 9678#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; 9679#L394 assume !(1 == ~c_req_up~0); 9681#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9833#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9834#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9896#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9648#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9649#L425-1 assume !(0 == ~e_f~0); 9815#L430-1 assume !(0 == ~e_g~0); 9816#L435-1 assume !(0 == ~e_e~0); 9884#L440-1 assume !(0 == ~e_c~0); 9885#L445-1 assume !(0 == ~e_wl~0); 9715#L450-1 assume !(1 == ~wl_pc~0); 9716#L462 assume !(2 == ~wl_pc~0); 9692#L463 assume !(1 == ~c1_pc~0); 9840#L473 assume !(1 == ~c2_pc~0); 9919#L482 assume !(1 == ~wb_pc~0); 9785#L491 assume !(1 == ~e_c~0); 9786#L500-1 assume !(1 == ~e_e~0); 9911#L505-1 assume !(1 == ~e_f~0); 9796#L510-1 assume !(1 == ~e_g~0); 9797#L515-1 assume !(1 == ~e_c~0); 9843#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 9719#L662-1 [2019-01-14 04:43:00,853 INFO L796 eck$LassoCheckResult]: Loop: 9719#L662-1 assume !false; 9724#L532 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; 9791#L367 assume !false; 9656#L285 assume !(0 == ~wl_st~0); 9658#L289 assume !(0 == ~c1_st~0); 9865#L292 assume !(0 == ~c2_st~0); 9817#L295 assume !(0 == ~wb_st~0); 9818#L298 assume !(0 == ~r_st~0); 9835#L383 start_simulation_~kernel_st~0 := 2; 9763#L538 assume !(1 == ~c_req_up~0); 9707#L538-2 start_simulation_~kernel_st~0 := 3; 9708#L550 assume !(0 == ~e_f~0); 9900#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 10712#L555-1 assume !(0 == ~e_e~0); 10713#L560-1 assume !(0 == ~e_c~0); 10705#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10706#L570-1 assume !(1 == ~wl_pc~0); 11014#L582 assume !(2 == ~wl_pc~0); 10692#L583 assume !(1 == ~c1_pc~0); 10691#L593 assume !(1 == ~c2_pc~0); 10686#L602 assume !(1 == ~wb_pc~0); 10684#L611 assume !(1 == ~e_c~0); 10683#L620-1 assume !(1 == ~e_e~0); 10682#L625-1 assume !(1 == ~e_f~0); 10681#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10679#L635-1 assume !(1 == ~e_c~0); 10680#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 9777#L645-1 assume 0 == ~wl_st~0; 9719#L662-1 [2019-01-14 04:43:00,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:00,853 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2019-01-14 04:43:00,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:00,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:00,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:00,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:00,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:00,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:00,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:43:00,932 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:43:00,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:00,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2057748350, now seen corresponding path program 1 times [2019-01-14 04:43:00,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:00,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:00,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:00,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:00,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:00,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:43:00,990 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:00,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:00,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:00,990 INFO L87 Difference]: Start difference. First operand 1385 states and 2270 transitions. cyclomatic complexity: 900 Second operand 3 states. [2019-01-14 04:43:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:01,101 INFO L93 Difference]: Finished difference Result 2200 states and 3552 transitions. [2019-01-14 04:43:01,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:01,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2200 states and 3552 transitions. [2019-01-14 04:43:01,116 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1264 [2019-01-14 04:43:01,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2200 states to 2200 states and 3552 transitions. [2019-01-14 04:43:01,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1324 [2019-01-14 04:43:01,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1324 [2019-01-14 04:43:01,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2200 states and 3552 transitions. [2019-01-14 04:43:01,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:01,138 INFO L706 BuchiCegarLoop]: Abstraction has 2200 states and 3552 transitions. [2019-01-14 04:43:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states and 3552 transitions. [2019-01-14 04:43:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2188. [2019-01-14 04:43:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2188 states. [2019-01-14 04:43:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 3540 transitions. [2019-01-14 04:43:01,187 INFO L729 BuchiCegarLoop]: Abstraction has 2188 states and 3540 transitions. [2019-01-14 04:43:01,187 INFO L609 BuchiCegarLoop]: Abstraction has 2188 states and 3540 transitions. [2019-01-14 04:43:01,187 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:43:01,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2188 states and 3540 transitions. [2019-01-14 04:43:01,200 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1257 [2019-01-14 04:43:01,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:01,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:01,201 INFO L867 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] [2019-01-14 04:43:01,201 INFO L868 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] [2019-01-14 04:43:01,202 INFO L794 eck$LassoCheckResult]: Stem: 13464#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; 13268#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; 13269#L394 assume !(1 == ~c_req_up~0); 13436#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 13418#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 13419#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 13483#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 13240#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 13241#L425-1 assume !(0 == ~e_f~0); 13400#L430-1 assume !(0 == ~e_g~0); 13401#L435-1 assume !(0 == ~e_e~0); 13475#L440-1 assume !(0 == ~e_c~0); 13476#L445-1 assume !(0 == ~e_wl~0); 13511#L450-1 assume !(1 == ~wl_pc~0); 13472#L462 assume !(2 == ~wl_pc~0); 13287#L463 assume !(1 == ~c1_pc~0); 13426#L473 assume !(1 == ~c2_pc~0); 13505#L482 assume !(1 == ~wb_pc~0); 13374#L491 assume !(1 == ~e_c~0); 13375#L500-1 assume !(1 == ~e_e~0); 13503#L505-1 assume !(1 == ~e_f~0); 13382#L510-1 assume !(1 == ~e_g~0); 13383#L515-1 assume !(1 == ~e_c~0); 13433#L520-1 assume !(1 == ~e_wl~0); 13586#L662-1 assume !false; 13587#L532 [2019-01-14 04:43:01,202 INFO L796 eck$LassoCheckResult]: Loop: 13587#L532 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; 14882#L367 assume !false; 14715#L285 assume !(0 == ~wl_st~0); 14712#L289 assume !(0 == ~c1_st~0); 14709#L292 assume !(0 == ~c2_st~0); 14706#L295 assume !(0 == ~wb_st~0); 14700#L298 assume !(0 == ~r_st~0); 14702#L383 start_simulation_~kernel_st~0 := 2; 14688#L538 assume !(1 == ~c_req_up~0); 14689#L538-2 start_simulation_~kernel_st~0 := 3; 14972#L550 assume !(0 == ~e_f~0); 14971#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 14970#L555-1 assume !(0 == ~e_e~0); 14969#L560-1 assume !(0 == ~e_c~0); 14968#L565-1 assume !(0 == ~e_wl~0); 14967#L570-1 assume !(1 == ~wl_pc~0); 14964#L582 assume !(2 == ~wl_pc~0); 14963#L583 assume !(1 == ~c1_pc~0); 14961#L593 assume !(1 == ~c2_pc~0); 14959#L602 assume !(1 == ~wb_pc~0); 14957#L611 assume !(1 == ~e_c~0); 14956#L620-1 assume !(1 == ~e_e~0); 14955#L625-1 assume !(1 == ~e_f~0); 14951#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 14945#L635-1 assume !(1 == ~e_c~0); 14942#L640-1 assume !(1 == ~e_wl~0); 14770#L645-1 assume 0 == ~wl_st~0; 14885#L662-1 assume !false; 13587#L532 [2019-01-14 04:43:01,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:01,202 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2019-01-14 04:43:01,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:01,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:01,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:01,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:01,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:01,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:01,229 INFO L82 PathProgramCache]: Analyzing trace with hash 793828832, now seen corresponding path program 1 times [2019-01-14 04:43:01,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:01,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:01,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:01,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:01,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:01,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:01,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:01,298 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:01,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:01,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:01,299 INFO L87 Difference]: Start difference. First operand 2188 states and 3540 transitions. cyclomatic complexity: 1364 Second operand 3 states. [2019-01-14 04:43:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:01,414 INFO L93 Difference]: Finished difference Result 3269 states and 5252 transitions. [2019-01-14 04:43:01,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:01,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3269 states and 5252 transitions. [2019-01-14 04:43:01,434 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1877 [2019-01-14 04:43:01,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3269 states to 3269 states and 5252 transitions. [2019-01-14 04:43:01,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1948 [2019-01-14 04:43:01,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1948 [2019-01-14 04:43:01,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3269 states and 5252 transitions. [2019-01-14 04:43:01,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:01,467 INFO L706 BuchiCegarLoop]: Abstraction has 3269 states and 5252 transitions. [2019-01-14 04:43:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states and 5252 transitions. [2019-01-14 04:43:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3190. [2019-01-14 04:43:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2019-01-14 04:43:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 5137 transitions. [2019-01-14 04:43:01,542 INFO L729 BuchiCegarLoop]: Abstraction has 3190 states and 5137 transitions. [2019-01-14 04:43:01,542 INFO L609 BuchiCegarLoop]: Abstraction has 3190 states and 5137 transitions. [2019-01-14 04:43:01,542 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 04:43:01,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3190 states and 5137 transitions. [2019-01-14 04:43:01,557 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1871 [2019-01-14 04:43:01,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:01,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:01,559 INFO L867 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] [2019-01-14 04:43:01,559 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:01,560 INFO L794 eck$LassoCheckResult]: Stem: 18937#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; 18729#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; 18730#L394 assume !(1 == ~c_req_up~0); 18899#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 18881#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 18882#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 18958#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 18703#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 18704#L425-1 assume !(0 == ~e_f~0); 18865#L430-1 assume !(0 == ~e_g~0); 18866#L435-1 assume !(0 == ~e_e~0); 18947#L440-1 assume !(0 == ~e_c~0); 18948#L445-1 assume !(0 == ~e_wl~0); 18996#L450-1 assume !(1 == ~wl_pc~0); 18945#L462 assume !(2 == ~wl_pc~0); 18749#L463 assume !(1 == ~c1_pc~0); 18891#L473 assume !(1 == ~c2_pc~0); 18990#L482 assume !(1 == ~wb_pc~0); 18837#L491 assume !(1 == ~e_c~0); 18838#L500-1 assume !(1 == ~e_e~0); 18988#L505-1 assume !(1 == ~e_f~0); 18846#L510-1 assume !(1 == ~e_g~0); 18847#L515-1 assume !(1 == ~e_c~0); 18896#L520-1 assume !(1 == ~e_wl~0); 19113#L662-1 assume !false; 19114#L532 [2019-01-14 04:43:01,561 INFO L796 eck$LassoCheckResult]: Loop: 19114#L532 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; 21096#L367 assume !false; 21094#L285 assume 0 == ~wl_st~0; 21092#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 21090#L311 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 21025#L56 assume 0 == ~wl_pc~0; 21024#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 20906#L307 assume !(0 == ~c1_st~0); 20970#L322 assume !(0 == ~c2_st~0); 20956#L337 assume !(0 == ~wb_st~0); 20724#L352 assume !(0 == ~r_st~0); 20721#L367 assume !false; 20704#L285 assume !(0 == ~wl_st~0); 20705#L289 assume !(0 == ~c1_st~0); 20658#L292 assume !(0 == ~c2_st~0); 20659#L295 assume !(0 == ~wb_st~0); 20640#L298 assume !(0 == ~r_st~0); 20642#L383 start_simulation_~kernel_st~0 := 2; 20629#L538 assume !(1 == ~c_req_up~0); 20630#L538-2 start_simulation_~kernel_st~0 := 3; 20944#L550 assume !(0 == ~e_f~0); 20942#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 20940#L555-1 assume !(0 == ~e_e~0); 20938#L560-1 assume !(0 == ~e_c~0); 20936#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 20934#L570-1 assume 1 == ~wl_pc~0; 20931#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 20928#L583 assume !(1 == ~c1_pc~0); 20924#L593 assume !(1 == ~c2_pc~0); 20920#L602 assume !(1 == ~wb_pc~0); 20916#L611 assume !(1 == ~e_c~0); 20908#L620-1 assume !(1 == ~e_e~0); 20767#L625-1 assume !(1 == ~e_f~0); 20763#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 20760#L635-1 assume !(1 == ~e_c~0); 20753#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 20754#L645-1 assume 0 == ~wl_st~0; 21099#L662-1 assume !false; 19114#L532 [2019-01-14 04:43:01,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2019-01-14 04:43:01,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:01,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:01,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:01,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:01,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:01,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:01,589 INFO L82 PathProgramCache]: Analyzing trace with hash 828679061, now seen corresponding path program 1 times [2019-01-14 04:43:01,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:01,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:01,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:01,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:43:01,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:01,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1088220784, now seen corresponding path program 1 times [2019-01-14 04:43:01,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:01,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:01,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:01,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:01,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:02,050 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-01-14 04:43:02,127 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:43:02,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:43:02,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:43:02,128 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:43:02,128 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:43:02,128 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:43:02,128 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:43:02,128 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:43:02,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration12_Loop [2019-01-14 04:43:02,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:43:02,129 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:43:02,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,719 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:43:02,720 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:43:02,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:43:02,727 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:43:02,731 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:43:02,731 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:43:02,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:43:02,756 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:43:02,759 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:43:02,759 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:43:02,784 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:43:02,784 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:43:02,788 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:43:02,788 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:43:02,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:43:02,813 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:43:02,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:43:02,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:43:02,847 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:43:02,867 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:43:02,867 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:43:02,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:43:02,868 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:43:02,868 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:43:02,868 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:43:02,868 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:43:02,868 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:43:02,869 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration12_Loop [2019-01-14 04:43:02,869 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:43:02,869 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:43:02,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:02,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:03,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:03,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:03,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:03,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:03,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:03,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:03,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:03,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:03,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:03,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:43:03,466 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:43:03,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:43:03,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:43:03,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:43:03,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:43:03,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:43:03,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:43:03,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:43:03,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:43:03,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:43:03,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:43:03,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:43:03,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:43:03,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:43:03,477 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:43:03,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:43:03,482 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:43:03,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:43:03,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:43:03,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:43:03,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:43:03,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:43:03,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:43:03,485 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:43:03,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:43:03,490 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:43:03,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:43:03,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:43:03,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:43:03,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:43:03,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:43:03,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:43:03,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:43:03,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:43:03,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:43:03,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:43:03,499 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:43:03,504 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:43:03,504 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:43:03,506 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:43:03,506 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:43:03,507 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:43:03,507 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2019-01-14 04:43:03,507 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:43:03,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:03,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:43:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:03,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:43:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:03,801 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 [2019-01-14 04:43:03,801 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3190 states and 5137 transitions. cyclomatic complexity: 1965 Second operand 5 states. [2019-01-14 04:43:04,259 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3190 states and 5137 transitions. cyclomatic complexity: 1965. Second operand 5 states. Result 8418 states and 13557 transitions. Complement of second has 7 states. [2019-01-14 04:43:04,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:43:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:43:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2019-01-14 04:43:04,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 25 letters. Loop has 38 letters. [2019-01-14 04:43:04,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:43:04,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 63 letters. Loop has 38 letters. [2019-01-14 04:43:04,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:43:04,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 25 letters. Loop has 76 letters. [2019-01-14 04:43:04,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:43:04,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8418 states and 13557 transitions. [2019-01-14 04:43:04,332 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 3355 [2019-01-14 04:43:04,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8418 states to 8248 states and 13287 transitions. [2019-01-14 04:43:04,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3562 [2019-01-14 04:43:04,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3576 [2019-01-14 04:43:04,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8248 states and 13287 transitions. [2019-01-14 04:43:04,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:04,432 INFO L706 BuchiCegarLoop]: Abstraction has 8248 states and 13287 transitions. [2019-01-14 04:43:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8248 states and 13287 transitions. [2019-01-14 04:43:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8248 to 8064. [2019-01-14 04:43:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8064 states. [2019-01-14 04:43:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8064 states to 8064 states and 13001 transitions. [2019-01-14 04:43:04,615 INFO L729 BuchiCegarLoop]: Abstraction has 8064 states and 13001 transitions. [2019-01-14 04:43:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:04,616 INFO L87 Difference]: Start difference. First operand 8064 states and 13001 transitions. Second operand 3 states. [2019-01-14 04:43:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:04,871 INFO L93 Difference]: Finished difference Result 12318 states and 19757 transitions. [2019-01-14 04:43:04,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:04,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12318 states and 19757 transitions. [2019-01-14 04:43:04,933 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 5136 [2019-01-14 04:43:05,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12318 states to 12318 states and 19757 transitions. [2019-01-14 04:43:05,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5280 [2019-01-14 04:43:05,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5280 [2019-01-14 04:43:05,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12318 states and 19757 transitions. [2019-01-14 04:43:05,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:05,050 INFO L706 BuchiCegarLoop]: Abstraction has 12318 states and 19757 transitions. [2019-01-14 04:43:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12318 states and 19757 transitions. [2019-01-14 04:43:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12318 to 12318. [2019-01-14 04:43:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12318 states. [2019-01-14 04:43:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12318 states to 12318 states and 19757 transitions. [2019-01-14 04:43:05,293 INFO L729 BuchiCegarLoop]: Abstraction has 12318 states and 19757 transitions. [2019-01-14 04:43:05,293 INFO L609 BuchiCegarLoop]: Abstraction has 12318 states and 19757 transitions. [2019-01-14 04:43:05,293 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 04:43:05,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12318 states and 19757 transitions. [2019-01-14 04:43:05,337 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 5136 [2019-01-14 04:43:05,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:05,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:05,338 INFO L867 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] [2019-01-14 04:43:05,338 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:05,338 INFO L794 eck$LassoCheckResult]: Stem: 51148#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; 50935#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; 50936#L394 assume !(1 == ~c_req_up~0); 50938#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 51101#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 51132#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 51133#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 51201#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 50987#L425-1 assume !(0 == ~e_f~0); 50988#L430-1 assume !(0 == ~e_g~0); 51121#L435-1 assume !(0 == ~e_e~0); 51122#L440-1 assume !(0 == ~e_c~0); 51200#L445-1 assume !(0 == ~e_wl~0); 51199#L450-1 assume !(1 == ~wl_pc~0); 51156#L462 assume !(2 == ~wl_pc~0); 50946#L463 assume !(1 == ~c1_pc~0); 51105#L473 assume !(1 == ~c2_pc~0); 51193#L482 assume !(1 == ~wb_pc~0); 51045#L491 assume !(1 == ~e_c~0); 51046#L500-1 assume !(1 == ~e_e~0); 51183#L505-1 assume !(1 == ~e_f~0); 51053#L510-1 assume !(1 == ~e_g~0); 51054#L515-1 assume !(1 == ~e_c~0); 51111#L520-1 assume !(1 == ~e_wl~0); 52954#L662-1 assume !false; 52952#L532 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; 52953#L367 [2019-01-14 04:43:05,338 INFO L796 eck$LassoCheckResult]: Loop: 52953#L367 assume !false; 57733#L285 assume 0 == ~wl_st~0; 56476#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 51208#L311 assume !(0 != eval_~tmp~0); 51209#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 56471#L326 assume !(0 != eval_~tmp___0~0); 56472#L322 assume !(0 == ~c2_st~0); 57737#L337 assume !(0 == ~wb_st~0); 57736#L352 assume !(0 == ~r_st~0); 52953#L367 [2019-01-14 04:43:05,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:05,338 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2019-01-14 04:43:05,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:05,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:05,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:05,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:05,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:05,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash 850890528, now seen corresponding path program 1 times [2019-01-14 04:43:05,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:05,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:05,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:05,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:05,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:05,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:05,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1866895320, now seen corresponding path program 1 times [2019-01-14 04:43:05,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:05,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:05,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:05,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:05,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:05,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:05,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:05,690 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 04:43:05,929 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 04:43:05,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:05,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:05,946 INFO L87 Difference]: Start difference. First operand 12318 states and 19757 transitions. cyclomatic complexity: 7495 Second operand 3 states. [2019-01-14 04:43:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:06,241 INFO L93 Difference]: Finished difference Result 19296 states and 30676 transitions. [2019-01-14 04:43:06,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:06,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19296 states and 30676 transitions. [2019-01-14 04:43:06,357 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-01-14 04:43:06,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19296 states to 19296 states and 30676 transitions. [2019-01-14 04:43:06,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8284 [2019-01-14 04:43:06,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8284 [2019-01-14 04:43:06,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19296 states and 30676 transitions. [2019-01-14 04:43:06,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:06,481 INFO L706 BuchiCegarLoop]: Abstraction has 19296 states and 30676 transitions. [2019-01-14 04:43:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19296 states and 30676 transitions. [2019-01-14 04:43:06,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19296 to 19296. [2019-01-14 04:43:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19296 states. [2019-01-14 04:43:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19296 states to 19296 states and 30676 transitions. [2019-01-14 04:43:07,007 INFO L729 BuchiCegarLoop]: Abstraction has 19296 states and 30676 transitions. [2019-01-14 04:43:07,007 INFO L609 BuchiCegarLoop]: Abstraction has 19296 states and 30676 transitions. [2019-01-14 04:43:07,007 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 04:43:07,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19296 states and 30676 transitions. [2019-01-14 04:43:07,072 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-01-14 04:43:07,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:07,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:07,073 INFO L867 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] [2019-01-14 04:43:07,073 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:07,074 INFO L794 eck$LassoCheckResult]: Stem: 82778#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; 82559#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; 82560#L394 assume !(1 == ~c_req_up~0); 82723#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 82724#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 82764#L410-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 82765#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 82852#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 82618#L425-1 assume !(0 == ~e_f~0); 82619#L430-1 assume !(0 == ~e_g~0); 82749#L435-1 assume !(0 == ~e_e~0); 82750#L440-1 assume !(0 == ~e_c~0); 82818#L445-1 assume !(0 == ~e_wl~0); 82595#L450-1 assume !(1 == ~wl_pc~0); 82596#L462 assume !(2 == ~wl_pc~0); 82839#L463 assume !(1 == ~c1_pc~0); 82838#L473 assume !(1 == ~c2_pc~0); 82734#L482 assume !(1 == ~wb_pc~0); 82735#L491 assume !(1 == ~e_c~0); 82827#L500-1 assume !(1 == ~e_e~0); 82828#L505-1 assume !(1 == ~e_f~0); 82679#L510-1 assume !(1 == ~e_g~0); 82680#L515-1 assume !(1 == ~e_c~0); 82782#L520-1 assume !(1 == ~e_wl~0); 82783#L662-1 assume !false; 85002#L532 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; 91209#L367 [2019-01-14 04:43:07,077 INFO L796 eck$LassoCheckResult]: Loop: 91209#L367 assume !false; 91201#L285 assume 0 == ~wl_st~0; 91190#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 91180#L311 assume !(0 != eval_~tmp~0); 91181#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91280#L326 assume !(0 != eval_~tmp___0~0); 91277#L322 assume !(0 == ~c2_st~0); 91227#L337 assume !(0 == ~wb_st~0); 91223#L352 assume !(0 == ~r_st~0); 91209#L367 [2019-01-14 04:43:07,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2019-01-14 04:43:07,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:07,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:07,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:07,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:07,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:07,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:07,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:07,146 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:43:07,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash 850890528, now seen corresponding path program 2 times [2019-01-14 04:43:07,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:07,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:07,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:07,387 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 04:43:07,634 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 04:43:07,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:07,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:07,654 INFO L87 Difference]: Start difference. First operand 19296 states and 30676 transitions. cyclomatic complexity: 11436 Second operand 3 states. [2019-01-14 04:43:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:07,744 INFO L93 Difference]: Finished difference Result 19244 states and 30595 transitions. [2019-01-14 04:43:07,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:07,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19244 states and 30595 transitions. [2019-01-14 04:43:07,841 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-01-14 04:43:07,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19244 states to 19244 states and 30595 transitions. [2019-01-14 04:43:07,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8234 [2019-01-14 04:43:07,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8234 [2019-01-14 04:43:07,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19244 states and 30595 transitions. [2019-01-14 04:43:07,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:07,944 INFO L706 BuchiCegarLoop]: Abstraction has 19244 states and 30595 transitions. [2019-01-14 04:43:07,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19244 states and 30595 transitions. [2019-01-14 04:43:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19244 to 19244. [2019-01-14 04:43:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19244 states. [2019-01-14 04:43:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19244 states to 19244 states and 30595 transitions. [2019-01-14 04:43:08,185 INFO L729 BuchiCegarLoop]: Abstraction has 19244 states and 30595 transitions. [2019-01-14 04:43:08,185 INFO L609 BuchiCegarLoop]: Abstraction has 19244 states and 30595 transitions. [2019-01-14 04:43:08,185 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 04:43:08,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19244 states and 30595 transitions. [2019-01-14 04:43:08,241 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-01-14 04:43:08,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:08,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:08,242 INFO L867 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] [2019-01-14 04:43:08,242 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:08,242 INFO L794 eck$LassoCheckResult]: Stem: 121318#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; 121105#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; 121106#L394 assume !(1 == ~c_req_up~0); 121108#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 121271#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 121307#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 121308#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 121369#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 121158#L425-1 assume !(0 == ~e_f~0); 121159#L430-1 assume !(0 == ~e_g~0); 121289#L435-1 assume !(0 == ~e_e~0); 121290#L440-1 assume !(0 == ~e_c~0); 121368#L445-1 assume !(0 == ~e_wl~0); 121367#L450-1 assume !(1 == ~wl_pc~0); 121326#L462 assume !(2 == ~wl_pc~0); 121116#L463 assume !(1 == ~c1_pc~0); 121275#L473 assume !(1 == ~c2_pc~0); 121361#L482 assume !(1 == ~wb_pc~0); 121214#L491 assume !(1 == ~e_c~0); 121215#L500-1 assume !(1 == ~e_e~0); 121351#L505-1 assume !(1 == ~e_f~0); 121224#L510-1 assume !(1 == ~e_g~0); 121225#L515-1 assume !(1 == ~e_c~0); 121279#L520-1 assume !(1 == ~e_wl~0); 121319#L662-1 assume !false; 122901#L532 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; 129788#L367 [2019-01-14 04:43:08,242 INFO L796 eck$LassoCheckResult]: Loop: 129788#L367 assume !false; 129783#L285 assume 0 == ~wl_st~0; 129780#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 129776#L311 assume !(0 != eval_~tmp~0); 129777#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 129594#L326 assume !(0 != eval_~tmp___0~0); 129826#L322 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 129804#L341 assume !(0 != eval_~tmp___1~0); 129799#L337 assume !(0 == ~wb_st~0); 129796#L352 assume !(0 == ~r_st~0); 129788#L367 [2019-01-14 04:43:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:08,242 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2019-01-14 04:43:08,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:08,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:08,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:08,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:43:08,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:08,265 INFO L82 PathProgramCache]: Analyzing trace with hash 606182616, now seen corresponding path program 1 times [2019-01-14 04:43:08,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:08,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:08,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:08,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:43:08,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2040800048, now seen corresponding path program 1 times [2019-01-14 04:43:08,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:08,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:08,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:08,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:08,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:08,458 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 04:43:08,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:08,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:08,502 INFO L87 Difference]: Start difference. First operand 19244 states and 30595 transitions. cyclomatic complexity: 11407 Second operand 3 states. [2019-01-14 04:43:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:08,612 INFO L93 Difference]: Finished difference Result 33096 states and 52188 transitions. [2019-01-14 04:43:08,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:08,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33096 states and 52188 transitions. [2019-01-14 04:43:08,708 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 13770 [2019-01-14 04:43:08,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33096 states to 33096 states and 52188 transitions. [2019-01-14 04:43:08,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14128 [2019-01-14 04:43:08,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14128 [2019-01-14 04:43:08,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33096 states and 52188 transitions. [2019-01-14 04:43:08,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:08,851 INFO L706 BuchiCegarLoop]: Abstraction has 33096 states and 52188 transitions. [2019-01-14 04:43:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33096 states and 52188 transitions. [2019-01-14 04:43:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33096 to 33096. [2019-01-14 04:43:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33096 states. [2019-01-14 04:43:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33096 states to 33096 states and 52188 transitions. [2019-01-14 04:43:09,698 INFO L729 BuchiCegarLoop]: Abstraction has 33096 states and 52188 transitions. [2019-01-14 04:43:09,698 INFO L609 BuchiCegarLoop]: Abstraction has 33096 states and 52188 transitions. [2019-01-14 04:43:09,698 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-14 04:43:09,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33096 states and 52188 transitions. [2019-01-14 04:43:09,793 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 13770 [2019-01-14 04:43:09,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:09,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:09,796 INFO L867 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] [2019-01-14 04:43:09,796 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:09,796 INFO L794 eck$LassoCheckResult]: Stem: 173685#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; 173452#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; 173453#L394 assume !(1 == ~c_req_up~0); 173455#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 173631#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 173669#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 173670#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 173742#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 173507#L425-1 assume !(0 == ~e_f~0); 173508#L430-1 assume !(0 == ~e_g~0); 173651#L435-1 assume !(0 == ~e_e~0); 173652#L440-1 assume !(0 == ~e_c~0); 173741#L445-1 assume !(0 == ~e_wl~0); 173740#L450-1 assume !(1 == ~wl_pc~0); 173694#L462 assume !(2 == ~wl_pc~0); 173463#L463 assume !(1 == ~c1_pc~0); 173635#L473 assume !(1 == ~c2_pc~0); 173734#L482 assume !(1 == ~wb_pc~0); 173569#L491 assume !(1 == ~e_c~0); 173570#L500-1 assume !(1 == ~e_e~0); 173725#L505-1 assume !(1 == ~e_f~0); 173580#L510-1 assume !(1 == ~e_g~0); 173581#L515-1 assume !(1 == ~e_c~0); 173640#L520-1 assume !(1 == ~e_wl~0); 173686#L662-1 assume !false; 180618#L532 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; 180620#L367 [2019-01-14 04:43:09,797 INFO L796 eck$LassoCheckResult]: Loop: 180620#L367 assume !false; 180973#L285 assume 0 == ~wl_st~0; 180971#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 180970#L311 assume !(0 != eval_~tmp~0); 180969#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 180958#L326 assume !(0 != eval_~tmp___0~0); 180968#L322 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 180864#L341 assume !(0 != eval_~tmp___1~0); 180627#L337 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 180623#L356 assume !(0 != eval_~tmp___2~0); 180625#L352 assume !(0 == ~r_st~0); 180620#L367 [2019-01-14 04:43:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2019-01-14 04:43:09,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:09,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:09,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:09,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1611757493, now seen corresponding path program 1 times [2019-01-14 04:43:09,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:09,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:09,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:09,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:43:09,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:09,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1159673533, now seen corresponding path program 1 times [2019-01-14 04:43:09,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:09,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:09,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:09,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:09,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:10,034 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:43:10,707 WARN L181 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2019-01-14 04:43:10,938 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-01-14 04:43:10,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:43:10 BoogieIcfgContainer [2019-01-14 04:43:10,971 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:43:10,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:43:10,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:43:10,971 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:43:10,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:42:53" (3/4) ... [2019-01-14 04:43:10,978 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:43:11,051 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:43:11,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:43:11,052 INFO L168 Benchmark]: Toolchain (without parser) took 19918.27 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 450.4 MB). Free memory was 952.7 MB in the beginning and 994.5 MB in the end (delta: -41.8 MB). Peak memory consumption was 408.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:11,054 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:43:11,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 488.70 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:11,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 152.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -215.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:11,058 INFO L168 Benchmark]: Boogie Preprocessor took 60.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:11,058 INFO L168 Benchmark]: RCFGBuilder took 1184.09 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.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:11,060 INFO L168 Benchmark]: BuchiAutomizer took 17946.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.5 MB). Free memory was 1.1 GB in the beginning and 994.5 MB in the end (delta: 112.2 MB). Peak memory consumption was 403.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:11,061 INFO L168 Benchmark]: Witness Printer took 80.49 ms. Allocated memory is still 1.5 GB. Free memory is still 994.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:43:11,066 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 488.70 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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 152.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -215.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1184.09 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.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17946.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.5 MB). Free memory was 1.1 GB in the beginning and 994.5 MB in the end (delta: 112.2 MB). Peak memory consumption was 403.7 MB. Max. memory is 11.5 GB. * Witness Printer took 80.49 ms. Allocated memory is still 1.5 GB. Free memory is still 994.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (15 trivial, 2 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 -2 * wl_pc + 1 and consists of 4 locations. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 33096 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.8s and 16 iterations. TraceHistogramMax:2. Analysis of lassos took 8.7s. Construction of modules took 3.1s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 2.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 471 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 1.1s Buchi closure took 0.0s. Biggest automaton had 33096 states and ocurred in iteration 15. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 4076 SDtfs, 3647 SDslu, 2145 SDs, 0 SdLazy, 375 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc2 concLT1 SILN1 SILU0 SILI8 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital84 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq179 hnf100 smp100 dnf211 smp50 tf111 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 284]: 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@6510514f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29f3c1a8=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d280512=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ae17367=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b437d0f=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: 284]: 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 ; [L679] int __retres1 ; [L683] e_wl = 2 [L684] e_c = e_wl [L685] e_g = e_c [L686] e_f = e_g [L687] e_e = e_f [L688] wl_pc = 0 [L689] c1_pc = 0 [L690] c2_pc = 0 [L691] wb_pc = 0 [L692] wb_i = 1 [L693] c2_i = wb_i [L694] c1_i = c2_i [L695] wl_i = c1_i [L696] r_i = 0 [L697] c_req_up = 0 [L698] d = 0 [L699] c = 0 [L390] int kernel_st ; [L393] kernel_st = 0 [L394] COND FALSE !((int )c_req_up == 1) [L405] COND TRUE (int )wl_i == 1 [L406] wl_st = 0 [L410] COND TRUE (int )c1_i == 1 [L411] c1_st = 0 [L415] COND TRUE (int )c2_i == 1 [L416] c2_st = 0 [L420] COND TRUE (int )wb_i == 1 [L421] wb_st = 0 [L425] COND FALSE !((int )r_i == 1) [L428] r_st = 2 [L430] COND FALSE !((int )e_f == 0) [L435] COND FALSE !((int )e_g == 0) [L440] COND FALSE !((int )e_e == 0) [L445] COND FALSE !((int )e_c == 0) [L450] COND FALSE !((int )e_wl == 0) [L455] COND FALSE !((int )wl_pc == 1) [L463] COND FALSE !((int )wl_pc == 2) [L473] COND FALSE !((int )c1_pc == 1) [L482] COND FALSE !((int )c2_pc == 1) [L491] COND FALSE !((int )wb_pc == 1) [L500] COND FALSE !((int )e_c == 1) [L505] COND FALSE !((int )e_e == 1) [L510] COND FALSE !((int )e_f == 1) [L515] COND FALSE !((int )e_g == 1) [L520] COND FALSE !((int )e_c == 1) [L525] COND FALSE !((int )e_wl == 1) [L531] COND TRUE 1 [L534] kernel_st = 1 [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; Loop: [L284] COND TRUE 1 [L286] COND TRUE (int )wl_st == 0 [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND FALSE !(\read(tmp)) [L322] COND TRUE (int )c1_st == 0 [L324] tmp___0 = __VERIFIER_nondet_int() [L326] COND FALSE !(\read(tmp___0)) [L337] COND TRUE (int )c2_st == 0 [L339] tmp___1 = __VERIFIER_nondet_int() [L341] COND FALSE !(\read(tmp___1)) [L352] COND TRUE (int )wb_st == 0 [L354] tmp___2 = __VERIFIER_nondet_int() [L356] COND FALSE !(\read(tmp___2)) [L367] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...