./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/bist_cell_true-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/bist_cell_true-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 bb52621d262b2a79ebd79f9601fb8103d2f4f11e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:36:28,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:36:28,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:36:28,362 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:36:28,363 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:36:28,364 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:36:28,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:36:28,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:36:28,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:36:28,371 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:36:28,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:36:28,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:36:28,374 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:36:28,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:36:28,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:36:28,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:36:28,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:36:28,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:36:28,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:36:28,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:36:28,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:36:28,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:36:28,393 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:36:28,393 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:36:28,393 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:36:28,395 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:36:28,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:36:28,397 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:36:28,399 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:36:28,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:36:28,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:36:28,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:36:28,402 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:36:28,403 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:36:28,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:36:28,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:36:28,406 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:36:28,442 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:36:28,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:36:28,447 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:36:28,448 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:36:28,448 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:36:28,449 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:36:28,449 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:36:28,449 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:36:28,449 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:36:28,449 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:36:28,450 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:36:28,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:36:28,450 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:36:28,450 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:36:28,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:36:28,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:36:28,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:36:28,454 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:36:28,454 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:36:28,454 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:36:28,454 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:36:28,454 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:36:28,454 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:36:28,455 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:36:28,455 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:36:28,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:36:28,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:36:28,455 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:36:28,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:36:28,458 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:36:28,458 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:36:28,460 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:36:28,461 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 -> bb52621d262b2a79ebd79f9601fb8103d2f4f11e [2019-01-14 04:36:28,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:36:28,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:36:28,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:36:28,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:36:28,537 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:36:28,538 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2019-01-14 04:36:28,614 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b039eadc2/5a7e4daa7a1a4270914099e59065da51/FLAG061cfaa35 [2019-01-14 04:36:29,149 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:36:29,149 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2019-01-14 04:36:29,162 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b039eadc2/5a7e4daa7a1a4270914099e59065da51/FLAG061cfaa35 [2019-01-14 04:36:29,475 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b039eadc2/5a7e4daa7a1a4270914099e59065da51 [2019-01-14 04:36:29,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:36:29,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:36:29,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:36:29,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:36:29,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:36:29,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:36:29" (1/1) ... [2019-01-14 04:36:29,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b7e223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:29, skipping insertion in model container [2019-01-14 04:36:29,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:36:29" (1/1) ... [2019-01-14 04:36:29,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:36:29,562 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:36:29,857 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:36:29,873 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:36:29,972 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:36:30,012 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:36:30,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:30 WrapperNode [2019-01-14 04:36:30,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:36:30,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:36:30,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:36:30,015 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:36:30,026 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:36:30" (1/1) ... [2019-01-14 04:36:30,036 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:36:30" (1/1) ... [2019-01-14 04:36:30,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:36:30,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:36:30,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:36:30,101 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:36:30,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:30" (1/1) ... [2019-01-14 04:36:30,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:30" (1/1) ... [2019-01-14 04:36:30,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:30" (1/1) ... [2019-01-14 04:36:30,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:30" (1/1) ... [2019-01-14 04:36:30,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:30" (1/1) ... [2019-01-14 04:36:30,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:30" (1/1) ... [2019-01-14 04:36:30,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:30" (1/1) ... [2019-01-14 04:36:30,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:36:30,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:36:30,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:36:30,252 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:36:30,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:30" (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:36:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:36:30,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:36:31,368 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:36:31,368 INFO L286 CfgBuilder]: Removed 64 assue(true) statements. [2019-01-14 04:36:31,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:36:31 BoogieIcfgContainer [2019-01-14 04:36:31,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:36:31,370 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:36:31,370 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:36:31,374 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:36:31,375 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:36:31,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:36:29" (1/3) ... [2019-01-14 04:36:31,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c662089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:36:31, skipping insertion in model container [2019-01-14 04:36:31,379 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:36:31,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:30" (2/3) ... [2019-01-14 04:36:31,381 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c662089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:36:31, skipping insertion in model container [2019-01-14 04:36:31,381 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:36:31,381 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:36:31" (3/3) ... [2019-01-14 04:36:31,384 INFO L375 chiAutomizerObserver]: Analyzing ICFG bist_cell_true-unreach-call_false-termination.cil.c [2019-01-14 04:36:31,452 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:36:31,452 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:36:31,453 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:36:31,453 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:36:31,453 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:36:31,454 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:36:31,454 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:36:31,454 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:36:31,454 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:36:31,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2019-01-14 04:36:31,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:31,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:31,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:31,525 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:36:31,527 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, 1, 1, 1, 1, 1] [2019-01-14 04:36:31,527 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:36:31,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2019-01-14 04:36:31,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:31,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:31,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:31,545 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:36:31,545 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, 1, 1, 1, 1, 1] [2019-01-14 04:36:31,558 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRYtrue ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 12#L-1true havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 39#L480true havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 44#L202true assume !(1 == ~b0_req_up~0); 30#L202-1true assume !(1 == ~b1_req_up~0); 80#L209true assume !(1 == ~d0_req_up~0); 35#L216true assume !(1 == ~d1_req_up~0); 87#L223true assume !(1 == ~z_req_up~0); 4#L230true assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 70#L245-1true assume !(0 == ~b0_ev~0); 82#L311-1true assume !(0 == ~b1_ev~0); 97#L316-1true assume !(0 == ~d0_ev~0); 8#L321-1true assume !(0 == ~d1_ev~0); 36#L326-1true assume !(0 == ~z_ev~0); 55#L331-1true havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 60#L97true assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 61#L119true is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 20#L120true activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 73#L380true assume !(0 != activate_threads_~tmp~1); 77#L380-2true assume !(1 == ~b0_ev~0); 81#L344-1true assume !(1 == ~b1_ev~0); 96#L349-1true assume !(1 == ~d0_ev~0); 6#L354-1true assume !(1 == ~d1_ev~0); 34#L359-1true assume !(1 == ~z_ev~0); 49#L422-1true [2019-01-14 04:36:31,560 INFO L796 eck$LassoCheckResult]: Loop: 49#L422-1true assume !false; 105#L423true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 7#L285true assume false; 48#L301true start_simulation_~kernel_st~0 := 2; 29#L202-2true assume !(1 == ~b0_req_up~0); 28#L202-3true assume !(1 == ~b1_req_up~0); 78#L209-1true assume !(1 == ~d0_req_up~0); 33#L216-1true assume !(1 == ~d1_req_up~0); 68#L223-1true assume !(1 == ~z_req_up~0); 3#L230-1true start_simulation_~kernel_st~0 := 3; 84#L311-2true assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 72#L311-4true assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 93#L316-3true assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 102#L321-3true assume !(0 == ~d1_ev~0); 24#L326-3true assume 0 == ~z_ev~0;~z_ev~0 := 1; 47#L331-3true havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 58#L97-1true assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 59#L119-1true is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 18#L120-1true activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 63#L380-3true assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 66#L380-5true assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 85#L344-3true assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 98#L349-3true assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 11#L354-3true assume !(1 == ~d1_ev~0); 23#L359-3true assume 1 == ~z_ev~0;~z_ev~0 := 2; 45#L364-3true havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 104#L258-1true assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 38#L265-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 101#L266-1true stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 51#L397true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 95#L404true stop_simulation_#res := stop_simulation_~__retres2~0; 69#L405true start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 27#L439true assume !(0 != start_simulation_~tmp~3); 49#L422-1true [2019-01-14 04:36:31,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:31,576 INFO L82 PathProgramCache]: Analyzing trace with hash 201072121, now seen corresponding path program 1 times [2019-01-14 04:36:31,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:31,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:31,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:31,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:31,774 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:36:31,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:31,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:31,781 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:31,782 INFO L82 PathProgramCache]: Analyzing trace with hash -503786151, now seen corresponding path program 1 times [2019-01-14 04:36:31,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:31,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:31,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:31,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:31,796 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:36:31,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:31,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:36:31,798 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:31,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:31,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:31,820 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2019-01-14 04:36:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:31,876 INFO L93 Difference]: Finished difference Result 107 states and 173 transitions. [2019-01-14 04:36:31,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:31,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 173 transitions. [2019-01-14 04:36:31,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:31,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 101 states and 167 transitions. [2019-01-14 04:36:31,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-14 04:36:31,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-14 04:36:31,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 167 transitions. [2019-01-14 04:36:31,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:31,897 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2019-01-14 04:36:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 167 transitions. [2019-01-14 04:36:31,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 04:36:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 04:36:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 167 transitions. [2019-01-14 04:36:31,936 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2019-01-14 04:36:31,936 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2019-01-14 04:36:31,937 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:36:31,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 167 transitions. [2019-01-14 04:36:31,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:31,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:31,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:31,941 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:36:31,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:31,942 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 241#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 242#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 282#L202 assume 1 == ~b0_req_up~0; 286#L127 assume !(~b0_val~0 != ~b0_val_t~0); 294#L127-2 ~b0_req_up~0 := 0; 273#L202-1 assume !(1 == ~b1_req_up~0); 250#L209 assume !(1 == ~d0_req_up~0); 278#L216 assume !(1 == ~d1_req_up~0); 275#L223 assume !(1 == ~z_req_up~0); 225#L230 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 226#L245-1 assume !(0 == ~b0_ev~0); 309#L311-1 assume !(0 == ~b1_ev~0); 317#L316-1 assume !(0 == ~d0_ev~0); 233#L321-1 assume !(0 == ~d1_ev~0); 234#L326-1 assume !(0 == ~z_ev~0); 279#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 296#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 256#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 257#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 258#L380 assume !(0 != activate_threads_~tmp~1); 312#L380-2 assume !(1 == ~b0_ev~0); 313#L344-1 assume !(1 == ~b1_ev~0); 316#L349-1 assume !(1 == ~d0_ev~0); 229#L354-1 assume !(1 == ~d1_ev~0); 230#L359-1 assume !(1 == ~z_ev~0); 268#L422-1 [2019-01-14 04:36:31,943 INFO L796 eck$LassoCheckResult]: Loop: 268#L422-1 assume !false; 290#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 231#L285 assume !false; 232#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 285#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 283#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 243#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 244#L280 assume !(0 != eval_~tmp___0~0); 289#L301 start_simulation_~kernel_st~0 := 2; 271#L202-2 assume !(1 == ~b0_req_up~0); 269#L202-3 assume !(1 == ~b1_req_up~0); 270#L209-1 assume !(1 == ~d0_req_up~0); 277#L216-1 assume !(1 == ~d1_req_up~0); 228#L223-1 assume !(1 == ~z_req_up~0); 223#L230-1 start_simulation_~kernel_st~0 := 3; 224#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 310#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 311#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 322#L321-3 assume !(0 == ~d1_ev~0); 262#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 263#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 288#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 252#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 253#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 254#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 303#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 305#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 318#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 239#L354-3 assume !(1 == ~d1_ev~0); 240#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 261#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 287#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 280#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 281#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 292#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 293#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 308#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 267#L439 assume !(0 != start_simulation_~tmp~3); 268#L422-1 [2019-01-14 04:36:31,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:31,943 INFO L82 PathProgramCache]: Analyzing trace with hash 987671025, now seen corresponding path program 1 times [2019-01-14 04:36:31,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:31,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:31,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:32,005 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:36:32,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:32,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:32,007 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:32,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:32,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 1 times [2019-01-14 04:36:32,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:32,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:32,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:32,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:32,128 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:36:32,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:32,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:32,129 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:32,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:32,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:32,130 INFO L87 Difference]: Start difference. First operand 101 states and 167 transitions. cyclomatic complexity: 67 Second operand 3 states. [2019-01-14 04:36:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:32,210 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2019-01-14 04:36:32,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:32,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 166 transitions. [2019-01-14 04:36:32,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:32,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 166 transitions. [2019-01-14 04:36:32,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-14 04:36:32,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-14 04:36:32,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 166 transitions. [2019-01-14 04:36:32,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:32,223 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2019-01-14 04:36:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 166 transitions. [2019-01-14 04:36:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 04:36:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 04:36:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 166 transitions. [2019-01-14 04:36:32,234 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2019-01-14 04:36:32,234 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2019-01-14 04:36:32,234 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:36:32,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 166 transitions. [2019-01-14 04:36:32,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:32,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:32,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:32,238 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:36:32,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:32,239 INFO L794 eck$LassoCheckResult]: Stem: 530#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 452#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 453#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 493#L202 assume 1 == ~b0_req_up~0; 497#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 505#L127-2 ~b0_req_up~0 := 0; 484#L202-1 assume !(1 == ~b1_req_up~0); 461#L209 assume !(1 == ~d0_req_up~0); 489#L216 assume !(1 == ~d1_req_up~0); 486#L223 assume !(1 == ~z_req_up~0); 436#L230 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 437#L245-1 assume !(0 == ~b0_ev~0); 520#L311-1 assume !(0 == ~b1_ev~0); 528#L316-1 assume !(0 == ~d0_ev~0); 444#L321-1 assume !(0 == ~d1_ev~0); 445#L326-1 assume !(0 == ~z_ev~0); 490#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 507#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 467#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 468#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 469#L380 assume !(0 != activate_threads_~tmp~1); 523#L380-2 assume !(1 == ~b0_ev~0); 524#L344-1 assume !(1 == ~b1_ev~0); 527#L349-1 assume !(1 == ~d0_ev~0); 440#L354-1 assume !(1 == ~d1_ev~0); 441#L359-1 assume !(1 == ~z_ev~0); 479#L422-1 [2019-01-14 04:36:32,239 INFO L796 eck$LassoCheckResult]: Loop: 479#L422-1 assume !false; 501#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 442#L285 assume !false; 443#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 496#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 494#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 454#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 455#L280 assume !(0 != eval_~tmp___0~0); 500#L301 start_simulation_~kernel_st~0 := 2; 482#L202-2 assume !(1 == ~b0_req_up~0); 480#L202-3 assume !(1 == ~b1_req_up~0); 481#L209-1 assume !(1 == ~d0_req_up~0); 488#L216-1 assume !(1 == ~d1_req_up~0); 439#L223-1 assume !(1 == ~z_req_up~0); 434#L230-1 start_simulation_~kernel_st~0 := 3; 435#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 521#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 522#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 533#L321-3 assume !(0 == ~d1_ev~0); 473#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 474#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 499#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 463#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 464#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 465#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 514#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 516#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 529#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 450#L354-3 assume !(1 == ~d1_ev~0); 451#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 472#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 498#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 491#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 492#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 503#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 504#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 519#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 478#L439 assume !(0 != start_simulation_~tmp~3); 479#L422-1 [2019-01-14 04:36:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash 768816307, now seen corresponding path program 1 times [2019-01-14 04:36:32,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:32,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:32,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:32,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:32,292 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:36:32,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:32,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:32,293 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:32,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:32,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 2 times [2019-01-14 04:36:32,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:32,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:32,489 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:36:32,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:32,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:32,490 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:32,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:32,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:32,491 INFO L87 Difference]: Start difference. First operand 101 states and 166 transitions. cyclomatic complexity: 66 Second operand 3 states. [2019-01-14 04:36:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:32,530 INFO L93 Difference]: Finished difference Result 101 states and 165 transitions. [2019-01-14 04:36:32,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:32,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 165 transitions. [2019-01-14 04:36:32,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:32,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 165 transitions. [2019-01-14 04:36:32,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-14 04:36:32,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-14 04:36:32,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 165 transitions. [2019-01-14 04:36:32,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:32,548 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2019-01-14 04:36:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 165 transitions. [2019-01-14 04:36:32,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 04:36:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 04:36:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 165 transitions. [2019-01-14 04:36:32,560 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2019-01-14 04:36:32,560 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2019-01-14 04:36:32,560 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:36:32,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 165 transitions. [2019-01-14 04:36:32,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:32,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:32,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:32,564 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, 1, 1] [2019-01-14 04:36:32,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:32,565 INFO L794 eck$LassoCheckResult]: Stem: 741#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 663#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 664#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 704#L202 assume 1 == ~b0_req_up~0; 708#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 716#L127-2 ~b0_req_up~0 := 0; 695#L202-1 assume 1 == ~b1_req_up~0; 681#L142 assume !(~b1_val~0 != ~b1_val_t~0); 671#L142-2 ~b1_req_up~0 := 0; 672#L209 assume !(1 == ~d0_req_up~0); 700#L216 assume !(1 == ~d1_req_up~0); 697#L223 assume !(1 == ~z_req_up~0); 647#L230 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 648#L245-1 assume !(0 == ~b0_ev~0); 731#L311-1 assume !(0 == ~b1_ev~0); 739#L316-1 assume !(0 == ~d0_ev~0); 655#L321-1 assume !(0 == ~d1_ev~0); 656#L326-1 assume !(0 == ~z_ev~0); 701#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 718#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 678#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 679#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 680#L380 assume !(0 != activate_threads_~tmp~1); 734#L380-2 assume !(1 == ~b0_ev~0); 735#L344-1 assume !(1 == ~b1_ev~0); 738#L349-1 assume !(1 == ~d0_ev~0); 651#L354-1 assume !(1 == ~d1_ev~0); 652#L359-1 assume !(1 == ~z_ev~0); 690#L422-1 [2019-01-14 04:36:32,565 INFO L796 eck$LassoCheckResult]: Loop: 690#L422-1 assume !false; 712#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 653#L285 assume !false; 654#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 707#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 705#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 665#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 666#L280 assume !(0 != eval_~tmp___0~0); 711#L301 start_simulation_~kernel_st~0 := 2; 693#L202-2 assume !(1 == ~b0_req_up~0); 691#L202-3 assume !(1 == ~b1_req_up~0); 692#L209-1 assume !(1 == ~d0_req_up~0); 699#L216-1 assume !(1 == ~d1_req_up~0); 650#L223-1 assume !(1 == ~z_req_up~0); 645#L230-1 start_simulation_~kernel_st~0 := 3; 646#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 732#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 733#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 744#L321-3 assume !(0 == ~d1_ev~0); 684#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 685#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 710#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 674#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 675#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 676#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 725#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 727#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 740#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 661#L354-3 assume !(1 == ~d1_ev~0); 662#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 683#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 709#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 702#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 703#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 714#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 715#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 730#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 689#L439 assume !(0 != start_simulation_~tmp~3); 690#L422-1 [2019-01-14 04:36:32,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1003190981, now seen corresponding path program 1 times [2019-01-14 04:36:32,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:32,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:32,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:32,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:32,631 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:36:32,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:32,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:32,632 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 3 times [2019-01-14 04:36:32,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:32,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:32,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:32,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:32,722 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:36:32,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:32,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:32,725 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:32,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:32,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:32,726 INFO L87 Difference]: Start difference. First operand 101 states and 165 transitions. cyclomatic complexity: 65 Second operand 3 states. [2019-01-14 04:36:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:32,810 INFO L93 Difference]: Finished difference Result 101 states and 164 transitions. [2019-01-14 04:36:32,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:32,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 164 transitions. [2019-01-14 04:36:32,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:32,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 164 transitions. [2019-01-14 04:36:32,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-14 04:36:32,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-14 04:36:32,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 164 transitions. [2019-01-14 04:36:32,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:32,823 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2019-01-14 04:36:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 164 transitions. [2019-01-14 04:36:32,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 04:36:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 04:36:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 164 transitions. [2019-01-14 04:36:32,838 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2019-01-14 04:36:32,838 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2019-01-14 04:36:32,838 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:36:32,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 164 transitions. [2019-01-14 04:36:32,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:32,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:32,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:32,847 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, 1, 1] [2019-01-14 04:36:32,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:32,848 INFO L794 eck$LassoCheckResult]: Stem: 952#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 874#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 875#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 915#L202 assume 1 == ~b0_req_up~0; 920#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 927#L127-2 ~b0_req_up~0 := 0; 906#L202-1 assume 1 == ~b1_req_up~0; 892#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 884#L142-2 ~b1_req_up~0 := 0; 885#L209 assume !(1 == ~d0_req_up~0); 911#L216 assume !(1 == ~d1_req_up~0); 908#L223 assume !(1 == ~z_req_up~0); 858#L230 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 859#L245-1 assume !(0 == ~b0_ev~0); 942#L311-1 assume !(0 == ~b1_ev~0); 950#L316-1 assume !(0 == ~d0_ev~0); 866#L321-1 assume !(0 == ~d1_ev~0); 867#L326-1 assume !(0 == ~z_ev~0); 912#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 929#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 889#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 890#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 891#L380 assume !(0 != activate_threads_~tmp~1); 945#L380-2 assume !(1 == ~b0_ev~0); 946#L344-1 assume !(1 == ~b1_ev~0); 949#L349-1 assume !(1 == ~d0_ev~0); 862#L354-1 assume !(1 == ~d1_ev~0); 863#L359-1 assume !(1 == ~z_ev~0); 901#L422-1 [2019-01-14 04:36:32,848 INFO L796 eck$LassoCheckResult]: Loop: 901#L422-1 assume !false; 923#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 864#L285 assume !false; 865#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 918#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 916#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 876#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 877#L280 assume !(0 != eval_~tmp___0~0); 922#L301 start_simulation_~kernel_st~0 := 2; 904#L202-2 assume !(1 == ~b0_req_up~0); 902#L202-3 assume !(1 == ~b1_req_up~0); 903#L209-1 assume !(1 == ~d0_req_up~0); 910#L216-1 assume !(1 == ~d1_req_up~0); 861#L223-1 assume !(1 == ~z_req_up~0); 856#L230-1 start_simulation_~kernel_st~0 := 3; 857#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 943#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 944#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 955#L321-3 assume !(0 == ~d1_ev~0); 895#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 896#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 921#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 883#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 886#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 887#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 936#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 938#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 951#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 872#L354-3 assume !(1 == ~d1_ev~0); 873#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 894#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 919#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 913#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 914#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 925#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 926#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 941#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 900#L439 assume !(0 != start_simulation_~tmp~3); 901#L422-1 [2019-01-14 04:36:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:32,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1425892807, now seen corresponding path program 1 times [2019-01-14 04:36:32,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:32,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:32,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:32,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:32,923 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:36:32,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:32,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:32,924 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:32,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:32,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 4 times [2019-01-14 04:36:32,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:32,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:32,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:32,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:32,985 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:36:32,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:32,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:32,986 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:32,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:32,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:32,986 INFO L87 Difference]: Start difference. First operand 101 states and 164 transitions. cyclomatic complexity: 64 Second operand 3 states. [2019-01-14 04:36:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:33,015 INFO L93 Difference]: Finished difference Result 101 states and 163 transitions. [2019-01-14 04:36:33,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:33,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 163 transitions. [2019-01-14 04:36:33,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:33,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 163 transitions. [2019-01-14 04:36:33,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-14 04:36:33,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-14 04:36:33,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 163 transitions. [2019-01-14 04:36:33,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:33,021 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2019-01-14 04:36:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 163 transitions. [2019-01-14 04:36:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 04:36:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 04:36:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2019-01-14 04:36:33,029 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2019-01-14 04:36:33,029 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2019-01-14 04:36:33,029 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:36:33,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 163 transitions. [2019-01-14 04:36:33,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:33,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:33,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:33,034 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, 1, 1, 1, 1] [2019-01-14 04:36:33,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:33,035 INFO L794 eck$LassoCheckResult]: Stem: 1163#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1085#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1086#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1126#L202 assume 1 == ~b0_req_up~0; 1131#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1138#L127-2 ~b0_req_up~0 := 0; 1117#L202-1 assume 1 == ~b1_req_up~0; 1103#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1095#L142-2 ~b1_req_up~0 := 0; 1096#L209 assume 1 == ~d0_req_up~0; 1150#L157 assume !(~d0_val~0 != ~d0_val_t~0); 1148#L157-2 ~d0_req_up~0 := 0; 1122#L216 assume !(1 == ~d1_req_up~0); 1119#L223 assume !(1 == ~z_req_up~0); 1069#L230 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1070#L245-1 assume !(0 == ~b0_ev~0); 1153#L311-1 assume !(0 == ~b1_ev~0); 1161#L316-1 assume !(0 == ~d0_ev~0); 1077#L321-1 assume !(0 == ~d1_ev~0); 1078#L326-1 assume !(0 == ~z_ev~0); 1123#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1140#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1100#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1101#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 1102#L380 assume !(0 != activate_threads_~tmp~1); 1156#L380-2 assume !(1 == ~b0_ev~0); 1157#L344-1 assume !(1 == ~b1_ev~0); 1160#L349-1 assume !(1 == ~d0_ev~0); 1073#L354-1 assume !(1 == ~d1_ev~0); 1074#L359-1 assume !(1 == ~z_ev~0); 1112#L422-1 [2019-01-14 04:36:33,035 INFO L796 eck$LassoCheckResult]: Loop: 1112#L422-1 assume !false; 1134#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1075#L285 assume !false; 1076#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1129#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1127#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1087#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 1088#L280 assume !(0 != eval_~tmp___0~0); 1133#L301 start_simulation_~kernel_st~0 := 2; 1115#L202-2 assume !(1 == ~b0_req_up~0); 1113#L202-3 assume !(1 == ~b1_req_up~0); 1114#L209-1 assume !(1 == ~d0_req_up~0); 1121#L216-1 assume !(1 == ~d1_req_up~0); 1072#L223-1 assume !(1 == ~z_req_up~0); 1067#L230-1 start_simulation_~kernel_st~0 := 3; 1068#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1154#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1155#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1166#L321-3 assume !(0 == ~d1_ev~0); 1106#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1107#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1132#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1094#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1097#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 1098#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1147#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1149#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1162#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1083#L354-3 assume !(1 == ~d1_ev~0); 1084#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1105#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1130#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1124#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1125#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 1136#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1137#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 1152#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 1111#L439 assume !(0 != start_simulation_~tmp~3); 1112#L422-1 [2019-01-14 04:36:33,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:33,035 INFO L82 PathProgramCache]: Analyzing trace with hash -665750479, now seen corresponding path program 1 times [2019-01-14 04:36:33,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:33,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:33,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:33,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:33,095 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:36:33,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:33,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:33,096 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:33,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 5 times [2019-01-14 04:36:33,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:33,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:33,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:33,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:33,184 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:36:33,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:33,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:33,186 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:33,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:33,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:33,187 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. cyclomatic complexity: 63 Second operand 3 states. [2019-01-14 04:36:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:33,225 INFO L93 Difference]: Finished difference Result 101 states and 162 transitions. [2019-01-14 04:36:33,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:33,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 162 transitions. [2019-01-14 04:36:33,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:33,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 162 transitions. [2019-01-14 04:36:33,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-14 04:36:33,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-14 04:36:33,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 162 transitions. [2019-01-14 04:36:33,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:33,233 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2019-01-14 04:36:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 162 transitions. [2019-01-14 04:36:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 04:36:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 04:36:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2019-01-14 04:36:33,238 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2019-01-14 04:36:33,238 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2019-01-14 04:36:33,238 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:36:33,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 162 transitions. [2019-01-14 04:36:33,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:33,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:33,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:33,241 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, 1, 1, 1, 1] [2019-01-14 04:36:33,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:33,242 INFO L794 eck$LassoCheckResult]: Stem: 1374#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1296#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1297#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1337#L202 assume 1 == ~b0_req_up~0; 1341#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1349#L127-2 ~b0_req_up~0 := 0; 1328#L202-1 assume 1 == ~b1_req_up~0; 1314#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1304#L142-2 ~b1_req_up~0 := 0; 1305#L209 assume 1 == ~d0_req_up~0; 1361#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1359#L157-2 ~d0_req_up~0 := 0; 1333#L216 assume !(1 == ~d1_req_up~0); 1330#L223 assume !(1 == ~z_req_up~0); 1280#L230 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1281#L245-1 assume !(0 == ~b0_ev~0); 1364#L311-1 assume !(0 == ~b1_ev~0); 1372#L316-1 assume !(0 == ~d0_ev~0); 1288#L321-1 assume !(0 == ~d1_ev~0); 1289#L326-1 assume !(0 == ~z_ev~0); 1334#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1351#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1311#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1312#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 1313#L380 assume !(0 != activate_threads_~tmp~1); 1367#L380-2 assume !(1 == ~b0_ev~0); 1368#L344-1 assume !(1 == ~b1_ev~0); 1371#L349-1 assume !(1 == ~d0_ev~0); 1284#L354-1 assume !(1 == ~d1_ev~0); 1285#L359-1 assume !(1 == ~z_ev~0); 1323#L422-1 [2019-01-14 04:36:33,242 INFO L796 eck$LassoCheckResult]: Loop: 1323#L422-1 assume !false; 1345#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1286#L285 assume !false; 1287#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1340#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1338#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1298#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 1299#L280 assume !(0 != eval_~tmp___0~0); 1344#L301 start_simulation_~kernel_st~0 := 2; 1326#L202-2 assume !(1 == ~b0_req_up~0); 1324#L202-3 assume !(1 == ~b1_req_up~0); 1325#L209-1 assume !(1 == ~d0_req_up~0); 1332#L216-1 assume !(1 == ~d1_req_up~0); 1283#L223-1 assume !(1 == ~z_req_up~0); 1278#L230-1 start_simulation_~kernel_st~0 := 3; 1279#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1365#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1366#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1377#L321-3 assume !(0 == ~d1_ev~0); 1317#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1318#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1343#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1307#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1308#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 1309#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1358#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1360#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1373#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1294#L354-3 assume !(1 == ~d1_ev~0); 1295#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1316#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1342#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1335#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1336#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 1347#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1348#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 1363#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 1322#L439 assume !(0 != start_simulation_~tmp~3); 1323#L422-1 [2019-01-14 04:36:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash 151897971, now seen corresponding path program 1 times [2019-01-14 04:36:33,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:33,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:33,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:33,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:33,319 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:36:33,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:33,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:33,320 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:33,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 6 times [2019-01-14 04:36:33,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:33,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:33,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:33,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:33,448 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:36:33,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:33,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:33,449 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:33,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:33,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:33,451 INFO L87 Difference]: Start difference. First operand 101 states and 162 transitions. cyclomatic complexity: 62 Second operand 3 states. [2019-01-14 04:36:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:33,480 INFO L93 Difference]: Finished difference Result 101 states and 161 transitions. [2019-01-14 04:36:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:33,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 161 transitions. [2019-01-14 04:36:33,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:33,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 161 transitions. [2019-01-14 04:36:33,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-14 04:36:33,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-14 04:36:33,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 161 transitions. [2019-01-14 04:36:33,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:33,486 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2019-01-14 04:36:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 161 transitions. [2019-01-14 04:36:33,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 04:36:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 04:36:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 161 transitions. [2019-01-14 04:36:33,493 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2019-01-14 04:36:33,494 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2019-01-14 04:36:33,494 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:36:33,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 161 transitions. [2019-01-14 04:36:33,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:33,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:33,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:33,498 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:33,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:33,499 INFO L794 eck$LassoCheckResult]: Stem: 1585#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1507#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1508#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1548#L202 assume 1 == ~b0_req_up~0; 1552#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1560#L127-2 ~b0_req_up~0 := 0; 1539#L202-1 assume 1 == ~b1_req_up~0; 1525#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1515#L142-2 ~b1_req_up~0 := 0; 1516#L209 assume 1 == ~d0_req_up~0; 1572#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1570#L157-2 ~d0_req_up~0 := 0; 1544#L216 assume 1 == ~d1_req_up~0; 1542#L172 assume !(~d1_val~0 != ~d1_val_t~0); 1540#L172-2 ~d1_req_up~0 := 0; 1541#L223 assume !(1 == ~z_req_up~0); 1491#L230 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1492#L245-1 assume !(0 == ~b0_ev~0); 1575#L311-1 assume !(0 == ~b1_ev~0); 1583#L316-1 assume !(0 == ~d0_ev~0); 1499#L321-1 assume !(0 == ~d1_ev~0); 1500#L326-1 assume !(0 == ~z_ev~0); 1545#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1562#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1522#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1523#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 1524#L380 assume !(0 != activate_threads_~tmp~1); 1578#L380-2 assume !(1 == ~b0_ev~0); 1579#L344-1 assume !(1 == ~b1_ev~0); 1582#L349-1 assume !(1 == ~d0_ev~0); 1495#L354-1 assume !(1 == ~d1_ev~0); 1496#L359-1 assume !(1 == ~z_ev~0); 1534#L422-1 [2019-01-14 04:36:33,499 INFO L796 eck$LassoCheckResult]: Loop: 1534#L422-1 assume !false; 1556#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1497#L285 assume !false; 1498#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1551#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1549#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1509#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 1510#L280 assume !(0 != eval_~tmp___0~0); 1555#L301 start_simulation_~kernel_st~0 := 2; 1537#L202-2 assume !(1 == ~b0_req_up~0); 1535#L202-3 assume !(1 == ~b1_req_up~0); 1536#L209-1 assume !(1 == ~d0_req_up~0); 1543#L216-1 assume !(1 == ~d1_req_up~0); 1494#L223-1 assume !(1 == ~z_req_up~0); 1489#L230-1 start_simulation_~kernel_st~0 := 3; 1490#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1576#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1577#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1588#L321-3 assume !(0 == ~d1_ev~0); 1528#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1529#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1554#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1518#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1519#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 1520#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1569#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1571#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1584#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1505#L354-3 assume !(1 == ~d1_ev~0); 1506#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1527#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1553#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1546#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1547#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 1558#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1559#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 1574#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 1533#L439 assume !(0 != start_simulation_~tmp~3); 1534#L422-1 [2019-01-14 04:36:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash -650688005, now seen corresponding path program 1 times [2019-01-14 04:36:33,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:33,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:33,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:33,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:33,536 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:36:33,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:33,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:33,537 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:33,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 7 times [2019-01-14 04:36:33,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:33,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:33,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:33,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:33,807 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:36:33,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:33,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:33,809 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:33,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:33,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:33,810 INFO L87 Difference]: Start difference. First operand 101 states and 161 transitions. cyclomatic complexity: 61 Second operand 3 states. [2019-01-14 04:36:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:33,866 INFO L93 Difference]: Finished difference Result 101 states and 160 transitions. [2019-01-14 04:36:33,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:33,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 160 transitions. [2019-01-14 04:36:33,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:33,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 160 transitions. [2019-01-14 04:36:33,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-14 04:36:33,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-14 04:36:33,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 160 transitions. [2019-01-14 04:36:33,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:33,873 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2019-01-14 04:36:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 160 transitions. [2019-01-14 04:36:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 04:36:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 04:36:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2019-01-14 04:36:33,878 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2019-01-14 04:36:33,878 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2019-01-14 04:36:33,879 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:36:33,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 160 transitions. [2019-01-14 04:36:33,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:33,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:33,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:33,884 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:33,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:33,886 INFO L794 eck$LassoCheckResult]: Stem: 1796#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1718#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1719#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1759#L202 assume 1 == ~b0_req_up~0; 1763#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1771#L127-2 ~b0_req_up~0 := 0; 1750#L202-1 assume 1 == ~b1_req_up~0; 1736#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1726#L142-2 ~b1_req_up~0 := 0; 1727#L209 assume 1 == ~d0_req_up~0; 1783#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1781#L157-2 ~d0_req_up~0 := 0; 1755#L216 assume 1 == ~d1_req_up~0; 1753#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 1751#L172-2 ~d1_req_up~0 := 0; 1752#L223 assume !(1 == ~z_req_up~0); 1702#L230 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1703#L245-1 assume !(0 == ~b0_ev~0); 1786#L311-1 assume !(0 == ~b1_ev~0); 1794#L316-1 assume !(0 == ~d0_ev~0); 1710#L321-1 assume !(0 == ~d1_ev~0); 1711#L326-1 assume !(0 == ~z_ev~0); 1756#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1773#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1733#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1734#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 1735#L380 assume !(0 != activate_threads_~tmp~1); 1789#L380-2 assume !(1 == ~b0_ev~0); 1790#L344-1 assume !(1 == ~b1_ev~0); 1793#L349-1 assume !(1 == ~d0_ev~0); 1706#L354-1 assume !(1 == ~d1_ev~0); 1707#L359-1 assume !(1 == ~z_ev~0); 1745#L422-1 [2019-01-14 04:36:33,886 INFO L796 eck$LassoCheckResult]: Loop: 1745#L422-1 assume !false; 1767#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1708#L285 assume !false; 1709#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1762#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1760#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1720#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 1721#L280 assume !(0 != eval_~tmp___0~0); 1766#L301 start_simulation_~kernel_st~0 := 2; 1748#L202-2 assume !(1 == ~b0_req_up~0); 1746#L202-3 assume !(1 == ~b1_req_up~0); 1747#L209-1 assume !(1 == ~d0_req_up~0); 1754#L216-1 assume !(1 == ~d1_req_up~0); 1705#L223-1 assume !(1 == ~z_req_up~0); 1700#L230-1 start_simulation_~kernel_st~0 := 3; 1701#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1787#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1788#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1799#L321-3 assume !(0 == ~d1_ev~0); 1739#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1740#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1765#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1729#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1730#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 1731#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1780#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1782#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1795#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1716#L354-3 assume !(1 == ~d1_ev~0); 1717#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1738#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1764#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1757#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1758#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 1769#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1770#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 1785#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 1744#L439 assume !(0 != start_simulation_~tmp~3); 1745#L422-1 [2019-01-14 04:36:33,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1038255737, now seen corresponding path program 1 times [2019-01-14 04:36:33,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:33,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:33,948 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:36:33,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:33,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:33,949 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:33,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:33,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 8 times [2019-01-14 04:36:33,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:33,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:33,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:33,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:34,040 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:36:34,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:34,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:34,041 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:34,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:34,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:34,041 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. cyclomatic complexity: 60 Second operand 3 states. [2019-01-14 04:36:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:34,058 INFO L93 Difference]: Finished difference Result 101 states and 159 transitions. [2019-01-14 04:36:34,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:34,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 159 transitions. [2019-01-14 04:36:34,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:34,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 159 transitions. [2019-01-14 04:36:34,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-14 04:36:34,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-14 04:36:34,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 159 transitions. [2019-01-14 04:36:34,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:34,067 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2019-01-14 04:36:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 159 transitions. [2019-01-14 04:36:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 04:36:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 04:36:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 159 transitions. [2019-01-14 04:36:34,072 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2019-01-14 04:36:34,072 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2019-01-14 04:36:34,072 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:36:34,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 159 transitions. [2019-01-14 04:36:34,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-14 04:36:34,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:34,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:34,083 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:34,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:34,086 INFO L794 eck$LassoCheckResult]: Stem: 2007#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1929#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1930#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1970#L202 assume 1 == ~b0_req_up~0; 1974#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1982#L127-2 ~b0_req_up~0 := 0; 1961#L202-1 assume 1 == ~b1_req_up~0; 1947#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1937#L142-2 ~b1_req_up~0 := 0; 1938#L209 assume 1 == ~d0_req_up~0; 1994#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1992#L157-2 ~d0_req_up~0 := 0; 1966#L216 assume 1 == ~d1_req_up~0; 1964#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 1962#L172-2 ~d1_req_up~0 := 0; 1963#L223 assume !(1 == ~z_req_up~0); 1913#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 1914#L245-1 assume !(0 == ~b0_ev~0); 1997#L311-1 assume !(0 == ~b1_ev~0); 2005#L316-1 assume !(0 == ~d0_ev~0); 1921#L321-1 assume !(0 == ~d1_ev~0); 1922#L326-1 assume !(0 == ~z_ev~0); 1967#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1984#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1944#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1945#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 1946#L380 assume !(0 != activate_threads_~tmp~1); 2000#L380-2 assume !(1 == ~b0_ev~0); 2001#L344-1 assume !(1 == ~b1_ev~0); 2004#L349-1 assume !(1 == ~d0_ev~0); 1917#L354-1 assume !(1 == ~d1_ev~0); 1918#L359-1 assume !(1 == ~z_ev~0); 1956#L422-1 [2019-01-14 04:36:34,086 INFO L796 eck$LassoCheckResult]: Loop: 1956#L422-1 assume !false; 1978#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1919#L285 assume !false; 1920#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1973#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1971#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1931#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 1932#L280 assume !(0 != eval_~tmp___0~0); 1977#L301 start_simulation_~kernel_st~0 := 2; 1959#L202-2 assume !(1 == ~b0_req_up~0); 1957#L202-3 assume !(1 == ~b1_req_up~0); 1958#L209-1 assume !(1 == ~d0_req_up~0); 1965#L216-1 assume !(1 == ~d1_req_up~0); 1916#L223-1 assume !(1 == ~z_req_up~0); 1911#L230-1 start_simulation_~kernel_st~0 := 3; 1912#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1998#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1999#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2010#L321-3 assume !(0 == ~d1_ev~0); 1950#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1951#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1976#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1940#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1941#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 1942#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1991#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1993#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2006#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1927#L354-3 assume !(1 == ~d1_ev~0); 1928#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1949#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1975#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1968#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1969#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 1980#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1981#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 1996#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 1955#L439 assume !(0 != start_simulation_~tmp~3); 1956#L422-1 [2019-01-14 04:36:34,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:34,087 INFO L82 PathProgramCache]: Analyzing trace with hash 17187383, now seen corresponding path program 1 times [2019-01-14 04:36:34,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:34,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:34,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:34,175 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:36:34,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:34,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:34,176 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 9 times [2019-01-14 04:36:34,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:34,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:34,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:34,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:34,274 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:36:34,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:34,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:34,276 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:34,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:34,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:34,277 INFO L87 Difference]: Start difference. First operand 101 states and 159 transitions. cyclomatic complexity: 59 Second operand 3 states. [2019-01-14 04:36:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:34,326 INFO L93 Difference]: Finished difference Result 116 states and 181 transitions. [2019-01-14 04:36:34,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:34,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 181 transitions. [2019-01-14 04:36:34,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2019-01-14 04:36:34,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 181 transitions. [2019-01-14 04:36:34,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-01-14 04:36:34,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-01-14 04:36:34,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 181 transitions. [2019-01-14 04:36:34,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:34,332 INFO L706 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2019-01-14 04:36:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 181 transitions. [2019-01-14 04:36:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-01-14 04:36:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 04:36:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2019-01-14 04:36:34,336 INFO L729 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2019-01-14 04:36:34,336 INFO L609 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2019-01-14 04:36:34,336 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:36:34,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 181 transitions. [2019-01-14 04:36:34,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2019-01-14 04:36:34,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:34,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:34,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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:34,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:34,339 INFO L794 eck$LassoCheckResult]: Stem: 2235#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 2155#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 2156#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2196#L202 assume 1 == ~b0_req_up~0; 2201#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2209#L127-2 ~b0_req_up~0 := 0; 2187#L202-1 assume 1 == ~b1_req_up~0; 2173#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2165#L142-2 ~b1_req_up~0 := 0; 2166#L209 assume 1 == ~d0_req_up~0; 2221#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2219#L157-2 ~d0_req_up~0 := 0; 2192#L216 assume 1 == ~d1_req_up~0; 2190#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2188#L172-2 ~d1_req_up~0 := 0; 2189#L223 assume !(1 == ~z_req_up~0); 2139#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2140#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2224#L311-1 assume !(0 == ~b1_ev~0); 2232#L316-1 assume !(0 == ~d0_ev~0); 2150#L321-1 assume !(0 == ~d1_ev~0); 2151#L326-1 assume !(0 == ~z_ev~0); 2193#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2212#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2170#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2171#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 2172#L380 assume !(0 != activate_threads_~tmp~1); 2227#L380-2 assume !(1 == ~b0_ev~0); 2228#L344-1 assume !(1 == ~b1_ev~0); 2231#L349-1 assume !(1 == ~d0_ev~0); 2143#L354-1 assume !(1 == ~d1_ev~0); 2144#L359-1 assume !(1 == ~z_ev~0); 2182#L422-1 [2019-01-14 04:36:34,339 INFO L796 eck$LassoCheckResult]: Loop: 2182#L422-1 assume !false; 2204#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 2145#L285 assume !false; 2146#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2199#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2197#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2157#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 2158#L280 assume !(0 != eval_~tmp___0~0); 2203#L301 start_simulation_~kernel_st~0 := 2; 2185#L202-2 assume !(1 == ~b0_req_up~0); 2183#L202-3 assume !(1 == ~b1_req_up~0); 2184#L209-1 assume !(1 == ~d0_req_up~0); 2191#L216-1 assume !(1 == ~d1_req_up~0); 2142#L223-1 assume !(1 == ~z_req_up~0); 2137#L230-1 start_simulation_~kernel_st~0 := 3; 2138#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2225#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2226#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2238#L321-3 assume !(0 == ~d1_ev~0); 2176#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2177#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2202#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2164#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2167#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 2168#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2218#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2220#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2234#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2153#L354-3 assume !(1 == ~d1_ev~0); 2154#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2175#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2200#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2194#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2195#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 2206#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2207#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 2223#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 2181#L439 assume !(0 != start_simulation_~tmp~3); 2182#L422-1 [2019-01-14 04:36:34,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:34,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1297051061, now seen corresponding path program 1 times [2019-01-14 04:36:34,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:34,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:34,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:34,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:34,399 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:36:34,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:34,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:34,400 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:34,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:34,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 10 times [2019-01-14 04:36:34,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:34,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:34,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:34,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:34,613 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:36:34,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:34,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:34,614 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:34,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:34,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:34,615 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. cyclomatic complexity: 66 Second operand 3 states. [2019-01-14 04:36:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:34,820 INFO L93 Difference]: Finished difference Result 141 states and 218 transitions. [2019-01-14 04:36:34,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:34,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 218 transitions. [2019-01-14 04:36:34,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2019-01-14 04:36:34,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 141 states and 218 transitions. [2019-01-14 04:36:34,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2019-01-14 04:36:34,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2019-01-14 04:36:34,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 218 transitions. [2019-01-14 04:36:34,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:34,826 INFO L706 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2019-01-14 04:36:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 218 transitions. [2019-01-14 04:36:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-14 04:36:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-14 04:36:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 218 transitions. [2019-01-14 04:36:34,831 INFO L729 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2019-01-14 04:36:34,831 INFO L609 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2019-01-14 04:36:34,831 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 04:36:34,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 218 transitions. [2019-01-14 04:36:34,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2019-01-14 04:36:34,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:34,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:34,833 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:34,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:34,834 INFO L794 eck$LassoCheckResult]: Stem: 2504#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 2421#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 2422#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2465#L202 assume 1 == ~b0_req_up~0; 2470#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2478#L127-2 ~b0_req_up~0 := 0; 2456#L202-1 assume 1 == ~b1_req_up~0; 2440#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2432#L142-2 ~b1_req_up~0 := 0; 2433#L209 assume 1 == ~d0_req_up~0; 2490#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2488#L157-2 ~d0_req_up~0 := 0; 2461#L216 assume 1 == ~d1_req_up~0; 2459#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2457#L172-2 ~d1_req_up~0 := 0; 2458#L223 assume !(1 == ~z_req_up~0); 2405#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2406#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2493#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2502#L316-1 assume !(0 == ~d0_ev~0); 2416#L321-1 assume !(0 == ~d1_ev~0); 2417#L326-1 assume !(0 == ~z_ev~0); 2462#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2480#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2437#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2438#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 2439#L380 assume !(0 != activate_threads_~tmp~1); 2496#L380-2 assume !(1 == ~b0_ev~0); 2497#L344-1 assume !(1 == ~b1_ev~0); 2501#L349-1 assume !(1 == ~d0_ev~0); 2409#L354-1 assume !(1 == ~d1_ev~0); 2410#L359-1 assume !(1 == ~z_ev~0); 2449#L422-1 [2019-01-14 04:36:34,834 INFO L796 eck$LassoCheckResult]: Loop: 2449#L422-1 assume !false; 2473#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 2411#L285 assume !false; 2412#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2468#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2466#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2423#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 2424#L280 assume !(0 != eval_~tmp___0~0); 2472#L301 start_simulation_~kernel_st~0 := 2; 2453#L202-2 assume !(1 == ~b0_req_up~0); 2455#L202-3 assume !(1 == ~b1_req_up~0); 2528#L209-1 assume !(1 == ~d0_req_up~0); 2522#L216-1 assume !(1 == ~d1_req_up~0); 2516#L223-1 assume !(1 == ~z_req_up~0); 2513#L230-1 start_simulation_~kernel_st~0 := 3; 2512#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2510#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2495#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2507#L321-3 assume !(0 == ~d1_ev~0); 2443#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2444#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2471#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2431#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2434#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 2435#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2487#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2489#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2503#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2419#L354-3 assume !(1 == ~d1_ev~0); 2420#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2442#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2469#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2463#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2464#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 2475#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2476#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 2492#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 2448#L439 assume !(0 != start_simulation_~tmp~3); 2449#L422-1 [2019-01-14 04:36:34,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1986798985, now seen corresponding path program 1 times [2019-01-14 04:36:34,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:34,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:34,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:34,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:34,874 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:36:34,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:34,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:34,875 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:34,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 11 times [2019-01-14 04:36:34,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:34,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:34,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:34,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:34,940 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:36:34,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:34,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:34,941 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:34,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:34,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:34,941 INFO L87 Difference]: Start difference. First operand 141 states and 218 transitions. cyclomatic complexity: 78 Second operand 3 states. [2019-01-14 04:36:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:34,997 INFO L93 Difference]: Finished difference Result 180 states and 275 transitions. [2019-01-14 04:36:34,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:34,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 275 transitions. [2019-01-14 04:36:35,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2019-01-14 04:36:35,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 275 transitions. [2019-01-14 04:36:35,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2019-01-14 04:36:35,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2019-01-14 04:36:35,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 275 transitions. [2019-01-14 04:36:35,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:35,004 INFO L706 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-01-14 04:36:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 275 transitions. [2019-01-14 04:36:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-01-14 04:36:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-14 04:36:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2019-01-14 04:36:35,009 INFO L729 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-01-14 04:36:35,009 INFO L609 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-01-14 04:36:35,009 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 04:36:35,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 275 transitions. [2019-01-14 04:36:35,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2019-01-14 04:36:35,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:35,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:35,012 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:35,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:35,012 INFO L794 eck$LassoCheckResult]: Stem: 2835#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 2751#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 2752#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2794#L202 assume 1 == ~b0_req_up~0; 2799#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2807#L127-2 ~b0_req_up~0 := 0; 2785#L202-1 assume 1 == ~b1_req_up~0; 2770#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2760#L142-2 ~b1_req_up~0 := 0; 2761#L209 assume 1 == ~d0_req_up~0; 2820#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2818#L157-2 ~d0_req_up~0 := 0; 2790#L216 assume 1 == ~d1_req_up~0; 2788#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2786#L172-2 ~d1_req_up~0 := 0; 2787#L223 assume !(1 == ~z_req_up~0); 2735#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2736#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2823#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2833#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2743#L321-1 assume !(0 == ~d1_ev~0); 2744#L326-1 assume !(0 == ~z_ev~0); 2791#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2809#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2767#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2768#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 2769#L380 assume !(0 != activate_threads_~tmp~1); 2826#L380-2 assume !(1 == ~b0_ev~0); 2827#L344-1 assume !(1 == ~b1_ev~0); 2832#L349-1 assume !(1 == ~d0_ev~0); 2739#L354-1 assume !(1 == ~d1_ev~0); 2740#L359-1 assume !(1 == ~z_ev~0); 2779#L422-1 [2019-01-14 04:36:35,012 INFO L796 eck$LassoCheckResult]: Loop: 2779#L422-1 assume !false; 2802#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 2741#L285 assume !false; 2742#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2797#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2795#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2753#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 2754#L280 assume !(0 != eval_~tmp___0~0); 2801#L301 start_simulation_~kernel_st~0 := 2; 2782#L202-2 assume !(1 == ~b0_req_up~0); 2784#L202-3 assume !(1 == ~b1_req_up~0); 2862#L209-1 assume !(1 == ~d0_req_up~0); 2856#L216-1 assume !(1 == ~d1_req_up~0); 2850#L223-1 assume !(1 == ~z_req_up~0); 2847#L230-1 start_simulation_~kernel_st~0 := 3; 2844#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2842#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2840#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2838#L321-3 assume !(0 == ~d1_ev~0); 2773#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2774#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2800#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2763#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2764#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 2765#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2817#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2819#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2834#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2749#L354-3 assume !(1 == ~d1_ev~0); 2750#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2772#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2798#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2792#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2793#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 2804#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2805#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 2822#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 2778#L439 assume !(0 != start_simulation_~tmp~3); 2779#L422-1 [2019-01-14 04:36:35,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:35,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1399992971, now seen corresponding path program 1 times [2019-01-14 04:36:35,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:35,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:35,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:35,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:35,048 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:36:35,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:35,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:35,049 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:35,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 12 times [2019-01-14 04:36:35,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:35,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:35,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:35,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:35,131 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:36:35,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:35,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:35,135 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:35,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:35,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:35,136 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. cyclomatic complexity: 96 Second operand 3 states. [2019-01-14 04:36:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:35,186 INFO L93 Difference]: Finished difference Result 235 states and 352 transitions. [2019-01-14 04:36:35,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:35,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 352 transitions. [2019-01-14 04:36:35,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 198 [2019-01-14 04:36:35,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 235 states and 352 transitions. [2019-01-14 04:36:35,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2019-01-14 04:36:35,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2019-01-14 04:36:35,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 352 transitions. [2019-01-14 04:36:35,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:35,197 INFO L706 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2019-01-14 04:36:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 352 transitions. [2019-01-14 04:36:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-01-14 04:36:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 04:36:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 352 transitions. [2019-01-14 04:36:35,205 INFO L729 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2019-01-14 04:36:35,205 INFO L609 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2019-01-14 04:36:35,205 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 04:36:35,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 352 transitions. [2019-01-14 04:36:35,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 198 [2019-01-14 04:36:35,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:35,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:35,210 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:35,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:35,211 INFO L794 eck$LassoCheckResult]: Stem: 3265#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 3177#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 3178#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 3222#L202 assume 1 == ~b0_req_up~0; 3227#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 3235#L127-2 ~b0_req_up~0 := 0; 3212#L202-1 assume 1 == ~b1_req_up~0; 3196#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 3188#L142-2 ~b1_req_up~0 := 0; 3189#L209 assume 1 == ~d0_req_up~0; 3248#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 3246#L157-2 ~d0_req_up~0 := 0; 3218#L216 assume 1 == ~d1_req_up~0; 3215#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 3213#L172-2 ~d1_req_up~0 := 0; 3214#L223 assume !(1 == ~z_req_up~0); 3159#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 3160#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 3251#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3261#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3167#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 3168#L326-1 assume !(0 == ~z_ev~0); 3219#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 3237#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 3193#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 3194#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 3195#L380 assume !(0 != activate_threads_~tmp~1); 3254#L380-2 assume !(1 == ~b0_ev~0); 3255#L344-1 assume !(1 == ~b1_ev~0); 3260#L349-1 assume !(1 == ~d0_ev~0); 3163#L354-1 assume !(1 == ~d1_ev~0); 3164#L359-1 assume !(1 == ~z_ev~0); 3205#L422-1 [2019-01-14 04:36:35,211 INFO L796 eck$LassoCheckResult]: Loop: 3205#L422-1 assume !false; 3230#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 3165#L285 assume !false; 3166#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 3225#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 3223#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 3179#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 3180#L280 assume !(0 != eval_~tmp___0~0); 3229#L301 start_simulation_~kernel_st~0 := 2; 3209#L202-2 assume !(1 == ~b0_req_up~0); 3211#L202-3 assume !(1 == ~b1_req_up~0); 3311#L209-1 assume !(1 == ~d0_req_up~0); 3312#L216-1 assume !(1 == ~d1_req_up~0); 3340#L223-1 assume !(1 == ~z_req_up~0); 3389#L230-1 start_simulation_~kernel_st~0 := 3; 3287#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 3279#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3273#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3269#L321-3 assume !(0 == ~d1_ev~0); 3199#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 3200#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 3228#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 3187#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 3190#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 3191#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 3242#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 3247#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 3264#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 3175#L354-3 assume !(1 == ~d1_ev~0); 3176#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 3197#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 3226#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 3220#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 3221#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 3232#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3233#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 3250#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 3204#L439 assume !(0 != start_simulation_~tmp~3); 3205#L422-1 [2019-01-14 04:36:35,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:35,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1658158409, now seen corresponding path program 1 times [2019-01-14 04:36:35,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:35,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:35,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:35,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:35,282 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:36:35,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:35,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:35,283 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:35,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 13 times [2019-01-14 04:36:35,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:35,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:35,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:35,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:35,346 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:36:35,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:35,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:35,347 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:35,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:35,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:35,348 INFO L87 Difference]: Start difference. First operand 235 states and 352 transitions. cyclomatic complexity: 118 Second operand 3 states. [2019-01-14 04:36:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:35,474 INFO L93 Difference]: Finished difference Result 253 states and 374 transitions. [2019-01-14 04:36:35,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:35,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 253 states and 374 transitions. [2019-01-14 04:36:35,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2019-01-14 04:36:35,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 253 states to 253 states and 374 transitions. [2019-01-14 04:36:35,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2019-01-14 04:36:35,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2019-01-14 04:36:35,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 253 states and 374 transitions. [2019-01-14 04:36:35,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:35,484 INFO L706 BuchiCegarLoop]: Abstraction has 253 states and 374 transitions. [2019-01-14 04:36:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states and 374 transitions. [2019-01-14 04:36:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-01-14 04:36:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-14 04:36:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 374 transitions. [2019-01-14 04:36:35,491 INFO L729 BuchiCegarLoop]: Abstraction has 253 states and 374 transitions. [2019-01-14 04:36:35,492 INFO L609 BuchiCegarLoop]: Abstraction has 253 states and 374 transitions. [2019-01-14 04:36:35,493 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 04:36:35,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 253 states and 374 transitions. [2019-01-14 04:36:35,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2019-01-14 04:36:35,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:35,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:35,499 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:35,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:35,500 INFO L794 eck$LassoCheckResult]: Stem: 3758#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 3673#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 3674#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 3716#L202 assume 1 == ~b0_req_up~0; 3721#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 3729#L127-2 ~b0_req_up~0 := 0; 3705#L202-1 assume 1 == ~b1_req_up~0; 3690#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 3684#L142-2 ~b1_req_up~0 := 0; 3685#L209 assume 1 == ~d0_req_up~0; 3741#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 3739#L157-2 ~d0_req_up~0 := 0; 3712#L216 assume 1 == ~d1_req_up~0; 3708#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 3706#L172-2 ~d1_req_up~0 := 0; 3707#L223 assume !(1 == ~z_req_up~0); 3656#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 3657#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 3745#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3754#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3664#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 3665#L326-1 assume !(0 == ~z_ev~0); 3713#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 3731#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 3734#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 3688#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 3689#L380 assume !(0 != activate_threads_~tmp~1); 3748#L380-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 3749#L344-1 assume !(1 == ~b1_ev~0); 3753#L349-1 assume !(1 == ~d0_ev~0); 3660#L354-1 assume !(1 == ~d1_ev~0); 3661#L359-1 assume !(1 == ~z_ev~0); 3699#L422-1 [2019-01-14 04:36:35,500 INFO L796 eck$LassoCheckResult]: Loop: 3699#L422-1 assume !false; 3724#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 3662#L285 assume !false; 3663#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 3719#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 3717#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 3675#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 3676#L280 assume !(0 != eval_~tmp___0~0); 3723#L301 start_simulation_~kernel_st~0 := 2; 3702#L202-2 assume !(1 == ~b0_req_up~0); 3704#L202-3 assume !(1 == ~b1_req_up~0); 3795#L209-1 assume !(1 == ~d0_req_up~0); 3793#L216-1 assume !(1 == ~d1_req_up~0); 3788#L223-1 assume !(1 == ~z_req_up~0); 3783#L230-1 start_simulation_~kernel_st~0 := 3; 3780#L311-2 assume !(0 == ~b0_ev~0); 3777#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3773#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3768#L321-3 assume !(0 == ~d1_ev~0); 3767#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 3766#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 3765#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 3733#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 3686#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 3687#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 3735#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 3740#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 3757#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 3671#L354-3 assume !(1 == ~d1_ev~0); 3672#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 3691#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 3720#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 3714#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 3715#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 3726#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3727#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 3744#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 3698#L439 assume !(0 != start_simulation_~tmp~3); 3699#L422-1 [2019-01-14 04:36:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:35,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1660005451, now seen corresponding path program 1 times [2019-01-14 04:36:35,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:35,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:35,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:35,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:35,555 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:36:35,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:35,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:35,556 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:35,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:35,556 INFO L82 PathProgramCache]: Analyzing trace with hash 763502474, now seen corresponding path program 1 times [2019-01-14 04:36:35,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:35,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:35,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:35,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:35,611 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:36:35,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:35,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:35,611 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:35,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:35,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:35,612 INFO L87 Difference]: Start difference. First operand 253 states and 374 transitions. cyclomatic complexity: 122 Second operand 3 states. [2019-01-14 04:36:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:35,668 INFO L93 Difference]: Finished difference Result 281 states and 413 transitions. [2019-01-14 04:36:35,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:35,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 413 transitions. [2019-01-14 04:36:35,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2019-01-14 04:36:35,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 281 states and 413 transitions. [2019-01-14 04:36:35,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2019-01-14 04:36:35,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2019-01-14 04:36:35,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 281 states and 413 transitions. [2019-01-14 04:36:35,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:35,675 INFO L706 BuchiCegarLoop]: Abstraction has 281 states and 413 transitions. [2019-01-14 04:36:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states and 413 transitions. [2019-01-14 04:36:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2019-01-14 04:36:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-14 04:36:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 413 transitions. [2019-01-14 04:36:35,687 INFO L729 BuchiCegarLoop]: Abstraction has 281 states and 413 transitions. [2019-01-14 04:36:35,687 INFO L609 BuchiCegarLoop]: Abstraction has 281 states and 413 transitions. [2019-01-14 04:36:35,687 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-14 04:36:35,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 413 transitions. [2019-01-14 04:36:35,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2019-01-14 04:36:35,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:35,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:35,693 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:35,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:35,695 INFO L794 eck$LassoCheckResult]: Stem: 4298#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 4216#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 4217#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4258#L202 assume 1 == ~b0_req_up~0; 4263#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 4271#L127-2 ~b0_req_up~0 := 0; 4248#L202-1 assume 1 == ~b1_req_up~0; 4233#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 4227#L142-2 ~b1_req_up~0 := 0; 4228#L209 assume 1 == ~d0_req_up~0; 4283#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 4281#L157-2 ~d0_req_up~0 := 0; 4254#L216 assume 1 == ~d1_req_up~0; 4251#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 4249#L172-2 ~d1_req_up~0 := 0; 4250#L223 assume !(1 == ~z_req_up~0); 4199#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 4200#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 4286#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4296#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4207#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 4208#L326-1 assume !(0 == ~z_ev~0); 4255#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 4273#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4276#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4231#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 4232#L380 assume !(0 != activate_threads_~tmp~1); 4289#L380-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4290#L344-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 4295#L349-1 assume !(1 == ~d0_ev~0); 4203#L354-1 assume !(1 == ~d1_ev~0); 4204#L359-1 assume !(1 == ~z_ev~0); 4242#L422-1 [2019-01-14 04:36:35,695 INFO L796 eck$LassoCheckResult]: Loop: 4242#L422-1 assume !false; 4266#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 4205#L285 assume !false; 4206#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 4261#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4259#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4218#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 4219#L280 assume !(0 != eval_~tmp___0~0); 4265#L301 start_simulation_~kernel_st~0 := 2; 4245#L202-2 assume !(1 == ~b0_req_up~0); 4247#L202-3 assume !(1 == ~b1_req_up~0); 4382#L209-1 assume !(1 == ~d0_req_up~0); 4377#L216-1 assume !(1 == ~d1_req_up~0); 4371#L223-1 assume !(1 == ~z_req_up~0); 4368#L230-1 start_simulation_~kernel_st~0 := 3; 4366#L311-2 assume !(0 == ~b0_ev~0); 4362#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4337#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4330#L321-3 assume !(0 == ~d1_ev~0); 4327#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 4324#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 4322#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4275#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4229#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 4230#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4277#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4282#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 4297#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 4214#L354-3 assume !(1 == ~d1_ev~0); 4215#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 4234#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 4262#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4256#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4257#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 4268#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 4269#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 4285#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 4241#L439 assume !(0 != start_simulation_~tmp~3); 4242#L422-1 [2019-01-14 04:36:35,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:35,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1660065033, now seen corresponding path program 1 times [2019-01-14 04:36:35,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:35,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:35,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:35,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:35,763 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:36:35,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:35,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:35,766 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:35,767 INFO L82 PathProgramCache]: Analyzing trace with hash 763502474, now seen corresponding path program 2 times [2019-01-14 04:36:35,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:35,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:35,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:35,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:36,014 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:36:36,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:36,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:36,018 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:36,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:36,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:36,020 INFO L87 Difference]: Start difference. First operand 281 states and 413 transitions. cyclomatic complexity: 133 Second operand 3 states. [2019-01-14 04:36:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:36,240 INFO L93 Difference]: Finished difference Result 323 states and 472 transitions. [2019-01-14 04:36:36,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:36,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323 states and 472 transitions. [2019-01-14 04:36:36,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 289 [2019-01-14 04:36:36,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323 states to 323 states and 472 transitions. [2019-01-14 04:36:36,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 323 [2019-01-14 04:36:36,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 323 [2019-01-14 04:36:36,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 323 states and 472 transitions. [2019-01-14 04:36:36,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:36,253 INFO L706 BuchiCegarLoop]: Abstraction has 323 states and 472 transitions. [2019-01-14 04:36:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states and 472 transitions. [2019-01-14 04:36:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2019-01-14 04:36:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-01-14 04:36:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 472 transitions. [2019-01-14 04:36:36,262 INFO L729 BuchiCegarLoop]: Abstraction has 323 states and 472 transitions. [2019-01-14 04:36:36,262 INFO L609 BuchiCegarLoop]: Abstraction has 323 states and 472 transitions. [2019-01-14 04:36:36,262 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-14 04:36:36,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 323 states and 472 transitions. [2019-01-14 04:36:36,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 289 [2019-01-14 04:36:36,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:36,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:36,270 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:36,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:36,270 INFO L794 eck$LassoCheckResult]: Stem: 4916#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 4829#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 4830#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4870#L202 assume 1 == ~b0_req_up~0; 4875#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 4884#L127-2 ~b0_req_up~0 := 0; 4861#L202-1 assume 1 == ~b1_req_up~0; 4846#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 4840#L142-2 ~b1_req_up~0 := 0; 4841#L209 assume 1 == ~d0_req_up~0; 4898#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 4896#L157-2 ~d0_req_up~0 := 0; 4866#L216 assume 1 == ~d1_req_up~0; 4864#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 4862#L172-2 ~d1_req_up~0 := 0; 4863#L223 assume !(1 == ~z_req_up~0); 4812#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 4813#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 4901#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4913#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4820#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 4821#L326-1 assume !(0 == ~z_ev~0); 4867#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 4887#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4891#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4844#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 4845#L380 assume !(0 != activate_threads_~tmp~1); 4904#L380-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4907#L344-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 4912#L349-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 4816#L354-1 assume !(1 == ~d1_ev~0); 4817#L359-1 assume !(1 == ~z_ev~0); 4855#L422-1 [2019-01-14 04:36:36,275 INFO L796 eck$LassoCheckResult]: Loop: 4855#L422-1 assume !false; 4879#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 4818#L285 assume !false; 4819#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 4873#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4871#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4831#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 4832#L280 assume !(0 != eval_~tmp___0~0); 4878#L301 start_simulation_~kernel_st~0 := 2; 4858#L202-2 assume !(1 == ~b0_req_up~0); 4860#L202-3 assume !(1 == ~b1_req_up~0); 5001#L209-1 assume !(1 == ~d0_req_up~0); 4997#L216-1 assume !(1 == ~d1_req_up~0); 4998#L223-1 assume !(1 == ~z_req_up~0); 5051#L230-1 start_simulation_~kernel_st~0 := 3; 5049#L311-2 assume !(0 == ~b0_ev~0); 5042#L311-4 assume !(0 == ~b1_ev~0); 5038#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5031#L321-3 assume !(0 == ~d1_ev~0); 5028#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 5026#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 5024#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4954#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4953#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 4951#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4948#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4947#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 4915#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 4827#L354-3 assume !(1 == ~d1_ev~0); 4828#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 4847#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 4874#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4868#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4869#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 4881#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 4882#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 4900#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 4854#L439 assume !(0 != start_simulation_~tmp~3); 4855#L422-1 [2019-01-14 04:36:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:36,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1660066955, now seen corresponding path program 1 times [2019-01-14 04:36:36,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:36,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:36,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:36,320 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:36:36,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:36,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:36,323 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:36,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:36,323 INFO L82 PathProgramCache]: Analyzing trace with hash 982357192, now seen corresponding path program 1 times [2019-01-14 04:36:36,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:36,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:36,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:36,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:36,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:36,413 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:36:36,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:36,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:36,414 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:36,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:36,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:36,415 INFO L87 Difference]: Start difference. First operand 323 states and 472 transitions. cyclomatic complexity: 150 Second operand 3 states. [2019-01-14 04:36:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:36,564 INFO L93 Difference]: Finished difference Result 393 states and 571 transitions. [2019-01-14 04:36:36,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:36,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 393 states and 571 transitions. [2019-01-14 04:36:36,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 359 [2019-01-14 04:36:36,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 393 states to 393 states and 571 transitions. [2019-01-14 04:36:36,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 393 [2019-01-14 04:36:36,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 393 [2019-01-14 04:36:36,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 393 states and 571 transitions. [2019-01-14 04:36:36,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:36,575 INFO L706 BuchiCegarLoop]: Abstraction has 393 states and 571 transitions. [2019-01-14 04:36:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states and 571 transitions. [2019-01-14 04:36:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2019-01-14 04:36:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-14 04:36:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 571 transitions. [2019-01-14 04:36:36,588 INFO L729 BuchiCegarLoop]: Abstraction has 393 states and 571 transitions. [2019-01-14 04:36:36,589 INFO L609 BuchiCegarLoop]: Abstraction has 393 states and 571 transitions. [2019-01-14 04:36:36,589 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-14 04:36:36,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 393 states and 571 transitions. [2019-01-14 04:36:36,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 359 [2019-01-14 04:36:36,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:36,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:36,598 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:36,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:36,599 INFO L794 eck$LassoCheckResult]: Stem: 5639#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 5554#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 5555#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5594#L202 assume 1 == ~b0_req_up~0; 5598#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 5607#L127-2 ~b0_req_up~0 := 0; 5585#L202-1 assume 1 == ~b1_req_up~0; 5571#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 5563#L142-2 ~b1_req_up~0 := 0; 5564#L209 assume 1 == ~d0_req_up~0; 5621#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 5619#L157-2 ~d0_req_up~0 := 0; 5590#L216 assume 1 == ~d1_req_up~0; 5588#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 5586#L172-2 ~d1_req_up~0 := 0; 5587#L223 assume !(1 == ~z_req_up~0); 5537#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 5538#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 5624#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 5636#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5545#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 5546#L326-1 assume !(0 == ~z_ev~0); 5591#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 5610#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5614#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5569#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 5570#L380 assume !(0 != activate_threads_~tmp~1); 5627#L380-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5629#L344-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5635#L349-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 5541#L354-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 5542#L359-1 assume !(1 == ~z_ev~0); 5580#L422-1 [2019-01-14 04:36:36,599 INFO L796 eck$LassoCheckResult]: Loop: 5580#L422-1 assume !false; 5602#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 5543#L285 assume !false; 5544#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 5597#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5595#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5556#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 5557#L280 assume !(0 != eval_~tmp___0~0); 5601#L301 start_simulation_~kernel_st~0 := 2; 5583#L202-2 assume !(1 == ~b0_req_up~0); 5581#L202-3 assume !(1 == ~b1_req_up~0); 5582#L209-1 assume !(1 == ~d0_req_up~0); 5697#L216-1 assume !(1 == ~d1_req_up~0); 5694#L223-1 assume !(1 == ~z_req_up~0); 5690#L230-1 start_simulation_~kernel_st~0 := 3; 5687#L311-2 assume !(0 == ~b0_ev~0); 5684#L311-4 assume !(0 == ~b1_ev~0); 5680#L316-3 assume !(0 == ~d0_ev~0); 5677#L321-3 assume !(0 == ~d1_ev~0); 5676#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 5674#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 5672#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5664#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5662#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 5660#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5657#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5654#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5650#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 5643#L354-3 assume !(1 == ~d1_ev~0); 5553#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 5573#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 5599#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5592#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5593#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 5604#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5605#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 5623#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 5579#L439 assume !(0 != start_simulation_~tmp~3); 5580#L422-1 [2019-01-14 04:36:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1660067017, now seen corresponding path program 1 times [2019-01-14 04:36:36,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:36,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:36,744 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:36:36,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:36,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:36,745 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:36,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1405059018, now seen corresponding path program 1 times [2019-01-14 04:36:36,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:36,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:36,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:36,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:36,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:36,827 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:36:36,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:36,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:36,828 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:36,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:36:36,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:36:36,829 INFO L87 Difference]: Start difference. First operand 393 states and 571 transitions. cyclomatic complexity: 179 Second operand 5 states. [2019-01-14 04:36:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:37,062 INFO L93 Difference]: Finished difference Result 647 states and 939 transitions. [2019-01-14 04:36:37,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:36:37,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 647 states and 939 transitions. [2019-01-14 04:36:37,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 613 [2019-01-14 04:36:37,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 647 states to 647 states and 939 transitions. [2019-01-14 04:36:37,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 647 [2019-01-14 04:36:37,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 647 [2019-01-14 04:36:37,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 647 states and 939 transitions. [2019-01-14 04:36:37,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:37,078 INFO L706 BuchiCegarLoop]: Abstraction has 647 states and 939 transitions. [2019-01-14 04:36:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states and 939 transitions. [2019-01-14 04:36:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 393. [2019-01-14 04:36:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-14 04:36:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 555 transitions. [2019-01-14 04:36:37,094 INFO L729 BuchiCegarLoop]: Abstraction has 393 states and 555 transitions. [2019-01-14 04:36:37,094 INFO L609 BuchiCegarLoop]: Abstraction has 393 states and 555 transitions. [2019-01-14 04:36:37,094 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-14 04:36:37,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 393 states and 555 transitions. [2019-01-14 04:36:37,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 359 [2019-01-14 04:36:37,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:37,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:37,102 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:37,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:37,106 INFO L794 eck$LassoCheckResult]: Stem: 6698#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 6610#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 6611#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6652#L202 assume 1 == ~b0_req_up~0; 6657#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 6665#L127-2 ~b0_req_up~0 := 0; 6642#L202-1 assume 1 == ~b1_req_up~0; 6627#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 6621#L142-2 ~b1_req_up~0 := 0; 6622#L209 assume 1 == ~d0_req_up~0; 6680#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 6677#L157-2 ~d0_req_up~0 := 0; 6648#L216 assume 1 == ~d1_req_up~0; 6645#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 6643#L172-2 ~d1_req_up~0 := 0; 6644#L223 assume !(1 == ~z_req_up~0); 6592#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 6593#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 6683#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 6693#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 6603#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 6604#L326-1 assume !(0 == ~z_ev~0); 6649#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 6668#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 6672#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 6625#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 6626#L380 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 6686#L380-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 6688#L344-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 6692#L349-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 6596#L354-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 6597#L359-1 assume !(1 == ~z_ev~0); 6636#L422-1 [2019-01-14 04:36:37,107 INFO L796 eck$LassoCheckResult]: Loop: 6636#L422-1 assume !false; 6660#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 6598#L285 assume !false; 6599#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 6655#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 6653#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 6612#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 6613#L280 assume !(0 != eval_~tmp___0~0); 6659#L301 start_simulation_~kernel_st~0 := 2; 6639#L202-2 assume !(1 == ~b0_req_up~0); 6641#L202-3 assume !(1 == ~b1_req_up~0); 6818#L209-1 assume !(1 == ~d0_req_up~0); 6813#L216-1 assume !(1 == ~d1_req_up~0); 6809#L223-1 assume !(1 == ~z_req_up~0); 6806#L230-1 start_simulation_~kernel_st~0 := 3; 6803#L311-2 assume !(0 == ~b0_ev~0); 6800#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 6801#L316-3 assume !(0 == ~d0_ev~0); 6805#L321-3 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 6787#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 6733#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 6727#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 6728#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 6735#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 6731#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 6718#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 6711#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 6710#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 6608#L354-3 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 6609#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 6628#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 6656#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 6650#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 6651#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 6662#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6663#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 6682#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 6635#L439 assume !(0 != start_simulation_~tmp~3); 6636#L422-1 [2019-01-14 04:36:37,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:37,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325319, now seen corresponding path program 1 times [2019-01-14 04:36:37,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:37,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:37,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:37,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:37,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:37,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:37,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1898087536, now seen corresponding path program 1 times [2019-01-14 04:36:37,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:37,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:37,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:37,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:37,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:37,424 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:36:37,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:37,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:36:37,425 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:37,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:36:37,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:36:37,431 INFO L87 Difference]: Start difference. First operand 393 states and 555 transitions. cyclomatic complexity: 163 Second operand 5 states. [2019-01-14 04:36:37,797 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:36:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:38,260 INFO L93 Difference]: Finished difference Result 426 states and 602 transitions. [2019-01-14 04:36:38,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:36:38,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 426 states and 602 transitions. [2019-01-14 04:36:38,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 392 [2019-01-14 04:36:38,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 426 states to 426 states and 602 transitions. [2019-01-14 04:36:38,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 426 [2019-01-14 04:36:38,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 426 [2019-01-14 04:36:38,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 426 states and 602 transitions. [2019-01-14 04:36:38,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:36:38,279 INFO L706 BuchiCegarLoop]: Abstraction has 426 states and 602 transitions. [2019-01-14 04:36:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states and 602 transitions. [2019-01-14 04:36:38,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 396. [2019-01-14 04:36:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-01-14 04:36:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 558 transitions. [2019-01-14 04:36:38,290 INFO L729 BuchiCegarLoop]: Abstraction has 396 states and 558 transitions. [2019-01-14 04:36:38,290 INFO L609 BuchiCegarLoop]: Abstraction has 396 states and 558 transitions. [2019-01-14 04:36:38,290 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2019-01-14 04:36:38,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 558 transitions. [2019-01-14 04:36:38,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 362 [2019-01-14 04:36:38,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:38,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:38,296 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:38,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:38,297 INFO L794 eck$LassoCheckResult]: Stem: 7529#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 7444#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 7445#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 7485#L202 assume 1 == ~b0_req_up~0; 7491#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 7499#L127-2 ~b0_req_up~0 := 0; 7476#L202-1 assume 1 == ~b1_req_up~0; 7461#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 7455#L142-2 ~b1_req_up~0 := 0; 7456#L209 assume 1 == ~d0_req_up~0; 7514#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 7512#L157-2 ~d0_req_up~0 := 0; 7481#L216 assume 1 == ~d1_req_up~0; 7479#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 7477#L172-2 ~d1_req_up~0 := 0; 7478#L223 assume !(1 == ~z_req_up~0); 7427#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 7428#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 7517#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 7526#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 7435#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 7436#L326-1 assume !(0 == ~z_ev~0); 7482#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 7502#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 7507#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 7459#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 7460#L380 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 7520#L380-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 7521#L344-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 7525#L349-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 7431#L354-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 7432#L359-1 assume !(1 == ~z_ev~0); 7470#L422-1 [2019-01-14 04:36:38,302 INFO L796 eck$LassoCheckResult]: Loop: 7470#L422-1 assume !false; 7494#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 7433#L285 assume !false; 7434#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 7489#L258 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 7486#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 7487#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 7543#L280 assume !(0 != eval_~tmp___0~0); 7493#L301 start_simulation_~kernel_st~0 := 2; 7473#L202-2 assume !(1 == ~b0_req_up~0); 7475#L202-3 assume !(1 == ~b1_req_up~0); 7664#L209-1 assume !(1 == ~d0_req_up~0); 7660#L216-1 assume !(1 == ~d1_req_up~0); 7661#L223-1 assume !(1 == ~z_req_up~0); 7668#L230-1 start_simulation_~kernel_st~0 := 3; 7623#L311-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 7624#L311-4 assume !(0 == ~b1_ev~0); 7719#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 7718#L321-3 assume !(0 == ~d1_ev~0); 7716#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 7713#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 7589#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 7587#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 7585#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 7581#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 7553#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 7547#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 7544#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 7542#L354-3 assume !(1 == ~d1_ev~0); 7443#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 7462#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 7490#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 7483#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 7484#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 7496#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 7497#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 7516#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 7469#L439 assume !(0 != start_simulation_~tmp~3); 7470#L422-1 [2019-01-14 04:36:38,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:38,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325319, now seen corresponding path program 2 times [2019-01-14 04:36:38,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:38,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:38,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:38,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:38,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:38,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:38,332 INFO L82 PathProgramCache]: Analyzing trace with hash 543812228, now seen corresponding path program 1 times [2019-01-14 04:36:38,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:38,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:38,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:38,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:38,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:38,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:38,357 INFO L82 PathProgramCache]: Analyzing trace with hash -877632900, now seen corresponding path program 1 times [2019-01-14 04:36:38,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:38,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:38,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:38,428 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:36:38,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:38,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:38,837 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-01-14 04:36:38,956 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:36:38,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:36:38,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:36:38,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:36:38,958 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:36:38,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:36:38,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:36:38,959 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:36:38,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: bist_cell_true-unreach-call_false-termination.cil.c_Iteration20_Loop [2019-01-14 04:36:38,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:36:38,959 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:36:38,991 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:36:39,028 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:36:39,034 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:36:39,051 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:36:39,058 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:36:39,061 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:36:39,066 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:36:39,072 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:36:39,075 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:36:39,079 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:36:39,085 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:36:39,089 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:36:39,092 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:36:39,100 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:36:39,104 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:36:39,116 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:36:39,119 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:36:39,126 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:36:39,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:36:39,135 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:36:39,143 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:36:39,146 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:36:39,148 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:36:39,552 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:36:39,553 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:36:39,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:36:39,578 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:36:39,604 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:36:39,605 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d1_ev~0=-5} Honda state: {~d1_ev~0=-5} 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:36:39,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:36:39,657 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:36:39,672 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:36:39,672 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_~__retres2~0=0} Honda state: {ULTIMATE.start_stop_simulation_~__retres2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:36:39,735 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:36:39,735 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 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) [2019-01-14 04:36:39,806 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:36:39,806 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:36:39,828 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:36:39,867 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:36:39,867 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:36:39,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:36:39,868 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:36:39,868 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:36:39,868 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:36:39,868 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:36:39,868 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:36:39,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: bist_cell_true-unreach-call_false-termination.cil.c_Iteration20_Loop [2019-01-14 04:36:39,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:36:39,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:36:39,880 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:36:39,920 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:36:39,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:36:39,975 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:36:39,984 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:36:39,994 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:36:40,000 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:36:40,013 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:36:40,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:36:40,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:36:40,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:36:40,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:36:40,043 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:36:40,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:36:40,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:36:40,069 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:36:40,072 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:36:40,085 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:36:40,093 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:36:40,098 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:36:40,110 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:36:40,113 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:36:40,116 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:36:40,262 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:36:41,037 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:36:41,161 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:36:41,199 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:36:41,207 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:36:41,210 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:36:41,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:36:41,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:36:41,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:36:41,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:36:41,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:36:41,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:36:41,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:36:41,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:36:41,220 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:36:41,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:36:41,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:36:41,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:36:41,221 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:36:41,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:36:41,222 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:36:41,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:36:41,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:36:41,224 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:36:41,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:36:41,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:36:41,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:36:41,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:36:41,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:36:41,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:36:41,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:36:41,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:36:41,233 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:36:41,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:36:41,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:36:41,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:36:41,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:36:41,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:36:41,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:36:41,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:36:41,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:36:41,243 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:36:41,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:36:41,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:36:41,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:36:41,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:36:41,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:36:41,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:36:41,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:36:41,257 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:36:41,267 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:36:41,268 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:36:41,272 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:36:41,273 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:36:41,273 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:36:41,273 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~b0_ev~0) = -1*~b0_ev~0 + 1 Supporting invariants [] [2019-01-14 04:36:41,274 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:36:41,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:41,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:36:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:41,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:36:41,567 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:36:41,572 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:36:41,573 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 396 states and 558 transitions. cyclomatic complexity: 163 Second operand 5 states. [2019-01-14 04:36:41,705 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 396 states and 558 transitions. cyclomatic complexity: 163. Second operand 5 states. Result 1350 states and 1928 transitions. Complement of second has 5 states. [2019-01-14 04:36:41,713 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:36:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:36:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2019-01-14 04:36:41,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 252 transitions. Stem has 32 letters. Loop has 38 letters. [2019-01-14 04:36:41,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:36:41,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 252 transitions. Stem has 70 letters. Loop has 38 letters. [2019-01-14 04:36:41,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:36:41,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 252 transitions. Stem has 32 letters. Loop has 76 letters. [2019-01-14 04:36:41,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:36:41,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1350 states and 1928 transitions. [2019-01-14 04:36:41,751 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 937 [2019-01-14 04:36:41,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1350 states to 1278 states and 1828 transitions. [2019-01-14 04:36:41,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 972 [2019-01-14 04:36:41,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 977 [2019-01-14 04:36:41,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1278 states and 1828 transitions. [2019-01-14 04:36:41,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:36:41,767 INFO L706 BuchiCegarLoop]: Abstraction has 1278 states and 1828 transitions. [2019-01-14 04:36:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states and 1828 transitions. [2019-01-14 04:36:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 911. [2019-01-14 04:36:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-01-14 04:36:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1301 transitions. [2019-01-14 04:36:41,805 INFO L729 BuchiCegarLoop]: Abstraction has 911 states and 1301 transitions. [2019-01-14 04:36:41,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:41,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:41,808 INFO L87 Difference]: Start difference. First operand 911 states and 1301 transitions. Second operand 3 states. [2019-01-14 04:36:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:42,015 INFO L93 Difference]: Finished difference Result 969 states and 1379 transitions. [2019-01-14 04:36:42,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:42,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 969 states and 1379 transitions. [2019-01-14 04:36:42,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 613 [2019-01-14 04:36:42,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 969 states to 969 states and 1379 transitions. [2019-01-14 04:36:42,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 648 [2019-01-14 04:36:42,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 648 [2019-01-14 04:36:42,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 969 states and 1379 transitions. [2019-01-14 04:36:42,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:36:42,038 INFO L706 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2019-01-14 04:36:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states and 1379 transitions. [2019-01-14 04:36:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2019-01-14 04:36:42,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-01-14 04:36:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1379 transitions. [2019-01-14 04:36:42,065 INFO L729 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2019-01-14 04:36:42,065 INFO L609 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2019-01-14 04:36:42,065 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2019-01-14 04:36:42,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 969 states and 1379 transitions. [2019-01-14 04:36:42,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 613 [2019-01-14 04:36:42,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:42,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:42,080 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:42,080 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:42,080 INFO L794 eck$LassoCheckResult]: Stem: 11480#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 11317#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 11318#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 11392#L202 assume 1 == ~b0_req_up~0; 11402#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 11422#L127-2 ~b0_req_up~0 := 0; 11375#L202-1 assume 1 == ~b1_req_up~0; 11345#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 11333#L142-2 ~b1_req_up~0 := 0; 11334#L209 assume 1 == ~d0_req_up~0; 11450#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 11446#L157-2 ~d0_req_up~0 := 0; 11386#L216 assume 1 == ~d1_req_up~0; 11378#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 11376#L172-2 ~d1_req_up~0 := 0; 11377#L223 assume !(1 == ~z_req_up~0); 11288#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 11289#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 11457#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 11472#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 11300#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 11301#L326-1 assume !(0 == ~z_ev~0); 11387#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 11427#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 11435#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 11343#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 11344#L380 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 11462#L380-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 11465#L344-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 11471#L349-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 11294#L354-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 11295#L359-1 assume 1 == ~z_ev~0;~z_ev~0 := 2; 11384#L422-1 [2019-01-14 04:36:42,086 INFO L796 eck$LassoCheckResult]: Loop: 11384#L422-1 assume !false; 11413#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 11296#L285 assume !false; 11297#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 11512#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 11513#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11527#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 11528#L280 assume 0 != eval_~tmp___0~0; 11509#L280-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 11510#L289 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 11428#L42 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 11324#L42-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 11396#L51 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 11876#L63-2 assume !(0 != method1_~s2~0);method1_~s2~0 := 0; 11445#L69 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 11360#L81-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 11868#L285 assume !false; 11867#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 11866#L258 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 11865#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11864#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 11862#L280 assume !(0 != eval_~tmp___0~0); 11861#L301 start_simulation_~kernel_st~0 := 2; 11370#L202-2 assume !(1 == ~b0_req_up~0); 11372#L202-3 assume !(1 == ~b1_req_up~0); 11853#L209-1 assume !(1 == ~d0_req_up~0); 11840#L216-1 assume !(1 == ~d1_req_up~0); 11834#L223-1 assume !(1 == ~z_req_up~0); 11831#L230-1 start_simulation_~kernel_st~0 := 3; 11828#L311-2 assume !(0 == ~b0_ev~0); 11824#L311-4 assume !(0 == ~b1_ev~0); 11820#L316-3 assume !(0 == ~d0_ev~0); 11816#L321-3 assume !(0 == ~d1_ev~0); 11814#L326-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 11812#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 11809#L97-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 11810#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 12002#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 12000#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 11996#L380-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 11784#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 11783#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 11766#L354-3 assume !(1 == ~d1_ev~0); 11767#L359-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 11759#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 11760#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 11388#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11389#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 11417#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11418#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 11751#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 11752#L439 assume !(0 != start_simulation_~tmp~3); 11384#L422-1 [2019-01-14 04:36:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:42,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325321, now seen corresponding path program 1 times [2019-01-14 04:36:42,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:42,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:42,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:42,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:42,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:42,204 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:36:42,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:42,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:36:42,205 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:36:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:42,205 INFO L82 PathProgramCache]: Analyzing trace with hash -696899428, now seen corresponding path program 1 times [2019-01-14 04:36:42,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:42,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:42,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:42,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:42,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:36:42,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:42,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:36:42,425 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:42,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:42,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:42,429 INFO L87 Difference]: Start difference. First operand 969 states and 1379 transitions. cyclomatic complexity: 413 Second operand 3 states. [2019-01-14 04:36:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:42,694 INFO L93 Difference]: Finished difference Result 1921 states and 2691 transitions. [2019-01-14 04:36:42,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:42,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1921 states and 2691 transitions. [2019-01-14 04:36:42,721 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1226 [2019-01-14 04:36:42,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1921 states to 1921 states and 2691 transitions. [2019-01-14 04:36:42,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2019-01-14 04:36:42,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2019-01-14 04:36:42,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1921 states and 2691 transitions. [2019-01-14 04:36:42,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:36:42,746 INFO L706 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2019-01-14 04:36:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states and 2691 transitions. [2019-01-14 04:36:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1921. [2019-01-14 04:36:42,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2019-01-14 04:36:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2691 transitions. [2019-01-14 04:36:42,809 INFO L729 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2019-01-14 04:36:42,809 INFO L609 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2019-01-14 04:36:42,809 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2019-01-14 04:36:42,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1921 states and 2691 transitions. [2019-01-14 04:36:42,831 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1226 [2019-01-14 04:36:42,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:42,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:42,833 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:42,833 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:42,833 INFO L794 eck$LassoCheckResult]: Stem: 14381#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 14216#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 14217#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 14292#L202 assume 1 == ~b0_req_up~0; 14305#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 14323#L127-2 ~b0_req_up~0 := 0; 14276#L202-1 assume 1 == ~b1_req_up~0; 14244#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 14236#L142-2 ~b1_req_up~0 := 0; 14237#L209 assume 1 == ~d0_req_up~0; 14350#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 14345#L157-2 ~d0_req_up~0 := 0; 14286#L216 assume 1 == ~d1_req_up~0; 14279#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 14277#L172-2 ~d1_req_up~0 := 0; 14278#L223 assume !(1 == ~z_req_up~0); 14186#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 14187#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 14358#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 14375#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 14198#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 14199#L326-1 assume !(0 == ~z_ev~0); 14287#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 14601#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 14600#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 14599#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 14598#L380 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 14597#L380-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 14596#L344-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 14595#L349-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 14594#L354-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 14593#L359-1 assume !(1 == ~z_ev~0); 14583#L422-1 assume !false; 14584#L423 [2019-01-14 04:36:42,834 INFO L796 eck$LassoCheckResult]: Loop: 14584#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 15355#L285 assume !false; 15364#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 15362#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 15321#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 15361#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 15359#L280 assume 0 != eval_~tmp___0~0; 15357#L280-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 15328#L289 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 15351#L42 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 15345#L42-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 15341#L51 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 15339#L63-2 assume !(0 != method1_~s2~0);method1_~s2~0 := 0; 15336#L69 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 15326#L81-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 15324#L285 assume !false; 15323#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 15320#L258 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 15319#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 15317#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 15315#L280 assume !(0 != eval_~tmp___0~0); 15313#L301 start_simulation_~kernel_st~0 := 2; 15311#L202-2 assume !(1 == ~b0_req_up~0); 15312#L202-3 assume !(1 == ~b1_req_up~0); 15439#L209-1 assume !(1 == ~d0_req_up~0); 15436#L216-1 assume !(1 == ~d1_req_up~0); 15398#L223-1 assume !(1 == ~z_req_up~0); 15395#L230-1 start_simulation_~kernel_st~0 := 3; 15392#L311-2 assume !(0 == ~b0_ev~0); 15389#L311-4 assume !(0 == ~b1_ev~0); 15387#L316-3 assume !(0 == ~d0_ev~0); 15384#L321-3 assume !(0 == ~d1_ev~0); 15383#L326-3 assume !(0 == ~z_ev~0); 15381#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 15379#L97-1 assume !(1 == ~b0_ev~0); 15376#L101-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 15377#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 15499#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 15498#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 15497#L380-5 assume !(1 == ~b0_ev~0); 15492#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 15490#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 15393#L354-3 assume !(1 == ~d1_ev~0); 15391#L359-3 assume !(1 == ~z_ev~0); 14977#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 15386#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 15348#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 15382#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 15380#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 15378#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 15375#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 15372#L439 assume !(0 != start_simulation_~tmp~3); 15369#L422-1 assume !false; 14584#L423 [2019-01-14 04:36:42,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:42,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 1 times [2019-01-14 04:36:42,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:42,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:42,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:42,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:42,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:42,870 INFO L82 PathProgramCache]: Analyzing trace with hash 100562712, now seen corresponding path program 1 times [2019-01-14 04:36:42,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:42,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:42,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:42,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:42,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:36:43,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:43,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:36:43,077 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:43,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:36:43,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:36:43,078 INFO L87 Difference]: Start difference. First operand 1921 states and 2691 transitions. cyclomatic complexity: 773 Second operand 4 states. [2019-01-14 04:36:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:43,484 INFO L93 Difference]: Finished difference Result 5567 states and 7751 transitions. [2019-01-14 04:36:43,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:36:43,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5567 states and 7751 transitions. [2019-01-14 04:36:43,536 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3618 [2019-01-14 04:36:43,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5567 states to 5567 states and 7751 transitions. [2019-01-14 04:36:43,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3671 [2019-01-14 04:36:43,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3671 [2019-01-14 04:36:43,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5567 states and 7751 transitions. [2019-01-14 04:36:43,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:36:43,594 INFO L706 BuchiCegarLoop]: Abstraction has 5567 states and 7751 transitions. [2019-01-14 04:36:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5567 states and 7751 transitions. [2019-01-14 04:36:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5567 to 1939. [2019-01-14 04:36:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-01-14 04:36:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2709 transitions. [2019-01-14 04:36:43,674 INFO L729 BuchiCegarLoop]: Abstraction has 1939 states and 2709 transitions. [2019-01-14 04:36:43,674 INFO L609 BuchiCegarLoop]: Abstraction has 1939 states and 2709 transitions. [2019-01-14 04:36:43,674 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2019-01-14 04:36:43,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1939 states and 2709 transitions. [2019-01-14 04:36:43,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1238 [2019-01-14 04:36:43,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:43,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:43,690 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:43,691 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:43,693 INFO L794 eck$LassoCheckResult]: Stem: 21896#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 21708#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 21709#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 21787#L202 assume 1 == ~b0_req_up~0; 21802#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 21820#L127-2 ~b0_req_up~0 := 0; 21771#L202-1 assume 1 == ~b1_req_up~0; 21736#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 21728#L142-2 ~b1_req_up~0 := 0; 21729#L209 assume 1 == ~d0_req_up~0; 21854#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 21850#L157-2 ~d0_req_up~0 := 0; 21781#L216 assume 1 == ~d1_req_up~0; 21774#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 21772#L172-2 ~d1_req_up~0 := 0; 21773#L223 assume !(1 == ~z_req_up~0); 21681#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 21682#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 21862#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 21884#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 21697#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 21698#L326-1 assume !(0 == ~z_ev~0); 21782#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 21836#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 21837#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 21734#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 21735#L380 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 21871#L380-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 21872#L344-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 21918#L349-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 21919#L354-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 21779#L359-1 assume !(1 == ~z_ev~0); 21780#L422-1 assume !false; 22117#L423 [2019-01-14 04:36:43,694 INFO L796 eck$LassoCheckResult]: Loop: 22117#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 22661#L285 assume !false; 22666#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 22665#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 22640#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 22664#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 22663#L280 assume 0 != eval_~tmp___0~0; 22662#L280-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 22647#L289 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 22660#L42 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 22658#L42-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 22657#L51 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 22655#L63-2 assume 0 != method1_~s2~0; 22651#L70 assume 0 != method1_~s1~0;method1_~s2~0 := 1; 22649#L69 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 22645#L81-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 22643#L285 assume !false; 22642#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 22639#L258 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 22638#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 22636#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 22634#L280 assume !(0 != eval_~tmp___0~0); 22633#L301 start_simulation_~kernel_st~0 := 2; 22631#L202-2 assume !(1 == ~b0_req_up~0); 22627#L202-3 assume !(1 == ~b1_req_up~0); 22624#L209-1 assume !(1 == ~d0_req_up~0); 22605#L216-1 assume !(1 == ~d1_req_up~0); 22599#L223-1 assume !(1 == ~z_req_up~0); 22600#L230-1 start_simulation_~kernel_st~0 := 3; 22761#L311-2 assume !(0 == ~b0_ev~0); 22759#L311-4 assume !(0 == ~b1_ev~0); 22756#L316-3 assume !(0 == ~d0_ev~0); 22753#L321-3 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 22754#L326-3 assume !(0 == ~z_ev~0); 22823#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 22822#L97-1 assume !(1 == ~b0_ev~0); 22820#L101-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 22821#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 22864#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 22863#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 22861#L380-5 assume !(1 == ~b0_ev~0); 22729#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 22692#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 22690#L354-3 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 22687#L359-3 assume !(1 == ~z_ev~0); 22685#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 22684#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 22680#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 22681#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 22678#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 22676#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 22674#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 22672#L439 assume !(0 != start_simulation_~tmp~3); 22670#L422-1 assume !false; 22117#L423 [2019-01-14 04:36:43,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:43,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 2 times [2019-01-14 04:36:43,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:43,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:43,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:43,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:43,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:43,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:43,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1567847802, now seen corresponding path program 1 times [2019-01-14 04:36:43,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:43,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:43,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:43,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:36:43,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:43,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:36:43,857 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:36:43,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:36:43,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:36:43,858 INFO L87 Difference]: Start difference. First operand 1939 states and 2709 transitions. cyclomatic complexity: 773 Second operand 3 states. [2019-01-14 04:36:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:43,947 INFO L93 Difference]: Finished difference Result 2427 states and 3403 transitions. [2019-01-14 04:36:43,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:36:43,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2427 states and 3403 transitions. [2019-01-14 04:36:43,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1588 [2019-01-14 04:36:43,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2427 states to 2427 states and 3403 transitions. [2019-01-14 04:36:43,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1641 [2019-01-14 04:36:43,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1641 [2019-01-14 04:36:43,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2427 states and 3403 transitions. [2019-01-14 04:36:43,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:36:43,982 INFO L706 BuchiCegarLoop]: Abstraction has 2427 states and 3403 transitions. [2019-01-14 04:36:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states and 3403 transitions. [2019-01-14 04:36:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2295. [2019-01-14 04:36:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2019-01-14 04:36:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 3205 transitions. [2019-01-14 04:36:44,028 INFO L729 BuchiCegarLoop]: Abstraction has 2295 states and 3205 transitions. [2019-01-14 04:36:44,028 INFO L609 BuchiCegarLoop]: Abstraction has 2295 states and 3205 transitions. [2019-01-14 04:36:44,028 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2019-01-14 04:36:44,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2295 states and 3205 transitions. [2019-01-14 04:36:44,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1500 [2019-01-14 04:36:44,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:44,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:44,041 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:44,041 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:44,041 INFO L794 eck$LassoCheckResult]: Stem: 26251#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 26080#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 26081#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 26160#L202 assume 1 == ~b0_req_up~0; 26171#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 26190#L127-2 ~b0_req_up~0 := 0; 26144#L202-1 assume 1 == ~b1_req_up~0; 26108#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 26100#L142-2 ~b1_req_up~0 := 0; 26101#L209 assume 1 == ~d0_req_up~0; 26216#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 26213#L157-2 ~d0_req_up~0 := 0; 26154#L216 assume 1 == ~d1_req_up~0; 26147#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 26145#L172-2 ~d1_req_up~0 := 0; 26146#L223 assume !(1 == ~z_req_up~0); 26053#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 26054#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 26222#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 26241#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 26069#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 26070#L326-1 assume !(0 == ~z_ev~0); 26155#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 26635#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 26634#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 26633#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 26632#L380 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 26631#L380-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 26630#L344-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 26629#L349-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 26628#L354-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 26624#L359-1 assume !(1 == ~z_ev~0); 26302#L422-1 assume !false; 26303#L423 [2019-01-14 04:36:44,042 INFO L796 eck$LassoCheckResult]: Loop: 26303#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 27987#L285 assume !false; 28000#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 27997#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 27101#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 27995#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 27992#L280 assume 0 != eval_~tmp___0~0; 27990#L280-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 27108#L289 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 27794#L42 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 27791#L42-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 27789#L51 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 27786#L63-2 assume 0 != method1_~s2~0; 27778#L70 assume 0 != method1_~s1~0;method1_~s2~0 := 1; 27340#L69 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 27107#L81-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 27105#L285 assume !false; 27103#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 27100#L258 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 27098#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 27096#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 27092#L280 assume !(0 != eval_~tmp___0~0); 27090#L301 start_simulation_~kernel_st~0 := 2; 27082#L202-2 assume !(1 == ~b0_req_up~0); 27078#L202-3 assume !(1 == ~b1_req_up~0); 27075#L209-1 assume !(1 == ~d0_req_up~0); 27067#L216-1 assume !(1 == ~d1_req_up~0); 27061#L223-1 assume 1 == ~z_req_up~0; 27051#L187-3 assume !(~z_val~0 != ~z_val_t~0); 27049#L187-5 ~z_req_up~0 := 0; 27047#L230-1 start_simulation_~kernel_st~0 := 3; 27045#L311-2 assume !(0 == ~b0_ev~0); 27041#L311-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 27042#L316-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 27171#L321-3 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 27172#L326-3 assume !(0 == ~z_ev~0); 28271#L331-3 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 28270#L97-1 assume !(1 == ~b0_ev~0); 26287#L101-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 26288#L119-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 28268#L120-1 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 26204#L380-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 26205#L380-5 assume !(1 == ~b0_ev~0); 26214#L344-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 26244#L349-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 26948#L354-3 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 26109#L359-3 assume !(1 == ~z_ev~0); 26110#L364-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret3, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 28219#L258-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 27126#L265-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 28215#L266-1 stop_simulation_#t~ret3 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret3;havoc stop_simulation_#t~ret3; 28211#L397 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 28042#L404 stop_simulation_#res := stop_simulation_~__retres2~0; 28039#L405 start_simulation_#t~ret4 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret4;havoc start_simulation_#t~ret4; 28008#L439 assume !(0 != start_simulation_~tmp~3); 28005#L422-1 assume !false; 26303#L423 [2019-01-14 04:36:44,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:44,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 3 times [2019-01-14 04:36:44,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:44,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:44,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:44,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:44,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:44,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:44,078 INFO L82 PathProgramCache]: Analyzing trace with hash -543572622, now seen corresponding path program 1 times [2019-01-14 04:36:44,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:44,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:44,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:36:44,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:44,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash 559227473, now seen corresponding path program 1 times [2019-01-14 04:36:44,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:44,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:36:44,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:36:44,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:36:45,619 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 130 DAG size of output: 114 [2019-01-14 04:36:45,841 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-14 04:36:45,843 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:36:45,843 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:36:45,843 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:36:45,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:36:45,844 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:36:45,844 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:36:45,844 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:36:45,844 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:36:45,844 INFO L131 ssoRankerPreferences]: Filename of dumped script: bist_cell_true-unreach-call_false-termination.cil.c_Iteration24_Loop [2019-01-14 04:36:45,844 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:36:45,844 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:36:45,848 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:36:45,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:36:45,884 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:36:45,894 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:36:45,897 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:36:45,910 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:36:45,920 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:36:45,923 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:36:45,927 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:36:45,933 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:36:45,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:36:45,939 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:36:45,943 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:36:45,947 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:36:45,951 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:36:45,956 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:36:45,967 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:36:45,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:36:45,975 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:36:45,979 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:36:45,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:36:45,987 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:36:45,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:36:45,992 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:36:45,995 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:36:46,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:36:46,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:36:46,020 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:36:46,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:36:46,414 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:36:46,414 INFO L412 LassoAnalysis]: Checking for nontermination... 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) [2019-01-14 04:36:46,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:36:46,433 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:36:46,449 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:36:46,449 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~b0_ev~0=-5} Honda state: {~b0_ev~0=-5} 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:36:46,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:36:46,484 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:36:46,491 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:36:46,491 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret3=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret3=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:36:46,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:36:46,517 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:36:46,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:36:46,566 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:36:46,571 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:36:46,590 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:36:46,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:36:46,590 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:36:46,590 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:36:46,590 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:36:46,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:36:46,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:36:46,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:36:46,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: bist_cell_true-unreach-call_false-termination.cil.c_Iteration24_Loop [2019-01-14 04:36:46,591 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:36:46,591 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:36:46,601 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:36:46,633 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:36:46,635 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:36:46,643 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:36:46,646 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:36:46,654 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:36:46,658 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:36:46,660 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:36:46,667 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:36:46,677 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:36:46,680 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:36:46,686 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:36:46,689 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:36:46,692 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:36:46,699 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:36:46,703 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:36:46,733 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:36:46,736 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:36:46,745 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:36:46,752 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:36:46,755 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:36:46,761 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:36:46,765 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:36:46,768 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:36:46,778 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:36:46,782 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:36:46,864 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:36:46,976 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:36:47,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:36:47,420 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:36:47,421 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:36:47,422 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:36:47,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:36:47,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:36:47,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:36:47,429 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:36:47,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:36:47,429 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:36:47,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:36:47,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:36:47,434 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:36:47,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:36:47,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:36:47,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:36:47,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:36:47,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:36:47,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:36:47,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:36:47,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:36:47,440 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:36:47,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:36:47,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:36:47,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:36:47,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:36:47,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:36:47,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:36:47,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:36:47,451 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:36:47,457 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:36:47,457 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:36:47,463 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:36:47,463 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:36:47,464 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:36:47,464 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~d1_ev~0) = -1*~d1_ev~0 + 1 Supporting invariants [] [2019-01-14 04:36:47,464 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:36:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:47,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:36:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:36:47,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:36:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 04:36:47,836 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:36:47,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2295 states and 3205 transitions. cyclomatic complexity: 913 Second operand 5 states. [2019-01-14 04:36:48,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2295 states and 3205 transitions. cyclomatic complexity: 913. Second operand 5 states. Result 6026 states and 8457 transitions. Complement of second has 5 states. [2019-01-14 04:36:48,051 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:36:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:36:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2019-01-14 04:36:48,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 148 transitions. Stem has 33 letters. Loop has 56 letters. [2019-01-14 04:36:48,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:36:48,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 148 transitions. Stem has 89 letters. Loop has 56 letters. [2019-01-14 04:36:48,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:36:48,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 148 transitions. Stem has 33 letters. Loop has 112 letters. [2019-01-14 04:36:48,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:36:48,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6026 states and 8457 transitions. [2019-01-14 04:36:48,085 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2512 [2019-01-14 04:36:48,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6026 states to 5694 states and 7981 transitions. [2019-01-14 04:36:48,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2579 [2019-01-14 04:36:48,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2590 [2019-01-14 04:36:48,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5694 states and 7981 transitions. [2019-01-14 04:36:48,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:36:48,146 INFO L706 BuchiCegarLoop]: Abstraction has 5694 states and 7981 transitions. [2019-01-14 04:36:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5694 states and 7981 transitions. [2019-01-14 04:36:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5694 to 5683. [2019-01-14 04:36:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5683 states. [2019-01-14 04:36:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5683 states to 5683 states and 7970 transitions. [2019-01-14 04:36:48,252 INFO L729 BuchiCegarLoop]: Abstraction has 5683 states and 7970 transitions. [2019-01-14 04:36:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:36:48,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:36:48,253 INFO L87 Difference]: Start difference. First operand 5683 states and 7970 transitions. Second operand 4 states. [2019-01-14 04:36:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:36:48,500 INFO L93 Difference]: Finished difference Result 5683 states and 7952 transitions. [2019-01-14 04:36:48,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:36:48,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5683 states and 7952 transitions. [2019-01-14 04:36:48,533 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2512 [2019-01-14 04:36:48,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5683 states to 5683 states and 7952 transitions. [2019-01-14 04:36:48,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2579 [2019-01-14 04:36:48,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2579 [2019-01-14 04:36:48,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5683 states and 7952 transitions. [2019-01-14 04:36:48,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:36:48,592 INFO L706 BuchiCegarLoop]: Abstraction has 5683 states and 7952 transitions. [2019-01-14 04:36:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5683 states and 7952 transitions. [2019-01-14 04:36:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5683 to 5683. [2019-01-14 04:36:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5683 states. [2019-01-14 04:36:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5683 states to 5683 states and 7952 transitions. [2019-01-14 04:36:48,760 INFO L729 BuchiCegarLoop]: Abstraction has 5683 states and 7952 transitions. [2019-01-14 04:36:48,760 INFO L609 BuchiCegarLoop]: Abstraction has 5683 states and 7952 transitions. [2019-01-14 04:36:48,760 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2019-01-14 04:36:48,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5683 states and 7952 transitions. [2019-01-14 04:36:48,794 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2512 [2019-01-14 04:36:48,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:36:48,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:36:48,799 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:48,799 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:36:48,802 INFO L794 eck$LassoCheckResult]: Stem: 46230#ULTIMATE.startENTRY ~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 46060#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 46061#L480 havoc start_simulation_#t~ret4, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 46140#L202 assume 1 == ~b0_req_up~0; 46150#L127 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 46168#L127-2 ~b0_req_up~0 := 0; 46123#L202-1 assume 1 == ~b1_req_up~0; 46088#L142 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 46080#L142-2 ~b1_req_up~0 := 0; 46081#L209 assume 1 == ~d0_req_up~0; 46198#L157 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 46194#L157-2 ~d0_req_up~0 := 0; 46134#L216 assume 1 == ~d1_req_up~0; 46126#L172 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 46124#L172-2 ~d1_req_up~0 := 0; 46125#L223 assume !(1 == ~z_req_up~0); 46033#L230 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 46034#L245-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 46204#L311-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 46223#L316-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 46049#L321-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 46050#L326-1 assume !(0 == ~z_ev~0); 46135#L331-1 havoc activate_threads_#t~ret2, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 46173#L97 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 46183#L119 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 46184#L120 activate_threads_#t~ret2 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret2;havoc activate_threads_#t~ret2; 46209#L380 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 46210#L380-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 46221#L344-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 46222#L349-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 46246#L354-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 46132#L359-1 assume !(1 == ~z_ev~0); 46133#L422-1 assume !false; 47585#L423 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 49815#L285 [2019-01-14 04:36:48,802 INFO L796 eck$LassoCheckResult]: Loop: 49815#L285 assume !false; 49826#L276 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 49824#L258 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 49705#L265 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 49821#L266 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret0;havoc eval_#t~ret0; 49819#L280 assume 0 != eval_~tmp___0~0; 49817#L280-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 49713#L289 assume !(0 != eval_~tmp~0); 49815#L285 [2019-01-14 04:36:48,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:48,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1082183973, now seen corresponding path program 1 times [2019-01-14 04:36:48,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:48,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:48,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1768213899, now seen corresponding path program 1 times [2019-01-14 04:36:48,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:48,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:48,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:48,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:48,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:48,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:36:48,967 INFO L82 PathProgramCache]: Analyzing trace with hash -937655707, now seen corresponding path program 1 times [2019-01-14 04:36:48,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:36:48,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:36:48,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:48,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:36:48,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:36:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:36:49,372 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-14 04:36:49,554 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 04:36:50,380 WARN L181 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 142 [2019-01-14 04:36:50,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:36:50 BoogieIcfgContainer [2019-01-14 04:36:50,490 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:36:50,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:36:50,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:36:50,493 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:36:50,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:36:31" (3/4) ... [2019-01-14 04:36:50,498 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:36:50,592 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:36:50,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:36:50,593 INFO L168 Benchmark]: Toolchain (without parser) took 21112.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -140.9 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:36:50,597 INFO L168 Benchmark]: CDTParser took 0.20 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:36:50,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 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:36:50,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.04 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:36:50,599 INFO L168 Benchmark]: Boogie Preprocessor took 150.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:36:50,599 INFO L168 Benchmark]: RCFGBuilder took 1117.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:36:50,599 INFO L168 Benchmark]: BuchiAutomizer took 19119.56 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.8 MB). Peak memory consumption was 135.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:36:50,600 INFO L168 Benchmark]: Witness Printer took 102.20 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:36:50,607 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.20 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 530.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 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 86.04 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 150.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1117.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19119.56 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.8 MB). Peak memory consumption was 135.0 MB. Max. memory is 11.5 GB. * Witness Printer took 102.20 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 26 terminating modules (24 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * b0_ev + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * d1_ev + 1 and consists of 3 locations. 24 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 5683 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.0s and 25 iterations. TraceHistogramMax:2. Analysis of lassos took 12.6s. Construction of modules took 2.8s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 19. Minimization of nondet autom 7. Automata minimization 0.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 4422 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 5683 states and ocurred in iteration 24. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/6 HoareTripleCheckerStatistics: 4145 SDtfs, 1728 SDslu, 4013 SDs, 0 SdLazy, 302 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT2 SILN0 SILU0 SILI19 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital106 mio100 ax100 hnf100 lsp10 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp57 tf109 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 275]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@233ac95b=0, b1_val_t=1, \result=0, d0_val=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@632fd3e4=0, __retres1=1, z_val=0, tmp=0, b0_val_t=1, kernel_st=1, d1_ev=2, comp_m1_i=0, b1_val=1, d1_req_up=0, tmp___0=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7bae9d76=0, z_val_t=0, b1_req_up=0, __retres1=1, d0_ev=2, z_ev=2, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3863434c=0, b1_ev=2, comp_m1_st=0, b0_req_up=0, z_req_up=0, \result=1, d1_val=1, b0_ev=2, tmp=1, d0_val_t=1, d1_val_t=1, b0_val=1, __retres1=0, d0_req_up=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 275]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int b0_val ; [L15] int b0_val_t ; [L16] int b0_ev ; [L17] int b0_req_up ; [L18] int b1_val ; [L19] int b1_val_t ; [L20] int b1_ev ; [L21] int b1_req_up ; [L22] int d0_val ; [L23] int d0_val_t ; [L24] int d0_ev ; [L25] int d0_req_up ; [L26] int d1_val ; [L27] int d1_val_t ; [L28] int d1_ev ; [L29] int d1_req_up ; [L30] int z_val ; [L31] int z_val_t ; [L32] int z_ev ; [L33] int z_req_up ; [L34] int comp_m1_st ; [L35] int comp_m1_i ; [L484] int __retres1 ; [L455] b0_val = 0 [L456] b0_ev = 2 [L457] b0_req_up = 0 [L458] b1_val = 0 [L459] b1_ev = 2 [L460] b1_req_up = 0 [L461] d0_val = 0 [L462] d0_ev = 2 [L463] d0_req_up = 0 [L464] d1_val = 0 [L465] d1_ev = 2 [L466] d1_req_up = 0 [L467] z_val = 0 [L468] z_ev = 2 [L469] z_req_up = 0 [L470] b0_val_t = 1 [L471] b0_req_up = 1 [L472] b1_val_t = 1 [L473] b1_req_up = 1 [L474] d0_val_t = 1 [L475] d0_req_up = 1 [L476] d1_val_t = 1 [L477] d1_req_up = 1 [L478] comp_m1_i = 0 [L409] int kernel_st ; [L410] int tmp ; [L414] kernel_st = 0 [L202] COND TRUE (int )b0_req_up == 1 [L127] COND TRUE (int )b0_val != (int )b0_val_t [L128] b0_val = b0_val_t [L129] b0_ev = 0 [L133] b0_req_up = 0 [L209] COND TRUE (int )b1_req_up == 1 [L142] COND TRUE (int )b1_val != (int )b1_val_t [L143] b1_val = b1_val_t [L144] b1_ev = 0 [L148] b1_req_up = 0 [L216] COND TRUE (int )d0_req_up == 1 [L157] COND TRUE (int )d0_val != (int )d0_val_t [L158] d0_val = d0_val_t [L159] d0_ev = 0 [L163] d0_req_up = 0 [L223] COND TRUE (int )d1_req_up == 1 [L172] COND TRUE (int )d1_val != (int )d1_val_t [L173] d1_val = d1_val_t [L174] d1_ev = 0 [L178] d1_req_up = 0 [L230] COND FALSE !((int )z_req_up == 1) [L245] COND FALSE !((int )comp_m1_i == 1) [L248] comp_m1_st = 2 [L311] COND TRUE (int )b0_ev == 0 [L312] b0_ev = 1 [L316] COND TRUE (int )b1_ev == 0 [L317] b1_ev = 1 [L321] COND TRUE (int )d0_ev == 0 [L322] d0_ev = 1 [L326] COND TRUE (int )d1_ev == 0 [L327] d1_ev = 1 [L331] COND FALSE !((int )z_ev == 0) [L374] int tmp ; [L94] int __retres1 ; [L97] COND TRUE (int )b0_ev == 1 [L98] __retres1 = 1 [L120] return (__retres1); [L378] tmp = is_method1_triggered() [L380] COND TRUE \read(tmp) [L381] comp_m1_st = 0 [L344] COND TRUE (int )b0_ev == 1 [L345] b0_ev = 2 [L349] COND TRUE (int )b1_ev == 1 [L350] b1_ev = 2 [L354] COND TRUE (int )d0_ev == 1 [L355] d0_ev = 2 [L359] COND TRUE (int )d1_ev == 1 [L360] d1_ev = 2 [L364] COND FALSE !((int )z_ev == 1) [L422] COND TRUE 1 [L425] kernel_st = 1 [L270] int tmp ; [L271] int tmp___0 ; Loop: [L275] COND TRUE 1 [L255] int __retres1 ; [L258] COND TRUE (int )comp_m1_st == 0 [L259] __retres1 = 1 [L266] return (__retres1); [L278] tmp___0 = exists_runnable_thread() [L280] COND TRUE \read(tmp___0) [L285] COND TRUE (int )comp_m1_st == 0 [L287] tmp = __VERIFIER_nondet_int() [L289] COND FALSE !(\read(tmp)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...