/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-Persistent-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2022/bluetooth08-incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d310483fe8b4879eee5de19363f50e4b839cc4ec-d310483 [2021-06-24 20:31:16,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-24 20:31:16,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-24 20:31:16,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-24 20:31:16,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-24 20:31:16,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-24 20:31:16,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-24 20:31:16,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-24 20:31:16,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-24 20:31:16,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-24 20:31:16,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-24 20:31:16,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-24 20:31:16,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-24 20:31:16,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-24 20:31:16,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-24 20:31:16,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-24 20:31:16,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-24 20:31:16,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-24 20:31:16,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-24 20:31:16,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-24 20:31:16,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-24 20:31:16,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-24 20:31:16,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-24 20:31:16,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-24 20:31:16,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-24 20:31:16,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-24 20:31:16,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-24 20:31:16,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-24 20:31:16,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-24 20:31:16,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-24 20:31:16,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-24 20:31:16,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-24 20:31:16,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-24 20:31:16,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-24 20:31:16,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-24 20:31:16,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-24 20:31:16,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-24 20:31:16,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-24 20:31:16,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-24 20:31:16,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-24 20:31:16,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-24 20:31:16,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-Persistent-NoLbe.epf [2021-06-24 20:31:16,177 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-24 20:31:16,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-24 20:31:16,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-24 20:31:16,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-24 20:31:16,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-24 20:31:16,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-24 20:31:16,179 INFO L138 SettingsManager]: * Use SBE=true [2021-06-24 20:31:16,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-24 20:31:16,179 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-24 20:31:16,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-24 20:31:16,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-24 20:31:16,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-24 20:31:16,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-24 20:31:16,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-24 20:31:16,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-24 20:31:16,194 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-24 20:31:16,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-24 20:31:16,195 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-24 20:31:16,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-24 20:31:16,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-24 20:31:16,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-24 20:31:16,195 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-24 20:31:16,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-24 20:31:16,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-24 20:31:16,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-24 20:31:16,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-24 20:31:16,196 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-24 20:31:16,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-24 20:31:16,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-24 20:31:16,196 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-24 20:31:16,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-24 20:31:16,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-24 20:31:16,197 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SETS [2021-06-24 20:31:16,197 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-24 20:31:16,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-24 20:31:16,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-24 20:31:16,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-24 20:31:16,479 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-24 20:31:16,479 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-24 20:31:16,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2022/bluetooth08-incorrect.bpl [2021-06-24 20:31:16,480 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2022/bluetooth08-incorrect.bpl' [2021-06-24 20:31:16,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-24 20:31:16,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-24 20:31:16,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-24 20:31:16,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-24 20:31:16,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-24 20:31:16,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:16" (1/1) ... [2021-06-24 20:31:16,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:16" (1/1) ... [2021-06-24 20:31:16,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-24 20:31:16,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-24 20:31:16,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-24 20:31:16,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-24 20:31:16,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:16" (1/1) ... [2021-06-24 20:31:16,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:16" (1/1) ... [2021-06-24 20:31:16,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:16" (1/1) ... [2021-06-24 20:31:16,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:16" (1/1) ... [2021-06-24 20:31:16,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:16" (1/1) ... [2021-06-24 20:31:16,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:16" (1/1) ... [2021-06-24 20:31:16,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:16" (1/1) ... [2021-06-24 20:31:16,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-24 20:31:16,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-24 20:31:16,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-24 20:31:16,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-24 20:31:16,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:16" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-24 20:31:16,614 INFO L124 BoogieDeclarations]: Specification and implementation of procedure DeviceThread given in one single declaration [2021-06-24 20:31:16,614 INFO L130 BoogieDeclarations]: Found specification of procedure DeviceThread [2021-06-24 20:31:16,614 INFO L138 BoogieDeclarations]: Found implementation of procedure DeviceThread [2021-06-24 20:31:16,614 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ServerThread given in one single declaration [2021-06-24 20:31:16,614 INFO L130 BoogieDeclarations]: Found specification of procedure ServerThread [2021-06-24 20:31:16,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ServerThread [2021-06-24 20:31:16,614 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-24 20:31:16,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-24 20:31:16,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-24 20:31:16,616 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-24 20:31:16,813 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-24 20:31:16,813 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-06-24 20:31:16,815 INFO L202 PluginConnector]: Adding new model bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:31:16 BoogieIcfgContainer [2021-06-24 20:31:16,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-24 20:31:16,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-24 20:31:16,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-24 20:31:16,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-24 20:31:16,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:16" (1/2) ... [2021-06-24 20:31:16,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e758919 and model type bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:31:16, skipping insertion in model container [2021-06-24 20:31:16,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:31:16" (2/2) ... [2021-06-24 20:31:16,820 INFO L111 eAbstractionObserver]: Analyzing ICFG bluetooth08-incorrect.bpl [2021-06-24 20:31:16,824 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-24 20:31:16,824 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-24 20:31:16,824 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-24 20:31:16,824 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-24 20:31:16,886 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-24 20:31:16,902 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-24 20:31:16,952 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-24 20:31:16,952 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-24 20:31:16,953 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-24 20:31:16,953 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-24 20:31:16,953 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-24 20:31:16,953 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-24 20:31:16,953 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-24 20:31:16,953 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == DeviceThreadThread1of1ForFork8======== [2021-06-24 20:31:17,227 INFO L430 AbstractCegarLoop]: === Iteration 1 === [DeviceThreadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-24 20:31:17,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-24 20:31:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1816535501, now seen corresponding path program 1 times [2021-06-24 20:31:17,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-24 20:31:17,237 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048577784] [2021-06-24 20:31:17,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-24 20:31:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-24 20:31:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-24 20:31:17,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-24 20:31:17,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048577784] [2021-06-24 20:31:17,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048577784] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-24 20:31:17,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-24 20:31:17,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-24 20:31:17,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137309107] [2021-06-24 20:31:17,329 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-24 20:31:17,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-24 20:31:17,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-24 20:31:17,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-24 20:31:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:17,337 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-24 20:31:17,339 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-24 20:31:17,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:17,962 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-24 20:31:17,962 INFO L430 AbstractCegarLoop]: === Iteration 2 === [DeviceThreadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-24 20:31:17,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-24 20:31:17,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1845742228, now seen corresponding path program 1 times [2021-06-24 20:31:17,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-24 20:31:17,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700598625] [2021-06-24 20:31:17,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-24 20:31:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-24 20:31:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5326 backedges. 690 proven. 0 refuted. 0 times theorem prover too weak. 4636 trivial. 0 not checked. [2021-06-24 20:31:18,205 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-24 20:31:18,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700598625] [2021-06-24 20:31:18,205 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700598625] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-24 20:31:18,205 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-24 20:31:18,205 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-24 20:31:18,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438544047] [2021-06-24 20:31:18,207 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-24 20:31:18,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-24 20:31:18,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-24 20:31:18,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-24 20:31:18,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:18,208 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-24 20:31:18,208 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-24 20:31:18,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:18,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:18,280 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-24 20:31:18,280 INFO L430 AbstractCegarLoop]: === Iteration 3 === [DeviceThreadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-24 20:31:18,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-24 20:31:18,283 INFO L82 PathProgramCache]: Analyzing trace with hash 660451925, now seen corresponding path program 2 times [2021-06-24 20:31:18,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-24 20:31:18,284 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993504305] [2021-06-24 20:31:18,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-24 20:31:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-24 20:31:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4729 backedges. 1496 proven. 1465 refuted. 0 times theorem prover too weak. 1768 trivial. 0 not checked. [2021-06-24 20:31:19,093 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-24 20:31:19,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993504305] [2021-06-24 20:31:19,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993504305] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-24 20:31:19,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000789002] [2021-06-24 20:31:19,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-24 20:31:19,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-24 20:31:19,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-24 20:31:19,207 WARN L261 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 334 conjunts are in the unsatisfiable core [2021-06-24 20:31:19,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-24 20:31:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4729 backedges. 48 proven. 2913 refuted. 0 times theorem prover too weak. 1768 trivial. 0 not checked. [2021-06-24 20:31:19,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000789002] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-24 20:31:19,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-24 20:31:19,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-24 20:31:19,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113857410] [2021-06-24 20:31:19,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-24 20:31:19,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-24 20:31:19,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-24 20:31:19,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-06-24 20:31:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:19,800 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-24 20:31:19,800 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 12 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-24 20:31:19,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:19,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:19,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:20,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:20,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-24 20:31:20,224 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-24 20:31:20,225 INFO L430 AbstractCegarLoop]: === Iteration 4 === [DeviceThreadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-24 20:31:20,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-24 20:31:20,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2140819239, now seen corresponding path program 3 times [2021-06-24 20:31:20,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-24 20:31:20,226 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397723666] [2021-06-24 20:31:20,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-24 20:31:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-24 20:31:20,276 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-24 20:31:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-24 20:31:20,349 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-24 20:31:20,401 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-24 20:31:20,401 INFO L605 BasicCegarLoop]: Counterexample might be feasible [2021-06-24 20:31:20,401 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-24 20:31:20,407 INFO L301 ceAbstractionStarter]: Result for error location DeviceThreadThread1of1ForFork8 was UNSAFE (1/9) [2021-06-24 20:31:20,409 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-24 20:31:20,468 INFO L202 PluginConnector]: Adding new model bluetooth08-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:31:20 BasicIcfg [2021-06-24 20:31:20,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-24 20:31:20,469 INFO L168 Benchmark]: Toolchain (without parser) took 3962.21 ms. Allocated memory was 190.8 MB in the beginning and 267.4 MB in the end (delta: 76.5 MB). Free memory was 171.1 MB in the beginning and 161.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 86.7 MB. Max. memory is 8.0 GB. [2021-06-24 20:31:20,470 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.11 ms. Allocated memory is still 190.8 MB. Free memory is still 172.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-24 20:31:20,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.28 ms. Allocated memory is still 190.8 MB. Free memory was 171.1 MB in the beginning and 169.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-24 20:31:20,472 INFO L168 Benchmark]: Boogie Preprocessor took 12.90 ms. Allocated memory is still 190.8 MB. Free memory was 169.2 MB in the beginning and 168.4 MB in the end (delta: 812.6 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-24 20:31:20,472 INFO L168 Benchmark]: RCFGBuilder took 263.49 ms. Allocated memory is still 190.8 MB. Free memory was 168.3 MB in the beginning and 155.6 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-24 20:31:20,472 INFO L168 Benchmark]: TraceAbstraction took 3652.40 ms. Allocated memory was 190.8 MB in the beginning and 267.4 MB in the end (delta: 76.5 MB). Free memory was 155.1 MB in the beginning and 161.5 MB in the end (delta: -6.4 MB). Peak memory consumption was 71.0 MB. Max. memory is 8.0 GB. [2021-06-24 20:31:20,473 INFO L339 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.11 ms. Allocated memory is still 190.8 MB. Free memory is still 172.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 29.28 ms. Allocated memory is still 190.8 MB. Free memory was 171.1 MB in the beginning and 169.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 12.90 ms. Allocated memory is still 190.8 MB. Free memory was 169.2 MB in the beginning and 168.4 MB in the end (delta: 812.6 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 263.49 ms. Allocated memory is still 190.8 MB. Free memory was 168.3 MB in the beginning and 155.6 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3652.40 ms. Allocated memory was 190.8 MB in the beginning and 267.4 MB in the end (delta: 76.5 MB). Free memory was 155.1 MB in the beginning and 161.5 MB in the end (delta: -6.4 MB). Peak memory consumption was 71.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6014, positive: 5833, positive conditional: 0, positive unconditional: 5833, negative: 181, negative conditional: 0, negative unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6014, positive: 5833, positive conditional: 0, positive unconditional: 5833, negative: 181, negative conditional: 0, negative unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6014, positive: 5833, positive conditional: 0, positive unconditional: 5833, negative: 181, negative conditional: 0, negative unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3491, positive: 3384, positive conditional: 0, positive unconditional: 3384, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3491, positive: 3296, positive conditional: 0, positive unconditional: 3296, negative: 195, negative conditional: 0, negative unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 195, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 195, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 477, positive: 218, positive conditional: 0, positive unconditional: 218, negative: 260, negative conditional: 0, negative unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6014, positive: 2449, positive conditional: 0, positive unconditional: 2449, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 3491, unknown conditional: 0, unknown unconditional: 3491] , Statistics on independence cache: Total cache size (in pairs): 3491, Positive cache size: 3384, Positive conditional cache size: 0, Positive unconditional cache size: 3384, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, SemanticConditionEliminator.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 195, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 477, positive: 218, positive conditional: 0, positive unconditional: 218, negative: 260, negative conditional: 0, negative unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3491, Positive cache size: 3384, Positive conditional cache size: 0, Positive unconditional cache size: 3384, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, Eliminated conditions: 0, SemanticConditionEliminator.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 195, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 477, positive: 218, positive conditional: 0, positive unconditional: 218, negative: 260, negative conditional: 0, negative unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3491, Positive cache size: 3384, Positive conditional cache size: 0, Positive unconditional cache size: 3384, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, Eliminated conditions: 0, SemanticConditionEliminator.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 195, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 477, positive: 218, positive conditional: 0, positive unconditional: 218, negative: 260, negative conditional: 0, negative unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3491, Positive cache size: 3384, Positive conditional cache size: 0, Positive unconditional cache size: 3384, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, Eliminated conditions: 0 ], Maximal queried relation: 2, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 660, Number of persistent set computation: 395, Number of trivial persistent sets: 40, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6014, positive: 5833, positive conditional: 0, positive unconditional: 5833, negative: 181, negative conditional: 0, negative unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6014, positive: 5833, positive conditional: 0, positive unconditional: 5833, negative: 181, negative conditional: 0, negative unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6014, positive: 5833, positive conditional: 0, positive unconditional: 5833, negative: 181, negative conditional: 0, negative unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3491, positive: 3384, positive conditional: 0, positive unconditional: 3384, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3491, positive: 3296, positive conditional: 0, positive unconditional: 3296, negative: 195, negative conditional: 0, negative unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 195, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 195, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 477, positive: 218, positive conditional: 0, positive unconditional: 218, negative: 260, negative conditional: 0, negative unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6014, positive: 2449, positive conditional: 0, positive unconditional: 2449, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 3491, unknown conditional: 0, unknown unconditional: 3491] , Statistics on independence cache: Total cache size (in pairs): 3491, Positive cache size: 3384, Positive conditional cache size: 0, Positive unconditional cache size: 3384, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, SemanticConditionEliminator.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 195, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 477, positive: 218, positive conditional: 0, positive unconditional: 218, negative: 260, negative conditional: 0, negative unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3491, Positive cache size: 3384, Positive conditional cache size: 0, Positive unconditional cache size: 3384, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, Eliminated conditions: 0, SemanticConditionEliminator.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 195, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 477, positive: 218, positive conditional: 0, positive unconditional: 218, negative: 260, negative conditional: 0, negative unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3491, Positive cache size: 3384, Positive conditional cache size: 0, Positive unconditional cache size: 3384, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, Eliminated conditions: 0, SemanticConditionEliminator.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 195, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 477, positive: 218, positive conditional: 0, positive unconditional: 218, negative: 260, negative conditional: 0, negative unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 169, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3491, Positive cache size: 3384, Positive conditional cache size: 0, Positive unconditional cache size: 3384, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, Eliminated conditions: 0 ], Maximal queried relation: 2, Independence queries for same thread: 0 - CounterExampleResult [Line: 39]: assertion can be violated assertion can be violated We found a FailurePath: [L13] 0 pendingIo := 1; VAL [pendingIo=1] [L14] 0 stopped := false; VAL [pendingIo=1, stopped=false] [L15] 0 stoppingEvent := false; VAL [pendingIo=1, stopped=false, stoppingEvent=false] [L16] 0 stoppingFlag := false; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L18] FORK 0 fork 0 ServerThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L19] FORK 0 fork 1 DeviceThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L20] FORK 0 fork 2 DeviceThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L21] FORK 0 fork 3 DeviceThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L22] FORK 0 fork 4 DeviceThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L23] FORK 0 fork 5 DeviceThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L24] FORK 0 fork 6 DeviceThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L25] FORK 0 fork 7 DeviceThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L26] FORK 0 fork 8 DeviceThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 7 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 7 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 7 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 8 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 7 pendingIo := pendingIo - 1; [L59] COND FALSE 7 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 7 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 7 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 8 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 7 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 7 pendingIo := pendingIo - 1; [L59] COND FALSE 7 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 7 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 8 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 7 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 7 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 7 pendingIo := pendingIo - 1; [L59] COND FALSE 7 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 8 pendingIo := pendingIo - 1; [L59] COND FALSE 8 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 8 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 8 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 5 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 8 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 8 pendingIo := pendingIo - 1; [L59] COND FALSE 8 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 8 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 8 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 8 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 8 pendingIo := pendingIo - 1; [L59] COND FALSE 8 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 5 pendingIo := pendingIo - 1; [L59] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 6 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 5 pendingIo := pendingIo - 1; [L59] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 6 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 6 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 6 pendingIo := pendingIo - 1; [L59] COND FALSE 6 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 3 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 3 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 3 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 4 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 3 pendingIo := pendingIo - 1; [L59] COND FALSE 3 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 3 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 3 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 4 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 3 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 3 pendingIo := pendingIo - 1; [L59] COND FALSE 3 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 3 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 4 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 3 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 3 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 3 pendingIo := pendingIo - 1; [L59] COND FALSE 3 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 4 pendingIo := pendingIo - 1; [L59] COND FALSE 4 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 4 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 4 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 2 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 4 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 4 pendingIo := pendingIo - 1; [L59] COND FALSE 4 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 4 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 2 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 4 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 4 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 4 pendingIo := pendingIo - 1; [L59] COND FALSE 4 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 2 pendingIo := pendingIo - 1; [L59] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 2 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L39] 9 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L58] 9 pendingIo := pendingIo - 1; [L59] COND FALSE 9 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L49] 9 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L71] 1 stoppingFlag := true; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=true] [L50] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=true] [L39] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=true] [L58] 2 pendingIo := pendingIo - 1; [L59] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=true] [L81] 1 pendingIo := pendingIo - 1; [L82] COND TRUE 1 pendingIo == 0 [L83] 1 stoppingEvent := true; VAL [pendingIo=0, stopped=false, stoppingEvent=true, stoppingFlag=true] [L50] 9 pendingIo := pendingIo + 1; VAL [pendingIo=1, stopped=false, stoppingEvent=true, stoppingFlag=true] [L73] 1 assume stoppingEvent; VAL [pendingIo=1, stopped=false, stoppingEvent=true, stoppingFlag=true] [L74] 1 stopped := true; VAL [pendingIo=1, stopped=true, stoppingEvent=true, stoppingFlag=true] [L39] 9 assert !stopped; VAL [pendingIo=1, stopped=true, stoppingEvent=true, stoppingFlag=true] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: DeviceThreadThread1of1ForFork8 with 1 thread instances CFG has 12 procedures, 90 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3483.5ms, OverallIterations: 4, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16.2ms, PartialOrderReductionTime: 1162.9ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 41.6ms SsaConstructionTime, 365.4ms SatisfiabilityAnalysisTime, 1407.1ms InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 885 ConstructedInterpolants, 0 QuantifiedInterpolants, 3719 SizeOfPredicates, 1 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 334 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 10406/14784 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...