java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_100.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:09:07,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:09:07,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:09:07,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:09:07,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:09:07,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:09:07,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:09:07,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:09:07,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:09:07,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:09:07,699 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:09:07,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:09:07,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:09:07,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:09:07,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:09:07,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:09:07,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:09:07,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:09:07,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:09:07,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:09:07,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:09:07,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:09:07,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:09:07,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:09:07,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:09:07,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:09:07,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:09:07,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:09:07,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:09:07,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:09:07,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:09:07,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:09:07,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:09:07,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:09:07,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:09:07,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:09:07,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:09:07,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:09:07,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:09:07,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:09:07,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:09:07,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:09:07,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:09:07,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:09:07,789 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:09:07,790 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:09:07,791 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_100.bpl [2019-08-05 10:09:07,791 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_100.bpl' [2019-08-05 10:09:07,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:09:07,910 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:09:07,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:09:07,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:09:07,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:09:07,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:07" (1/1) ... [2019-08-05 10:09:07,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:07" (1/1) ... [2019-08-05 10:09:07,980 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:09:07,981 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:09:07,981 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:09:07,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:09:07,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:09:07,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:09:07,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:09:07,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:07" (1/1) ... [2019-08-05 10:09:07,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:07" (1/1) ... [2019-08-05 10:09:08,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:07" (1/1) ... [2019-08-05 10:09:08,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:07" (1/1) ... [2019-08-05 10:09:08,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:07" (1/1) ... [2019-08-05 10:09:08,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:07" (1/1) ... [2019-08-05 10:09:08,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:07" (1/1) ... [2019-08-05 10:09:08,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:09:08,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:09:08,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:09:08,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:09:08,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:07" (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-08-05 10:09:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:09:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_time [2019-08-05 10:09:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_channelBusy [2019-08-05 10:09:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_LZ_1$t0 [2019-08-05 10:09:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t [2019-08-05 10:09:08,181 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:09:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:09:08,182 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:09:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_queue [2019-08-05 10:09:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t0 [2019-08-05 10:09:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t [2019-08-05 10:09:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t0 [2019-08-05 10:09:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$sendCount [2019-08-05 10:09:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$t0 [2019-08-05 10:09:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_RX_1$t0 [2019-08-05 10:09:08,474 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:09:12,264 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:09:12,265 INFO L283 CfgBuilder]: Removed 32 assume(true) statements. [2019-08-05 10:09:12,267 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:09:12 BoogieIcfgContainer [2019-08-05 10:09:12,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:09:12,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:09:12,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:09:12,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:09:12,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:07" (1/2) ... [2019-08-05 10:09:12,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7174265e and model type u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:09:12, skipping insertion in model container [2019-08-05 10:09:12,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:09:12" (2/2) ... [2019-08-05 10:09:12,276 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b07_batman_intermittent_power_100.bpl [2019-08-05 10:09:12,285 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:09:12,292 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:09:12,306 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:09:12,330 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:09:12,331 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:09:12,331 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:09:12,332 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:09:12,332 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:09:12,332 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:09:12,332 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:09:12,333 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:09:12,333 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:09:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-08-05 10:09:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:09:12,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:12,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:09:12,362 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:12,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:12,368 INFO L82 PathProgramCache]: Analyzing trace with hash 21207, now seen corresponding path program 1 times [2019-08-05 10:09:12,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:12,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:12,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:12,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:12,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:09:12,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:12,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:12,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:12,596 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2019-08-05 10:09:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:12,660 INFO L93 Difference]: Finished difference Result 79 states and 153 transitions. [2019-08-05 10:09:12,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:12,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:09:12,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:12,680 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:09:12,681 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:09:12,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:09:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:09:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:09:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 135 transitions. [2019-08-05 10:09:12,736 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 135 transitions. Word has length 2 [2019-08-05 10:09:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:12,736 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 135 transitions. [2019-08-05 10:09:12,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 135 transitions. [2019-08-05 10:09:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:09:12,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:12,738 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:12,738 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:12,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:12,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1256322736, now seen corresponding path program 1 times [2019-08-05 10:09:12,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:12,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:12,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:12,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:12,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:12,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:12,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:12,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:12,851 INFO L87 Difference]: Start difference. First operand 77 states and 135 transitions. Second operand 3 states. [2019-08-05 10:09:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:13,481 INFO L93 Difference]: Finished difference Result 142 states and 235 transitions. [2019-08-05 10:09:13,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:13,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:09:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:13,484 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:09:13,484 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:09:13,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:09:13,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-08-05 10:09:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:09:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 232 transitions. [2019-08-05 10:09:13,505 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 232 transitions. Word has length 8 [2019-08-05 10:09:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:13,505 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 232 transitions. [2019-08-05 10:09:13,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 232 transitions. [2019-08-05 10:09:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:09:13,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:13,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:13,507 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash -858023310, now seen corresponding path program 1 times [2019-08-05 10:09:13,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:13,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:13,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:13,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:13,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:13,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:13,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:13,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:13,659 INFO L87 Difference]: Start difference. First operand 137 states and 232 transitions. Second operand 3 states. [2019-08-05 10:09:13,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:13,696 INFO L93 Difference]: Finished difference Result 272 states and 458 transitions. [2019-08-05 10:09:13,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:13,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 10:09:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:13,706 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:09:13,706 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 10:09:13,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 10:09:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2019-08-05 10:09:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-08-05 10:09:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 450 transitions. [2019-08-05 10:09:13,734 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 450 transitions. Word has length 20 [2019-08-05 10:09:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:13,735 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 450 transitions. [2019-08-05 10:09:13,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 450 transitions. [2019-08-05 10:09:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:09:13,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:13,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:13,737 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash -777560288, now seen corresponding path program 1 times [2019-08-05 10:09:13,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:13,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:13,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:13,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:13,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:13,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:13,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:13,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:13,799 INFO L87 Difference]: Start difference. First operand 262 states and 450 transitions. Second operand 3 states. [2019-08-05 10:09:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:13,835 INFO L93 Difference]: Finished difference Result 518 states and 886 transitions. [2019-08-05 10:09:13,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:13,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-08-05 10:09:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:13,840 INFO L225 Difference]: With dead ends: 518 [2019-08-05 10:09:13,841 INFO L226 Difference]: Without dead ends: 518 [2019-08-05 10:09:13,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-08-05 10:09:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-08-05 10:09:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-08-05 10:09:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 882 transitions. [2019-08-05 10:09:13,897 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 882 transitions. Word has length 21 [2019-08-05 10:09:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:13,898 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 882 transitions. [2019-08-05 10:09:13,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 882 transitions. [2019-08-05 10:09:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:09:13,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:13,899 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:13,900 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:13,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1667072215, now seen corresponding path program 1 times [2019-08-05 10:09:13,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:13,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:13,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:14,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:14,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:14,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:14,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:14,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:14,013 INFO L87 Difference]: Start difference. First operand 512 states and 882 transitions. Second operand 3 states. [2019-08-05 10:09:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:14,196 INFO L93 Difference]: Finished difference Result 1006 states and 1666 transitions. [2019-08-05 10:09:14,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:14,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:09:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:14,210 INFO L225 Difference]: With dead ends: 1006 [2019-08-05 10:09:14,211 INFO L226 Difference]: Without dead ends: 982 [2019-08-05 10:09:14,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-08-05 10:09:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 972. [2019-08-05 10:09:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-08-05 10:09:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1634 transitions. [2019-08-05 10:09:14,236 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1634 transitions. Word has length 22 [2019-08-05 10:09:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:14,236 INFO L475 AbstractCegarLoop]: Abstraction has 972 states and 1634 transitions. [2019-08-05 10:09:14,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1634 transitions. [2019-08-05 10:09:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:09:14,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:14,238 INFO L399 BasicCegarLoop]: trace 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] [2019-08-05 10:09:14,238 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:14,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2110740859, now seen corresponding path program 1 times [2019-08-05 10:09:14,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:14,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:14,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:14,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:14,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:14,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:14,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:14,302 INFO L87 Difference]: Start difference. First operand 972 states and 1634 transitions. Second operand 3 states. [2019-08-05 10:09:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:14,484 INFO L93 Difference]: Finished difference Result 1798 states and 2850 transitions. [2019-08-05 10:09:14,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:14,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:09:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:14,500 INFO L225 Difference]: With dead ends: 1798 [2019-08-05 10:09:14,501 INFO L226 Difference]: Without dead ends: 1798 [2019-08-05 10:09:14,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-08-05 10:09:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1780. [2019-08-05 10:09:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-08-05 10:09:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2834 transitions. [2019-08-05 10:09:14,543 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2834 transitions. Word has length 27 [2019-08-05 10:09:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:14,543 INFO L475 AbstractCegarLoop]: Abstraction has 1780 states and 2834 transitions. [2019-08-05 10:09:14,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2834 transitions. [2019-08-05 10:09:14,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:09:14,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:14,545 INFO L399 BasicCegarLoop]: trace 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] [2019-08-05 10:09:14,545 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:14,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:14,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1946526065, now seen corresponding path program 1 times [2019-08-05 10:09:14,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:14,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:14,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:14,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:14,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:14,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:14,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:14,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:14,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:14,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:14,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:14,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:14,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:15,109 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:09:15,421 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 5 [2019-08-05 10:09:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:15,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:15,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:15,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:15,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:15,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:15,435 INFO L87 Difference]: Start difference. First operand 1780 states and 2834 transitions. Second operand 5 states. [2019-08-05 10:09:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:15,931 INFO L93 Difference]: Finished difference Result 1829 states and 2887 transitions. [2019-08-05 10:09:15,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:15,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-08-05 10:09:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:15,942 INFO L225 Difference]: With dead ends: 1829 [2019-08-05 10:09:15,942 INFO L226 Difference]: Without dead ends: 1829 [2019-08-05 10:09:15,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-08-05 10:09:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2019-08-05 10:09:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2019-08-05 10:09:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2887 transitions. [2019-08-05 10:09:15,982 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2887 transitions. Word has length 35 [2019-08-05 10:09:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:15,983 INFO L475 AbstractCegarLoop]: Abstraction has 1829 states and 2887 transitions. [2019-08-05 10:09:15,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2887 transitions. [2019-08-05 10:09:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:09:15,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:15,986 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:15,986 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:15,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:15,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1941441835, now seen corresponding path program 1 times [2019-08-05 10:09:15,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:16,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:16,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:16,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:16,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:16,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:16,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:16,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:16,090 INFO L87 Difference]: Start difference. First operand 1829 states and 2887 transitions. Second operand 3 states. [2019-08-05 10:09:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:16,908 INFO L93 Difference]: Finished difference Result 2663 states and 4063 transitions. [2019-08-05 10:09:16,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:16,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-08-05 10:09:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:16,922 INFO L225 Difference]: With dead ends: 2663 [2019-08-05 10:09:16,923 INFO L226 Difference]: Without dead ends: 2631 [2019-08-05 10:09:16,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2019-08-05 10:09:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2629. [2019-08-05 10:09:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2629 states. [2019-08-05 10:09:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4031 transitions. [2019-08-05 10:09:16,975 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4031 transitions. Word has length 60 [2019-08-05 10:09:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:16,977 INFO L475 AbstractCegarLoop]: Abstraction has 2629 states and 4031 transitions. [2019-08-05 10:09:16,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4031 transitions. [2019-08-05 10:09:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:09:16,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:16,979 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:16,979 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:16,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1650973313, now seen corresponding path program 1 times [2019-08-05 10:09:16,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:17,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:17,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:17,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:17,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:17,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:17,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:17,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:17,065 INFO L87 Difference]: Start difference. First operand 2629 states and 4031 transitions. Second operand 3 states. [2019-08-05 10:09:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:17,256 INFO L93 Difference]: Finished difference Result 3895 states and 5791 transitions. [2019-08-05 10:09:17,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:17,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-08-05 10:09:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:17,274 INFO L225 Difference]: With dead ends: 3895 [2019-08-05 10:09:17,274 INFO L226 Difference]: Without dead ends: 3895 [2019-08-05 10:09:17,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2019-08-05 10:09:17,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3893. [2019-08-05 10:09:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3893 states. [2019-08-05 10:09:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 5791 transitions. [2019-08-05 10:09:17,346 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 5791 transitions. Word has length 63 [2019-08-05 10:09:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:17,347 INFO L475 AbstractCegarLoop]: Abstraction has 3893 states and 5791 transitions. [2019-08-05 10:09:17,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 5791 transitions. [2019-08-05 10:09:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:09:17,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:17,349 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:17,349 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:17,350 INFO L82 PathProgramCache]: Analyzing trace with hash 919830319, now seen corresponding path program 1 times [2019-08-05 10:09:17,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:17,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:17,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:17,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:17,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:17,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:17,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:17,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:17,433 INFO L87 Difference]: Start difference. First operand 3893 states and 5791 transitions. Second operand 3 states. [2019-08-05 10:09:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:17,805 INFO L93 Difference]: Finished difference Result 3819 states and 5559 transitions. [2019-08-05 10:09:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:17,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-08-05 10:09:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:17,819 INFO L225 Difference]: With dead ends: 3819 [2019-08-05 10:09:17,819 INFO L226 Difference]: Without dead ends: 3745 [2019-08-05 10:09:17,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-08-05 10:09:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3721. [2019-08-05 10:09:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2019-08-05 10:09:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5461 transitions. [2019-08-05 10:09:17,922 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5461 transitions. Word has length 68 [2019-08-05 10:09:17,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:17,922 INFO L475 AbstractCegarLoop]: Abstraction has 3721 states and 5461 transitions. [2019-08-05 10:09:17,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5461 transitions. [2019-08-05 10:09:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:09:17,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:17,924 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:17,925 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:17,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:17,926 INFO L82 PathProgramCache]: Analyzing trace with hash 373368093, now seen corresponding path program 1 times [2019-08-05 10:09:17,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:17,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:17,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:18,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:18,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:09:18,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:18,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:18,037 INFO L87 Difference]: Start difference. First operand 3721 states and 5461 transitions. Second operand 5 states. [2019-08-05 10:09:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:18,850 INFO L93 Difference]: Finished difference Result 4653 states and 6755 transitions. [2019-08-05 10:09:18,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:18,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-08-05 10:09:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:18,881 INFO L225 Difference]: With dead ends: 4653 [2019-08-05 10:09:18,881 INFO L226 Difference]: Without dead ends: 4649 [2019-08-05 10:09:18,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2019-08-05 10:09:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4517. [2019-08-05 10:09:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4517 states. [2019-08-05 10:09:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6562 transitions. [2019-08-05 10:09:18,992 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6562 transitions. Word has length 70 [2019-08-05 10:09:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:18,993 INFO L475 AbstractCegarLoop]: Abstraction has 4517 states and 6562 transitions. [2019-08-05 10:09:18,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6562 transitions. [2019-08-05 10:09:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:09:18,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:18,995 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:18,996 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:18,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:18,997 INFO L82 PathProgramCache]: Analyzing trace with hash -30411294, now seen corresponding path program 1 times [2019-08-05 10:09:19,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:19,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:19,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:19,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,698 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:09:20,356 WARN L188 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:09:20,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,821 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:09:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:20,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:20,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:09:20,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:09:20,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:09:20,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:20,872 INFO L87 Difference]: Start difference. First operand 4517 states and 6562 transitions. Second operand 6 states. [2019-08-05 10:09:21,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:21,241 INFO L93 Difference]: Finished difference Result 4755 states and 6848 transitions. [2019-08-05 10:09:21,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:09:21,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-08-05 10:09:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:21,266 INFO L225 Difference]: With dead ends: 4755 [2019-08-05 10:09:21,266 INFO L226 Difference]: Without dead ends: 4755 [2019-08-05 10:09:21,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-08-05 10:09:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4732. [2019-08-05 10:09:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4732 states. [2019-08-05 10:09:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6824 transitions. [2019-08-05 10:09:21,435 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6824 transitions. Word has length 70 [2019-08-05 10:09:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:21,435 INFO L475 AbstractCegarLoop]: Abstraction has 4732 states and 6824 transitions. [2019-08-05 10:09:21,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:09:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6824 transitions. [2019-08-05 10:09:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:09:21,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:21,436 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:21,436 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:21,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1143179452, now seen corresponding path program 1 times [2019-08-05 10:09:21,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:21,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:21,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:21,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:21,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:09:21,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:21,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:21,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:21,673 INFO L87 Difference]: Start difference. First operand 4732 states and 6824 transitions. Second operand 5 states. [2019-08-05 10:09:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:22,323 INFO L93 Difference]: Finished difference Result 4812 states and 6942 transitions. [2019-08-05 10:09:22,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:22,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-08-05 10:09:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:22,344 INFO L225 Difference]: With dead ends: 4812 [2019-08-05 10:09:22,345 INFO L226 Difference]: Without dead ends: 4800 [2019-08-05 10:09:22,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2019-08-05 10:09:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 4665. [2019-08-05 10:09:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-08-05 10:09:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 6738 transitions. [2019-08-05 10:09:22,411 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 6738 transitions. Word has length 71 [2019-08-05 10:09:22,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:22,411 INFO L475 AbstractCegarLoop]: Abstraction has 4665 states and 6738 transitions. [2019-08-05 10:09:22,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 6738 transitions. [2019-08-05 10:09:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:09:22,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:22,414 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:22,414 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:22,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2074252044, now seen corresponding path program 1 times [2019-08-05 10:09:22,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:22,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:09:22,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:22,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,900 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:09:22,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:22,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 10:09:23,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:23,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:23,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:23,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:23,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:23,213 INFO L87 Difference]: Start difference. First operand 4665 states and 6738 transitions. Second operand 7 states. [2019-08-05 10:09:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:23,650 INFO L93 Difference]: Finished difference Result 4905 states and 7026 transitions. [2019-08-05 10:09:23,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:09:23,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-08-05 10:09:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:23,661 INFO L225 Difference]: With dead ends: 4905 [2019-08-05 10:09:23,661 INFO L226 Difference]: Without dead ends: 4905 [2019-08-05 10:09:23,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-08-05 10:09:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4902. [2019-08-05 10:09:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4902 states. [2019-08-05 10:09:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 7023 transitions. [2019-08-05 10:09:23,719 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 7023 transitions. Word has length 105 [2019-08-05 10:09:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:23,719 INFO L475 AbstractCegarLoop]: Abstraction has 4902 states and 7023 transitions. [2019-08-05 10:09:23,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 7023 transitions. [2019-08-05 10:09:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:09:23,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:23,721 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:23,721 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1809599206, now seen corresponding path program 1 times [2019-08-05 10:09:23,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:23,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:09:23,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:23,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:23,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:24,593 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:09:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:09:24,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:24,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:09:24,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:24,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:24,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:24,615 INFO L87 Difference]: Start difference. First operand 4902 states and 7023 transitions. Second operand 5 states. [2019-08-05 10:09:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:24,795 INFO L93 Difference]: Finished difference Result 5173 states and 7346 transitions. [2019-08-05 10:09:24,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:09:24,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-08-05 10:09:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:24,806 INFO L225 Difference]: With dead ends: 5173 [2019-08-05 10:09:24,807 INFO L226 Difference]: Without dead ends: 5173 [2019-08-05 10:09:24,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2019-08-05 10:09:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5155. [2019-08-05 10:09:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5155 states. [2019-08-05 10:09:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7328 transitions. [2019-08-05 10:09:24,866 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7328 transitions. Word has length 107 [2019-08-05 10:09:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:24,867 INFO L475 AbstractCegarLoop]: Abstraction has 5155 states and 7328 transitions. [2019-08-05 10:09:24,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7328 transitions. [2019-08-05 10:09:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:09:24,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:24,872 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:24,872 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1148551150, now seen corresponding path program 1 times [2019-08-05 10:09:24,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:24,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:09:24,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 126 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:09:25,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:25,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:09:25,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:09:25,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:09:25,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:09:25,061 INFO L87 Difference]: Start difference. First operand 5155 states and 7328 transitions. Second operand 4 states. [2019-08-05 10:09:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:25,719 INFO L93 Difference]: Finished difference Result 11604 states and 16347 transitions. [2019-08-05 10:09:25,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:09:25,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-08-05 10:09:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:25,741 INFO L225 Difference]: With dead ends: 11604 [2019-08-05 10:09:25,741 INFO L226 Difference]: Without dead ends: 11556 [2019-08-05 10:09:25,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11556 states. [2019-08-05 10:09:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11556 to 10967. [2019-08-05 10:09:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10967 states. [2019-08-05 10:09:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10967 states to 10967 states and 15524 transitions. [2019-08-05 10:09:25,892 INFO L78 Accepts]: Start accepts. Automaton has 10967 states and 15524 transitions. Word has length 130 [2019-08-05 10:09:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:25,893 INFO L475 AbstractCegarLoop]: Abstraction has 10967 states and 15524 transitions. [2019-08-05 10:09:25,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:09:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 10967 states and 15524 transitions. [2019-08-05 10:09:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:09:25,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:25,895 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:25,896 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:25,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:25,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2126953540, now seen corresponding path program 1 times [2019-08-05 10:09:25,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:25,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:25,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-08-05 10:09:26,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:26,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:26,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:26,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:26,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:26,002 INFO L87 Difference]: Start difference. First operand 10967 states and 15524 transitions. Second operand 3 states. [2019-08-05 10:09:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:26,533 INFO L93 Difference]: Finished difference Result 15551 states and 21862 transitions. [2019-08-05 10:09:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:26,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-08-05 10:09:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:26,556 INFO L225 Difference]: With dead ends: 15551 [2019-08-05 10:09:26,556 INFO L226 Difference]: Without dead ends: 15455 [2019-08-05 10:09:26,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15455 states. [2019-08-05 10:09:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15455 to 15373. [2019-08-05 10:09:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15373 states. [2019-08-05 10:09:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15373 states to 15373 states and 21682 transitions. [2019-08-05 10:09:26,852 INFO L78 Accepts]: Start accepts. Automaton has 15373 states and 21682 transitions. Word has length 134 [2019-08-05 10:09:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:26,853 INFO L475 AbstractCegarLoop]: Abstraction has 15373 states and 21682 transitions. [2019-08-05 10:09:26,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 15373 states and 21682 transitions. [2019-08-05 10:09:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:09:26,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:26,855 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:26,855 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:26,856 INFO L82 PathProgramCache]: Analyzing trace with hash 887643078, now seen corresponding path program 1 times [2019-08-05 10:09:26,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:26,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:26,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-08-05 10:09:26,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:26,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:26,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:26,965 INFO L87 Difference]: Start difference. First operand 15373 states and 21682 transitions. Second operand 3 states. [2019-08-05 10:09:27,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:27,278 INFO L93 Difference]: Finished difference Result 20487 states and 28307 transitions. [2019-08-05 10:09:27,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:27,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-08-05 10:09:27,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:27,302 INFO L225 Difference]: With dead ends: 20487 [2019-08-05 10:09:27,302 INFO L226 Difference]: Without dead ends: 20487 [2019-08-05 10:09:27,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2019-08-05 10:09:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20051. [2019-08-05 10:09:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20051 states. [2019-08-05 10:09:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20051 states to 20051 states and 27873 transitions. [2019-08-05 10:09:28,128 INFO L78 Accepts]: Start accepts. Automaton has 20051 states and 27873 transitions. Word has length 138 [2019-08-05 10:09:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:28,129 INFO L475 AbstractCegarLoop]: Abstraction has 20051 states and 27873 transitions. [2019-08-05 10:09:28,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 20051 states and 27873 transitions. [2019-08-05 10:09:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:09:28,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:28,131 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:28,132 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:28,132 INFO L82 PathProgramCache]: Analyzing trace with hash 11293620, now seen corresponding path program 1 times [2019-08-05 10:09:28,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:28,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:09:28,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:28,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,693 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 8 [2019-08-05 10:09:28,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,334 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-08-05 10:09:29,728 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-08-05 10:09:30,033 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-08-05 10:09:30,447 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-08-05 10:09:30,800 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-08-05 10:09:31,061 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-08-05 10:09:31,259 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-08-05 10:09:31,437 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-08-05 10:09:31,589 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:09:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:31,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:31,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:09:31,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:09:31,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:09:31,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:09:31,686 INFO L87 Difference]: Start difference. First operand 20051 states and 27873 transitions. Second operand 18 states. [2019-08-05 10:09:32,385 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-08-05 10:09:32,974 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-08-05 10:09:33,178 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-08-05 10:09:35,131 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-08-05 10:09:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:35,204 INFO L93 Difference]: Finished difference Result 63148 states and 87738 transitions. [2019-08-05 10:09:35,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:09:35,204 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2019-08-05 10:09:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:35,269 INFO L225 Difference]: With dead ends: 63148 [2019-08-05 10:09:35,270 INFO L226 Difference]: Without dead ends: 62584 [2019-08-05 10:09:35,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=306, Invalid=624, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:09:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62584 states. [2019-08-05 10:09:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62584 to 49311. [2019-08-05 10:09:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49311 states. [2019-08-05 10:09:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49311 states to 49311 states and 69733 transitions. [2019-08-05 10:09:35,875 INFO L78 Accepts]: Start accepts. Automaton has 49311 states and 69733 transitions. Word has length 139 [2019-08-05 10:09:35,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:35,875 INFO L475 AbstractCegarLoop]: Abstraction has 49311 states and 69733 transitions. [2019-08-05 10:09:35,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:09:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 49311 states and 69733 transitions. [2019-08-05 10:09:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:09:35,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:35,878 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:35,878 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:35,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:35,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1823249627, now seen corresponding path program 1 times [2019-08-05 10:09:35,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:35,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:09:35,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:36,084 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:09:36,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,556 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:09:36,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:09:37,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:37,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:37,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:37,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:37,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:37,061 INFO L87 Difference]: Start difference. First operand 49311 states and 69733 transitions. Second operand 7 states. [2019-08-05 10:09:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:37,495 INFO L93 Difference]: Finished difference Result 51422 states and 72332 transitions. [2019-08-05 10:09:37,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:37,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-08-05 10:09:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:37,557 INFO L225 Difference]: With dead ends: 51422 [2019-08-05 10:09:37,557 INFO L226 Difference]: Without dead ends: 51422 [2019-08-05 10:09:37,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51422 states. [2019-08-05 10:09:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51422 to 51009. [2019-08-05 10:09:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51009 states. [2019-08-05 10:09:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51009 states to 51009 states and 71861 transitions. [2019-08-05 10:09:38,981 INFO L78 Accepts]: Start accepts. Automaton has 51009 states and 71861 transitions. Word has length 143 [2019-08-05 10:09:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:38,982 INFO L475 AbstractCegarLoop]: Abstraction has 51009 states and 71861 transitions. [2019-08-05 10:09:38,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 51009 states and 71861 transitions. [2019-08-05 10:09:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-08-05 10:09:38,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:38,986 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:38,987 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:38,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:38,987 INFO L82 PathProgramCache]: Analyzing trace with hash 849835755, now seen corresponding path program 1 times [2019-08-05 10:09:38,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:09:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:09:39,199 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:09:39,334 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_100.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:09:39 BoogieIcfgContainer [2019-08-05 10:09:39,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:09:39,336 INFO L168 Benchmark]: Toolchain (without parser) took 31426.79 ms. Allocated memory was 135.8 MB in the beginning and 861.9 MB in the end (delta: 726.1 MB). Free memory was 109.8 MB in the beginning and 361.9 MB in the end (delta: -252.0 MB). Peak memory consumption was 474.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:39,337 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 114.6 MB in the beginning and 114.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:09:39,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.76 ms. Allocated memory is still 135.8 MB. Free memory was 109.8 MB in the beginning and 107.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:39,339 INFO L168 Benchmark]: Boogie Preprocessor took 116.27 ms. Allocated memory is still 135.8 MB. Free memory was 107.6 MB in the beginning and 104.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:39,340 INFO L168 Benchmark]: RCFGBuilder took 4162.14 ms. Allocated memory was 135.8 MB in the beginning and 198.7 MB in the end (delta: 62.9 MB). Free memory was 103.8 MB in the beginning and 134.4 MB in the end (delta: -30.6 MB). Peak memory consumption was 82.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:39,342 INFO L168 Benchmark]: TraceAbstraction took 27065.80 ms. Allocated memory was 198.7 MB in the beginning and 861.9 MB in the end (delta: 663.2 MB). Free memory was 134.4 MB in the beginning and 361.9 MB in the end (delta: -227.5 MB). Peak memory consumption was 435.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:39,345 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 114.6 MB in the beginning and 114.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.76 ms. Allocated memory is still 135.8 MB. Free memory was 109.8 MB in the beginning and 107.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.27 ms. Allocated memory is still 135.8 MB. Free memory was 107.6 MB in the beginning and 104.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4162.14 ms. Allocated memory was 135.8 MB in the beginning and 198.7 MB in the end (delta: 62.9 MB). Free memory was 103.8 MB in the beginning and 134.4 MB in the end (delta: -30.6 MB). Peak memory consumption was 82.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27065.80 ms. Allocated memory was 198.7 MB in the beginning and 861.9 MB in the end (delta: 663.2 MB). Free memory was 134.4 MB in the beginning and 361.9 MB in the end (delta: -227.5 MB). Peak memory consumption was 435.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 706]: assertion can be violated assertion can be violated We found a FailurePath: [L423-L425] requires MEDIUM_1$sendCount == 0; [L423-L426] requires time == 0.0; [L423-L427] requires ENV_1$t == 0.0; [L423-L428] requires MAC_1$t0 == 0.0; [L423-L429] requires APP_LZ_1$t0 == 0.0; [L423-L430] requires ENV_1$t0 == 0.0; [L423-L431] requires MAC_1$t == 0.0; [L423-L432] requires MEDIUM_1$t0 == 0.0; [L423-L433] requires APP_RX_1$t0 == 0.0; [L423-L434] requires channelBusy == false; [L423-L435] requires queue == false; [L423-L436] requires time$new == time; [L423-L437] requires ENV_1$t$new == ENV_1$t; [L423-L438] requires MAC_1$t0$new == MAC_1$t0; [L423-L439] requires APP_LZ_1$t0$new == APP_LZ_1$t0; [L423-L440] requires ENV_1$t0$new == ENV_1$t0; [L423-L441] requires MAC_1$t$new == MAC_1$t; [L423-L442] requires MEDIUM_1$t0$new == MEDIUM_1$t0; [L423-L443] requires APP_RX_1$t0$new == APP_RX_1$t0; [L423-L444] requires MEDIUM_1$sendCount$new == MEDIUM_1$sendCount; [L423-L445] requires channelBusy$new == channelBusy; [L423-L446] requires queue$new == queue; [L423-L447] requires !time$reset; [L423-L448] requires !ENV_1$t$reset; [L423-L449] requires !MAC_1$t0$reset; [L423-L450] requires !APP_LZ_1$t0$reset; [L423-L451] requires !ENV_1$t0$reset; [L423-L452] requires !MAC_1$t$reset; [L423-L453] requires !MEDIUM_1$t0$reset; [L423-L454] requires !APP_RX_1$t0$reset; [L423-L455] requires !MEDIUM_1$sendCount$reset; [L423-L456] requires !channelBusy$reset; [L423-L457] requires !queue$reset; [L460] sync := sync_none; [L461] loc$MAC_1 := id12_1; [L462] loc$APP_RX_1 := id14_1; [L463] loc$APP_LZ_1 := id16_1; [L464] loc$MEDIUM_1 := id22_1; [L465] loc$ENV_1 := id31_1; [L466] MAC_1$power := 0.0; VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L469] assert time <= 9600.0 ==> MAC_1$power < 100.0; [L470] havoc delay; [L471] assume delay >= 0.0; [L473] time := time + delay; [L474] time$new := time; [L475] ENV_1$t := ENV_1$t + delay; [L476] ENV_1$t$new := ENV_1$t; [L477] MAC_1$t0 := MAC_1$t0 + delay; [L478] MAC_1$t0$new := MAC_1$t0; [L479] APP_LZ_1$t0 := APP_LZ_1$t0 + delay; [L480] APP_LZ_1$t0$new := APP_LZ_1$t0; [L481] ENV_1$t0 := ENV_1$t0 + delay; [L482] ENV_1$t0$new := ENV_1$t0; [L483] MAC_1$t := MAC_1$t + delay; [L484] MAC_1$t$new := MAC_1$t; [L485] MEDIUM_1$t0 := MEDIUM_1$t0 + delay; [L486] MEDIUM_1$t0$new := MEDIUM_1$t0; [L487] APP_RX_1$t0 := APP_RX_1$t0 + delay; [L488] APP_RX_1$t0$new := APP_RX_1$t0; [L490] COND FALSE !(loc$MAC_1 == id0_1) [L494] COND FALSE !(loc$MAC_1 == id1_1) [L498] COND FALSE !(loc$MAC_1 == id2_1) [L502] COND FALSE !(loc$MAC_1 == id3_1) [L506] COND FALSE !(loc$MAC_1 == id4_1) [L510] COND FALSE !(loc$MAC_1 == id5_1) [L514] COND FALSE !(loc$MAC_1 == id7_1) [L518] COND FALSE !(loc$MAC_1 == id8_1) [L522] COND FALSE !(loc$MAC_1 == id9_1) [L526] COND FALSE !(loc$MAC_1 == id10_1) [L530] COND TRUE loc$MAC_1 == id12_1 [L532] MAC_1$power := MAC_1$power + 0.005 * delay; VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L535] COND FALSE !(loc$MAC_1 == id0_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L540] COND FALSE !(loc$MAC_1 == id1_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L545] COND FALSE !(loc$MAC_1 == id2_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L550] COND FALSE !(loc$MAC_1 == id3_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L555] COND FALSE !(loc$MAC_1 == id4_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L560] COND FALSE !(loc$MAC_1 == id5_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L565] COND FALSE !(loc$MAC_1 == id6_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L570] COND FALSE !(loc$MAC_1 == id7_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L575] COND FALSE !(loc$MAC_1 == id8_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L580] COND FALSE !(loc$MAC_1 == id9_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L585] COND FALSE !(loc$MAC_1 == id10_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L590] COND FALSE !(loc$MAC_1 == id11_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L595] COND TRUE loc$MAC_1 == id12_1 [L597] assume MAC_1$t <= 380.0; VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L602] COND FALSE !(loc$APP_RX_1 == id13_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L607] COND TRUE loc$APP_RX_1 == id14_1 VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L614] COND FALSE !(loc$APP_LZ_1 == id15_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L619] COND TRUE loc$APP_LZ_1 == id16_1 [L621] assume APP_LZ_1$t0 <= 0.0; VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L626] COND FALSE !(loc$MEDIUM_1 == id17_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L631] COND FALSE !(loc$MEDIUM_1 == id18_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L636] COND FALSE !(loc$MEDIUM_1 == id19_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L641] COND FALSE !(loc$MEDIUM_1 == id20_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L646] COND FALSE !(loc$MEDIUM_1 == id21_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L651] COND TRUE loc$MEDIUM_1 == id22_1 VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L658] COND FALSE !(loc$ENV_1 == id23_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L663] COND FALSE !(loc$ENV_1 == id24_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L668] COND FALSE !(loc$ENV_1 == id25_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L673] COND FALSE !(loc$ENV_1 == id26_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L678] COND FALSE !(loc$ENV_1 == id27_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L683] COND FALSE !(loc$ENV_1 == id28_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L688] COND FALSE !(loc$ENV_1 == id29_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L693] COND FALSE !(loc$ENV_1 == id30_1) VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L698] COND TRUE loc$ENV_1 == id31_1 [L700] assume ENV_1$t <= 380.0; VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L706] assert time <= 9600.0 ==> MAC_1$power < 100.0; VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L889] COND TRUE sync == sync_none VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=false, queue$new=false, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L891] COND TRUE loc$APP_LZ_1 == id16_1 [L895] assume APP_LZ_1$t0 >= 0.0 && APP_LZ_1$t0 <= 9600.0; [L896] loc$APP_LZ_1 := id15_1; [L897] queue := true; [L898] queue$new := queue; VAL [APP_LZ_1$t0=0.0, APP_LZ_1$t0$new=0.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=0.0, APP_RX_1$t0$new=0.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=0.0, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=0.0, MEDIUM_1$t0$new=0.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=0.0, time$new=0.0, time$reset=false] [L469] assert time <= 9600.0 ==> MAC_1$power < 100.0; [L470] havoc delay; [L471] assume delay >= 0.0; [L473] time := time + delay; [L474] time$new := time; [L475] ENV_1$t := ENV_1$t + delay; [L476] ENV_1$t$new := ENV_1$t; [L477] MAC_1$t0 := MAC_1$t0 + delay; [L478] MAC_1$t0$new := MAC_1$t0; [L479] APP_LZ_1$t0 := APP_LZ_1$t0 + delay; [L480] APP_LZ_1$t0$new := APP_LZ_1$t0; [L481] ENV_1$t0 := ENV_1$t0 + delay; [L482] ENV_1$t0$new := ENV_1$t0; [L483] MAC_1$t := MAC_1$t + delay; [L484] MAC_1$t$new := MAC_1$t; [L485] MEDIUM_1$t0 := MEDIUM_1$t0 + delay; [L486] MEDIUM_1$t0$new := MEDIUM_1$t0; [L487] APP_RX_1$t0 := APP_RX_1$t0 + delay; [L488] APP_RX_1$t0$new := APP_RX_1$t0; [L490] COND FALSE !(loc$MAC_1 == id0_1) [L494] COND FALSE !(loc$MAC_1 == id1_1) [L498] COND FALSE !(loc$MAC_1 == id2_1) [L502] COND FALSE !(loc$MAC_1 == id3_1) [L506] COND FALSE !(loc$MAC_1 == id4_1) [L510] COND FALSE !(loc$MAC_1 == id5_1) [L514] COND FALSE !(loc$MAC_1 == id7_1) [L518] COND FALSE !(loc$MAC_1 == id8_1) [L522] COND FALSE !(loc$MAC_1 == id9_1) [L526] COND FALSE !(loc$MAC_1 == id10_1) [L530] COND TRUE loc$MAC_1 == id12_1 [L532] MAC_1$power := MAC_1$power + 0.005 * delay; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L535] COND FALSE !(loc$MAC_1 == id0_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L540] COND FALSE !(loc$MAC_1 == id1_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L545] COND FALSE !(loc$MAC_1 == id2_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L550] COND FALSE !(loc$MAC_1 == id3_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L555] COND FALSE !(loc$MAC_1 == id4_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L560] COND FALSE !(loc$MAC_1 == id5_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L565] COND FALSE !(loc$MAC_1 == id6_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L570] COND FALSE !(loc$MAC_1 == id7_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L575] COND FALSE !(loc$MAC_1 == id8_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L580] COND FALSE !(loc$MAC_1 == id9_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L585] COND FALSE !(loc$MAC_1 == id10_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L590] COND FALSE !(loc$MAC_1 == id11_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L595] COND TRUE loc$MAC_1 == id12_1 [L597] assume MAC_1$t <= 380.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L602] COND FALSE !(loc$APP_RX_1 == id13_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L607] COND TRUE loc$APP_RX_1 == id14_1 VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L614] COND TRUE loc$APP_LZ_1 == id15_1 [L616] assume APP_LZ_1$t0 <= 9600.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L626] COND FALSE !(loc$MEDIUM_1 == id17_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L631] COND FALSE !(loc$MEDIUM_1 == id18_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L636] COND FALSE !(loc$MEDIUM_1 == id19_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L641] COND FALSE !(loc$MEDIUM_1 == id20_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L646] COND FALSE !(loc$MEDIUM_1 == id21_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L651] COND TRUE loc$MEDIUM_1 == id22_1 VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L658] COND FALSE !(loc$ENV_1 == id23_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L663] COND FALSE !(loc$ENV_1 == id24_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L668] COND FALSE !(loc$ENV_1 == id25_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L673] COND FALSE !(loc$ENV_1 == id26_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L678] COND FALSE !(loc$ENV_1 == id27_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L683] COND FALSE !(loc$ENV_1 == id28_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L688] COND FALSE !(loc$ENV_1 == id29_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L693] COND FALSE !(loc$ENV_1 == id30_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L698] COND TRUE loc$ENV_1 == id31_1 [L700] assume ENV_1$t <= 380.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L706] assert time <= 9600.0 ==> MAC_1$power < 100.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L709] COND TRUE sync == sync_none VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=380.0, MAC_1$t$new=380.0, MAC_1$t$reset=false, MAC_1$t0=380.0, MAC_1$t0$new=380.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L711] COND TRUE loc$MAC_1 == id12_1 [L715] assume MAC_1$t >= 380.0; [L716] loc$MAC_1 := id11_1; [L717] MAC_1$t := 0.0; [L718] MAC_1$t$new := MAC_1$t; [L719] MAC_1$t0 := 0.0; [L720] MAC_1$t0$new := MAC_1$t0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=380.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L469] assert time <= 9600.0 ==> MAC_1$power < 100.0; [L470] havoc delay; [L471] assume delay >= 0.0; [L473] time := time + delay; [L474] time$new := time; [L475] ENV_1$t := ENV_1$t + delay; [L476] ENV_1$t$new := ENV_1$t; [L477] MAC_1$t0 := MAC_1$t0 + delay; [L478] MAC_1$t0$new := MAC_1$t0; [L479] APP_LZ_1$t0 := APP_LZ_1$t0 + delay; [L480] APP_LZ_1$t0$new := APP_LZ_1$t0; [L481] ENV_1$t0 := ENV_1$t0 + delay; [L482] ENV_1$t0$new := ENV_1$t0; [L483] MAC_1$t := MAC_1$t + delay; [L484] MAC_1$t$new := MAC_1$t; [L485] MEDIUM_1$t0 := MEDIUM_1$t0 + delay; [L486] MEDIUM_1$t0$new := MEDIUM_1$t0; [L487] APP_RX_1$t0 := APP_RX_1$t0 + delay; [L488] APP_RX_1$t0$new := APP_RX_1$t0; [L490] COND FALSE !(loc$MAC_1 == id0_1) [L494] COND FALSE !(loc$MAC_1 == id1_1) [L498] COND FALSE !(loc$MAC_1 == id2_1) [L502] COND FALSE !(loc$MAC_1 == id3_1) [L506] COND FALSE !(loc$MAC_1 == id4_1) [L510] COND FALSE !(loc$MAC_1 == id5_1) [L514] COND FALSE !(loc$MAC_1 == id7_1) [L518] COND FALSE !(loc$MAC_1 == id8_1) [L522] COND FALSE !(loc$MAC_1 == id9_1) [L526] COND FALSE !(loc$MAC_1 == id10_1) [L530] COND FALSE !(loc$MAC_1 == id12_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L535] COND FALSE !(loc$MAC_1 == id0_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L540] COND FALSE !(loc$MAC_1 == id1_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L545] COND FALSE !(loc$MAC_1 == id2_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L550] COND FALSE !(loc$MAC_1 == id3_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L555] COND FALSE !(loc$MAC_1 == id4_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L560] COND FALSE !(loc$MAC_1 == id5_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L565] COND FALSE !(loc$MAC_1 == id6_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L570] COND FALSE !(loc$MAC_1 == id7_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L575] COND FALSE !(loc$MAC_1 == id8_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L580] COND FALSE !(loc$MAC_1 == id9_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L585] COND FALSE !(loc$MAC_1 == id10_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L590] COND TRUE loc$MAC_1 == id11_1 [L592] assume MAC_1$t0 <= 0.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L602] COND FALSE !(loc$APP_RX_1 == id13_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L607] COND TRUE loc$APP_RX_1 == id14_1 VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L614] COND TRUE loc$APP_LZ_1 == id15_1 [L616] assume APP_LZ_1$t0 <= 9600.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L626] COND FALSE !(loc$MEDIUM_1 == id17_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L631] COND FALSE !(loc$MEDIUM_1 == id18_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L636] COND FALSE !(loc$MEDIUM_1 == id19_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L641] COND FALSE !(loc$MEDIUM_1 == id20_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L646] COND FALSE !(loc$MEDIUM_1 == id21_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L651] COND TRUE loc$MEDIUM_1 == id22_1 VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L658] COND FALSE !(loc$ENV_1 == id23_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L663] COND FALSE !(loc$ENV_1 == id24_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L668] COND FALSE !(loc$ENV_1 == id25_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L673] COND FALSE !(loc$ENV_1 == id26_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L678] COND FALSE !(loc$ENV_1 == id27_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L683] COND FALSE !(loc$ENV_1 == id28_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L688] COND FALSE !(loc$ENV_1 == id29_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L693] COND FALSE !(loc$ENV_1 == id30_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L698] COND TRUE loc$ENV_1 == id31_1 [L700] assume ENV_1$t <= 380.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L706] assert time <= 9600.0 ==> MAC_1$power < 100.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L709] COND TRUE sync == sync_none VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L711] COND FALSE !(loc$MAC_1 == id12_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L723] COND TRUE loc$MAC_1 == id11_1 [L727] assume queue; [L728] loc$MAC_1 := id9_1; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L469] assert time <= 9600.0 ==> MAC_1$power < 100.0; [L470] havoc delay; [L471] assume delay >= 0.0; [L473] time := time + delay; [L474] time$new := time; [L475] ENV_1$t := ENV_1$t + delay; [L476] ENV_1$t$new := ENV_1$t; [L477] MAC_1$t0 := MAC_1$t0 + delay; [L478] MAC_1$t0$new := MAC_1$t0; [L479] APP_LZ_1$t0 := APP_LZ_1$t0 + delay; [L480] APP_LZ_1$t0$new := APP_LZ_1$t0; [L481] ENV_1$t0 := ENV_1$t0 + delay; [L482] ENV_1$t0$new := ENV_1$t0; [L483] MAC_1$t := MAC_1$t + delay; [L484] MAC_1$t$new := MAC_1$t; [L485] MEDIUM_1$t0 := MEDIUM_1$t0 + delay; [L486] MEDIUM_1$t0$new := MEDIUM_1$t0; [L487] APP_RX_1$t0 := APP_RX_1$t0 + delay; [L488] APP_RX_1$t0$new := APP_RX_1$t0; [L490] COND FALSE !(loc$MAC_1 == id0_1) [L494] COND FALSE !(loc$MAC_1 == id1_1) [L498] COND FALSE !(loc$MAC_1 == id2_1) [L502] COND FALSE !(loc$MAC_1 == id3_1) [L506] COND FALSE !(loc$MAC_1 == id4_1) [L510] COND FALSE !(loc$MAC_1 == id5_1) [L514] COND FALSE !(loc$MAC_1 == id7_1) [L518] COND FALSE !(loc$MAC_1 == id8_1) [L522] COND TRUE loc$MAC_1 == id9_1 [L524] MAC_1$power := MAC_1$power + 30.0 * delay; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L535] COND FALSE !(loc$MAC_1 == id0_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L540] COND FALSE !(loc$MAC_1 == id1_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L545] COND FALSE !(loc$MAC_1 == id2_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L550] COND FALSE !(loc$MAC_1 == id3_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L555] COND FALSE !(loc$MAC_1 == id4_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L560] COND FALSE !(loc$MAC_1 == id5_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L565] COND FALSE !(loc$MAC_1 == id6_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L570] COND FALSE !(loc$MAC_1 == id7_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L575] COND FALSE !(loc$MAC_1 == id8_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L580] COND TRUE loc$MAC_1 == id9_1 [L582] assume MAC_1$t0 <= 4.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L602] COND FALSE !(loc$APP_RX_1 == id13_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L607] COND TRUE loc$APP_RX_1 == id14_1 VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L614] COND TRUE loc$APP_LZ_1 == id15_1 [L616] assume APP_LZ_1$t0 <= 9600.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L626] COND FALSE !(loc$MEDIUM_1 == id17_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L631] COND FALSE !(loc$MEDIUM_1 == id18_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L636] COND FALSE !(loc$MEDIUM_1 == id19_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L641] COND FALSE !(loc$MEDIUM_1 == id20_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L646] COND FALSE !(loc$MEDIUM_1 == id21_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L651] COND TRUE loc$MEDIUM_1 == id22_1 VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L658] COND FALSE !(loc$ENV_1 == id23_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L663] COND FALSE !(loc$ENV_1 == id24_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L668] COND FALSE !(loc$ENV_1 == id25_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L673] COND FALSE !(loc$ENV_1 == id26_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L678] COND FALSE !(loc$ENV_1 == id27_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L683] COND FALSE !(loc$ENV_1 == id28_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L688] COND FALSE !(loc$ENV_1 == id29_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L693] COND FALSE !(loc$ENV_1 == id30_1) VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L698] COND TRUE loc$ENV_1 == id31_1 [L700] assume ENV_1$t <= 380.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L706] assert time <= 9600.0 ==> MAC_1$power < 100.0; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L1032] COND TRUE sync == sync_none VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=380.0, ENV_1$t$new=380.0, ENV_1$t$reset=false, ENV_1$t0=380.0, ENV_1$t0$new=380.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L1034] COND TRUE loc$ENV_1 == id31_1 [L1038] assume ENV_1$t >= 380.0; [L1039] loc$ENV_1 := id30_1; [L1040] ENV_1$t0 := 0.0; [L1041] ENV_1$t0$new := ENV_1$t0; [L1042] ENV_1$t := 0.0; [L1043] ENV_1$t$new := ENV_1$t; VAL [APP_LZ_1$t0=380.0, APP_LZ_1$t0$new=380.0, APP_LZ_1$t0$reset=false, APP_RX_1$t0=380.0, APP_RX_1$t0$new=380.0, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=0.0, ENV_1$t=0.0, ENV_1$t$new=0.0, ENV_1$t$reset=false, ENV_1$t0=0.0, ENV_1$t0$new=0.0, ENV_1$t0$reset=false, MAC_1$power=19/10, MAC_1$t=0.0, MAC_1$t$new=0.0, MAC_1$t$reset=false, MAC_1$t0=0.0, MAC_1$t0$new=0.0, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=380.0, MEDIUM_1$t0$new=380.0, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=380.0, time$new=380.0, time$reset=false] [L469] assert time <= 9600.0 ==> MAC_1$power < 100.0; [L470] havoc delay; [L471] assume delay >= 0.0; [L473] time := time + delay; [L474] time$new := time; [L475] ENV_1$t := ENV_1$t + delay; [L476] ENV_1$t$new := ENV_1$t; [L477] MAC_1$t0 := MAC_1$t0 + delay; [L478] MAC_1$t0$new := MAC_1$t0; [L479] APP_LZ_1$t0 := APP_LZ_1$t0 + delay; [L480] APP_LZ_1$t0$new := APP_LZ_1$t0; [L481] ENV_1$t0 := ENV_1$t0 + delay; [L482] ENV_1$t0$new := ENV_1$t0; [L483] MAC_1$t := MAC_1$t + delay; [L484] MAC_1$t$new := MAC_1$t; [L485] MEDIUM_1$t0 := MEDIUM_1$t0 + delay; [L486] MEDIUM_1$t0$new := MEDIUM_1$t0; [L487] APP_RX_1$t0 := APP_RX_1$t0 + delay; [L488] APP_RX_1$t0$new := APP_RX_1$t0; [L490] COND FALSE !(loc$MAC_1 == id0_1) [L494] COND FALSE !(loc$MAC_1 == id1_1) [L498] COND FALSE !(loc$MAC_1 == id2_1) [L502] COND FALSE !(loc$MAC_1 == id3_1) [L506] COND FALSE !(loc$MAC_1 == id4_1) [L510] COND FALSE !(loc$MAC_1 == id5_1) [L514] COND FALSE !(loc$MAC_1 == id7_1) [L518] COND FALSE !(loc$MAC_1 == id8_1) [L522] COND TRUE loc$MAC_1 == id9_1 [L524] MAC_1$power := MAC_1$power + 30.0 * delay; VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L535] COND FALSE !(loc$MAC_1 == id0_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L540] COND FALSE !(loc$MAC_1 == id1_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L545] COND FALSE !(loc$MAC_1 == id2_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L550] COND FALSE !(loc$MAC_1 == id3_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L555] COND FALSE !(loc$MAC_1 == id4_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L560] COND FALSE !(loc$MAC_1 == id5_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L565] COND FALSE !(loc$MAC_1 == id6_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L570] COND FALSE !(loc$MAC_1 == id7_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L575] COND FALSE !(loc$MAC_1 == id8_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L580] COND TRUE loc$MAC_1 == id9_1 [L582] assume MAC_1$t0 <= 4.0; VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L602] COND FALSE !(loc$APP_RX_1 == id13_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L607] COND TRUE loc$APP_RX_1 == id14_1 VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L614] COND TRUE loc$APP_LZ_1 == id15_1 [L616] assume APP_LZ_1$t0 <= 9600.0; VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L626] COND FALSE !(loc$MEDIUM_1 == id17_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L631] COND FALSE !(loc$MEDIUM_1 == id18_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L636] COND FALSE !(loc$MEDIUM_1 == id19_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L641] COND FALSE !(loc$MEDIUM_1 == id20_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L646] COND FALSE !(loc$MEDIUM_1 == id21_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L651] COND TRUE loc$MEDIUM_1 == id22_1 VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L658] COND FALSE !(loc$ENV_1 == id23_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L663] COND FALSE !(loc$ENV_1 == id24_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L668] COND FALSE !(loc$ENV_1 == id25_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L673] COND FALSE !(loc$ENV_1 == id26_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L678] COND FALSE !(loc$ENV_1 == id27_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L683] COND FALSE !(loc$ENV_1 == id28_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L688] COND FALSE !(loc$ENV_1 == id29_1) VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L693] COND TRUE loc$ENV_1 == id30_1 [L695] assume ENV_1$t0 <= 4.0; VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] [L706] assert time <= 9600.0 ==> MAC_1$power < 100.0; VAL [APP_LZ_1$t0=38327/100, APP_LZ_1$t0$new=38327/100, APP_LZ_1$t0$reset=false, APP_RX_1$t0=38327/100, APP_RX_1$t0$new=38327/100, APP_RX_1$t0$reset=false, channelBusy=false, channelBusy$new=false, channelBusy$reset=false, delay=327/100, ENV_1$t=327/100, ENV_1$t$new=327/100, ENV_1$t$reset=false, ENV_1$t0=327/100, ENV_1$t0$new=327/100, ENV_1$t0$reset=false, MAC_1$power=100.0, MAC_1$t=327/100, MAC_1$t$new=327/100, MAC_1$t$reset=false, MAC_1$t0=327/100, MAC_1$t0$new=327/100, MAC_1$t0$reset=false, MEDIUM_1$sendCount=0, MEDIUM_1$sendCount$new=0, MEDIUM_1$sendCount$reset=false, MEDIUM_1$t0=38327/100, MEDIUM_1$t0$new=38327/100, MEDIUM_1$t0$reset=false, queue=true, queue$new=true, queue$reset=false, time=38327/100, time$new=38327/100, time$reset=false] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 2 error locations. UNSAFE Result, 27.0s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3386 SDtfs, 4506 SDslu, 5511 SDs, 0 SdLazy, 2242 SolverSat, 562 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1437 GetRequests, 1345 SyntacticMatches, 14 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51009occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 15177 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1603 NumberOfCodeBlocks, 1603 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1413 ConstructedInterpolants, 0 QuantifiedInterpolants, 863112 SizeOfPredicates, 47 NumberOfNonLiveVariables, 4598 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 787/1255 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...