/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/bluetooth05-incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d310483fe8b4879eee5de19363f50e4b839cc4ec-d310483 [2021-06-24 20:31:12,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-24 20:31:12,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-24 20:31:12,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-24 20:31:12,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-24 20:31:12,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-24 20:31:12,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-24 20:31:12,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-24 20:31:12,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-24 20:31:12,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-24 20:31:12,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-24 20:31:12,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-24 20:31:12,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-24 20:31:12,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-24 20:31:12,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-24 20:31:12,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-24 20:31:12,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-24 20:31:12,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-24 20:31:12,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-24 20:31:12,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-24 20:31:12,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-24 20:31:12,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-24 20:31:12,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-24 20:31:12,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-24 20:31:12,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-24 20:31:12,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-24 20:31:12,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-24 20:31:12,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-24 20:31:12,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-24 20:31:12,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-24 20:31:12,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-24 20:31:12,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-24 20:31:12,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-24 20:31:12,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-24 20:31:12,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-24 20:31:12,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-24 20:31:12,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-24 20:31:12,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-24 20:31:12,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-24 20:31:12,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-24 20:31:12,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-24 20:31:12,814 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:12,870 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-24 20:31:12,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-24 20:31:12,870 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-24 20:31:12,871 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-24 20:31:12,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-24 20:31:12,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-24 20:31:12,873 INFO L138 SettingsManager]: * Use SBE=true [2021-06-24 20:31:12,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-24 20:31:12,873 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-24 20:31:12,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-24 20:31:12,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-24 20:31:12,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-24 20:31:12,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-24 20:31:12,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-24 20:31:12,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-24 20:31:12,874 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-24 20:31:12,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-24 20:31:12,875 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-24 20:31:12,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-24 20:31:12,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-24 20:31:12,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-24 20:31:12,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-24 20:31:12,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-24 20:31:12,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-24 20:31:12,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-24 20:31:12,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-24 20:31:12,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-24 20:31:12,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-24 20:31:12,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-24 20:31:12,876 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-24 20:31:12,876 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-24 20:31:12,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-24 20:31:12,877 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SETS [2021-06-24 20:31:12,877 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:13,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-24 20:31:13,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-24 20:31:13,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-24 20:31:13,279 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-24 20:31:13,290 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-24 20:31:13,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2022/bluetooth05-incorrect.bpl [2021-06-24 20:31:13,291 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2022/bluetooth05-incorrect.bpl' [2021-06-24 20:31:13,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-24 20:31:13,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-24 20:31:13,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-24 20:31:13,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-24 20:31:13,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-24 20:31:13,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:13" (1/1) ... [2021-06-24 20:31:13,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:13" (1/1) ... [2021-06-24 20:31:13,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-24 20:31:13,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-24 20:31:13,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-24 20:31:13,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-24 20:31:13,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:13" (1/1) ... [2021-06-24 20:31:13,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:13" (1/1) ... [2021-06-24 20:31:13,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:13" (1/1) ... [2021-06-24 20:31:13,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:13" (1/1) ... [2021-06-24 20:31:13,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:13" (1/1) ... [2021-06-24 20:31:13,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:13" (1/1) ... [2021-06-24 20:31:13,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:13" (1/1) ... [2021-06-24 20:31:13,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-24 20:31:13,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-24 20:31:13,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-24 20:31:13,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-24 20:31:13,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:13" (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:13,537 INFO L124 BoogieDeclarations]: Specification and implementation of procedure DeviceThread given in one single declaration [2021-06-24 20:31:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure DeviceThread [2021-06-24 20:31:13,538 INFO L138 BoogieDeclarations]: Found implementation of procedure DeviceThread [2021-06-24 20:31:13,538 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ServerThread given in one single declaration [2021-06-24 20:31:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure ServerThread [2021-06-24 20:31:13,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ServerThread [2021-06-24 20:31:13,538 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-24 20:31:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-24 20:31:13,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-24 20:31:13,540 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:13,884 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-24 20:31:13,885 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-06-24 20:31:13,886 INFO L202 PluginConnector]: Adding new model bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:31:13 BoogieIcfgContainer [2021-06-24 20:31:13,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-24 20:31:13,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-24 20:31:13,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-24 20:31:13,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-24 20:31:13,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.06 08:31:13" (1/2) ... [2021-06-24 20:31:13,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563ff0d5 and model type bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:31:13, skipping insertion in model container [2021-06-24 20:31:13,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:31:13" (2/2) ... [2021-06-24 20:31:13,891 INFO L111 eAbstractionObserver]: Analyzing ICFG bluetooth05-incorrect.bpl [2021-06-24 20:31:13,907 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-24 20:31:13,907 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-24 20:31:13,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-24 20:31:13,908 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-24 20:31:13,968 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-24 20:31:13,997 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 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) [2021-06-24 20:31:14,126 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-24 20:31:14,127 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-24 20:31:14,127 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-24 20:31:14,127 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-24 20:31:14,127 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-24 20:31:14,127 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-24 20:31:14,127 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-24 20:31:14,127 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-24 20:31:14,307 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (1/6) [2021-06-24 20:31:14,309 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-24 20:31:14,322 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-24 20:31:14,323 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-24 20:31:14,323 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-24 20:31:14,323 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-24 20:31:14,323 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-24 20:31:14,323 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-24 20:31:14,323 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-24 20:31:14,323 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == DeviceThreadThread1of1ForFork4======== [2021-06-24 20:31:14,479 INFO L430 AbstractCegarLoop]: === Iteration 1 === [DeviceThreadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-24 20:31:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-24 20:31:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1347614714, now seen corresponding path program 1 times [2021-06-24 20:31:14,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-24 20:31:14,488 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892909710] [2021-06-24 20:31:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-24 20:31:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-24 20:31:14,665 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:14,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-24 20:31:14,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892909710] [2021-06-24 20:31:14,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892909710] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-24 20:31:14,666 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-24 20:31:14,666 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-24 20:31:14,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219924665] [2021-06-24 20:31:14,672 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-24 20:31:14,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-24 20:31:14,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-24 20:31:14,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-24 20:31:14,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:14,694 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-24 20:31:14,694 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:14,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:15,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:15,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-24 20:31:15,216 INFO L430 AbstractCegarLoop]: === Iteration 2 === [DeviceThreadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-24 20:31:15,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-24 20:31:15,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2138101275, now seen corresponding path program 1 times [2021-06-24 20:31:15,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-24 20:31:15,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004962770] [2021-06-24 20:31:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-24 20:31:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-24 20:31:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2122 backedges. 1003 proven. 0 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2021-06-24 20:31:15,436 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-24 20:31:15,436 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004962770] [2021-06-24 20:31:15,436 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004962770] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-24 20:31:15,437 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-24 20:31:15,437 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-24 20:31:15,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190880853] [2021-06-24 20:31:15,439 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-24 20:31:15,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-24 20:31:15,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-24 20:31:15,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-24 20:31:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:15,447 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-24 20:31:15,447 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:15,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:15,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:15,641 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-24 20:31:15,641 INFO L430 AbstractCegarLoop]: === Iteration 3 === [DeviceThreadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-24 20:31:15,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-24 20:31:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1431227658, now seen corresponding path program 1 times [2021-06-24 20:31:15,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-24 20:31:15,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837011960] [2021-06-24 20:31:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-24 20:31:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-24 20:31:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 337 proven. 283 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2021-06-24 20:31:16,224 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-24 20:31:16,225 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837011960] [2021-06-24 20:31:16,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837011960] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-24 20:31:16,225 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819730313] [2021-06-24 20:31:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-24 20:31:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-24 20:31:16,318 WARN L261 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 154 conjunts are in the unsatisfiable core [2021-06-24 20:31:16,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-24 20:31:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 21 proven. 599 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2021-06-24 20:31:16,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819730313] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-24 20:31:16,857 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-24 20:31:16,857 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-24 20:31:16,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137290511] [2021-06-24 20:31:16,858 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-24 20:31:16,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-24 20:31:16,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-24 20:31:16,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-06-24 20:31:16,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:16,860 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-24 20:31:16,860 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 12 states have internal predecessors, (105), 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:16,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:16,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:16,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-24 20:31:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-24 20:31:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-24 20:31:17,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-24 20:31:17,392 INFO L430 AbstractCegarLoop]: === Iteration 4 === [DeviceThreadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-24 20:31:17,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-24 20:31:17,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1223007478, now seen corresponding path program 1 times [2021-06-24 20:31:17,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-24 20:31:17,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915855365] [2021-06-24 20:31:17,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-24 20:31:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-24 20:31:17,461 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-24 20:31:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-24 20:31:17,532 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-24 20:31:17,589 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-24 20:31:17,589 INFO L605 BasicCegarLoop]: Counterexample might be feasible [2021-06-24 20:31:17,590 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-24 20:31:17,593 INFO L301 ceAbstractionStarter]: Result for error location DeviceThreadThread1of1ForFork4 was UNSAFE (2/6) [2021-06-24 20:31:17,601 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-24 20:31:17,679 INFO L202 PluginConnector]: Adding new model bluetooth05-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:31:17 BasicIcfg [2021-06-24 20:31:17,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-24 20:31:17,680 INFO L168 Benchmark]: Toolchain (without parser) took 4363.86 ms. Allocated memory was 195.0 MB in the beginning and 256.9 MB in the end (delta: 61.9 MB). Free memory was 174.8 MB in the beginning and 178.4 MB in the end (delta: -3.7 MB). Peak memory consumption was 58.2 MB. Max. memory is 8.0 GB. [2021-06-24 20:31:17,680 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.11 ms. Allocated memory is still 195.0 MB. Free memory is still 175.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-24 20:31:17,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.45 ms. Allocated memory is still 195.0 MB. Free memory was 174.7 MB in the beginning and 172.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-24 20:31:17,680 INFO L168 Benchmark]: Boogie Preprocessor took 20.52 ms. Allocated memory is still 195.0 MB. Free memory was 172.9 MB in the beginning and 172.0 MB in the end (delta: 853.2 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-24 20:31:17,681 INFO L168 Benchmark]: RCFGBuilder took 490.02 ms. Allocated memory is still 195.0 MB. Free memory was 171.9 MB in the beginning and 159.2 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:17,681 INFO L168 Benchmark]: TraceAbstraction took 3792.26 ms. Allocated memory was 195.0 MB in the beginning and 256.9 MB in the end (delta: 61.9 MB). Free memory was 158.7 MB in the beginning and 178.4 MB in the end (delta: -19.7 MB). Peak memory consumption was 42.5 MB. Max. memory is 8.0 GB. [2021-06-24 20:31:17,681 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 195.0 MB. Free memory is still 175.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 41.45 ms. Allocated memory is still 195.0 MB. Free memory was 174.7 MB in the beginning and 172.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 20.52 ms. Allocated memory is still 195.0 MB. Free memory was 172.9 MB in the beginning and 172.0 MB in the end (delta: 853.2 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 490.02 ms. Allocated memory is still 195.0 MB. Free memory was 171.9 MB in the beginning and 159.2 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3792.26 ms. Allocated memory was 195.0 MB in the beginning and 256.9 MB in the end (delta: 61.9 MB). Free memory was 158.7 MB in the beginning and 178.4 MB in the end (delta: -19.7 MB). Peak memory consumption was 42.5 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: 1205, positive: 1200, positive conditional: 0, positive unconditional: 1200, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1205, positive: 1200, positive conditional: 0, positive unconditional: 1200, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 1205, positive: 1200, positive conditional: 0, positive unconditional: 1200, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 941, positive: 936, positive conditional: 0, positive unconditional: 936, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 941, positive: 931, positive conditional: 0, positive unconditional: 931, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1205, positive: 264, positive conditional: 0, positive unconditional: 264, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 941, unknown conditional: 0, unknown unconditional: 941] , Statistics on independence cache: Total cache size (in pairs): 941, Positive cache size: 936, Positive conditional cache size: 0, Positive unconditional cache size: 936, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 ], Maximal queried relation: 0, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 142, Number of persistent set computation: 15, Number of trivial persistent sets: 10, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1205, positive: 1200, positive conditional: 0, positive unconditional: 1200, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1205, positive: 1200, positive conditional: 0, positive unconditional: 1200, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 1205, positive: 1200, positive conditional: 0, positive unconditional: 1200, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 941, positive: 936, positive conditional: 0, positive unconditional: 936, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 941, positive: 931, positive conditional: 0, positive unconditional: 931, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1205, positive: 264, positive conditional: 0, positive unconditional: 264, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 941, unknown conditional: 0, unknown unconditional: 941] , Statistics on independence cache: Total cache size (in pairs): 941, Positive cache size: 936, Positive conditional cache size: 0, Positive unconditional cache size: 936, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 ], Maximal queried relation: 0, Independence queries for same thread: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2844, positive: 2733, positive conditional: 0, positive unconditional: 2733, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 2844, positive: 2733, positive conditional: 0, positive unconditional: 2733, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 2844, positive: 2733, positive conditional: 0, positive unconditional: 2733, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1596, positive: 1539, positive conditional: 0, positive unconditional: 1539, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1596, positive: 1488, positive conditional: 0, positive unconditional: 1488, negative: 108, negative conditional: 0, negative unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 108, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 388, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 252, negative conditional: 0, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2844, positive: 1194, positive conditional: 0, positive unconditional: 1194, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 1596, unknown conditional: 0, unknown unconditional: 1596] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1539, Positive conditional cache size: 0, Positive unconditional cache size: 1539, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 108, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 388, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 252, negative conditional: 0, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1539, Positive conditional cache size: 0, Positive unconditional cache size: 1539, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Eliminated conditions: 0, SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 108, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 388, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 252, negative conditional: 0, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1539, Positive conditional cache size: 0, Positive unconditional cache size: 1539, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Eliminated conditions: 0, SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 108, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 388, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 252, negative conditional: 0, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1539, Positive conditional cache size: 0, Positive unconditional cache size: 1539, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Eliminated conditions: 0 ], Maximal queried relation: 3, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 628, Number of persistent set computation: 1251, Number of trivial persistent sets: 948, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2844, positive: 2733, positive conditional: 0, positive unconditional: 2733, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 2844, positive: 2733, positive conditional: 0, positive unconditional: 2733, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 2844, positive: 2733, positive conditional: 0, positive unconditional: 2733, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1596, positive: 1539, positive conditional: 0, positive unconditional: 1539, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1596, positive: 1488, positive conditional: 0, positive unconditional: 1488, negative: 108, negative conditional: 0, negative unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 108, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 388, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 252, negative conditional: 0, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2844, positive: 1194, positive conditional: 0, positive unconditional: 1194, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 1596, unknown conditional: 0, unknown unconditional: 1596] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1539, Positive conditional cache size: 0, Positive unconditional cache size: 1539, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 108, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 388, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 252, negative conditional: 0, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1539, Positive conditional cache size: 0, Positive unconditional cache size: 1539, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Eliminated conditions: 0, SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 108, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 388, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 252, negative conditional: 0, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1539, Positive conditional cache size: 0, Positive unconditional cache size: 1539, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Eliminated conditions: 0, SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 108, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 388, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 252, negative conditional: 0, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1539, Positive conditional cache size: 0, Positive unconditional cache size: 1539, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Eliminated conditions: 0 ], Maximal queried relation: 3, Independence queries for same thread: 0 - CounterExampleResult [Line: 36]: 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] [L46] 5 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 3 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 3 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 3 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 4 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 3 pendingIo := pendingIo - 1; [L56] COND FALSE 3 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 3 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 3 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 4 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 3 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 3 pendingIo := pendingIo - 1; [L56] COND FALSE 3 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 3 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 4 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 3 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 3 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 3 pendingIo := pendingIo - 1; [L56] COND FALSE 3 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 4 pendingIo := pendingIo - 1; [L56] COND FALSE 4 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 4 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 4 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 2 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 4 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 4 pendingIo := pendingIo - 1; [L56] COND FALSE 4 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 4 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 4 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 4 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 4 pendingIo := pendingIo - 1; [L56] COND FALSE 4 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 2 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 2 pendingIo := pendingIo - 1; [L56] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 2 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L23] FORK 0 fork 5 DeviceThread(); VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 6 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 6 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 6 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 2 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 6 pendingIo := pendingIo - 1; [L56] COND FALSE 6 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 6 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 6 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 2 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 6 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 6 pendingIo := pendingIo - 1; [L56] COND FALSE 6 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 6 assume !stoppingFlag; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 2 pendingIo := pendingIo - 1; [L56] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 6 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 6 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 6 pendingIo := pendingIo - 1; [L56] COND FALSE 6 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 2 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L47] 2 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 5 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L55] 5 pendingIo := pendingIo - 1; [L56] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L46] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L36] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L68] 1 stoppingFlag := true; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=true] [L55] 2 pendingIo := pendingIo - 1; [L56] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=true] [L78] 1 pendingIo := pendingIo - 1; [L79] COND TRUE 1 pendingIo == 0 [L80] 1 stoppingEvent := true; VAL [pendingIo=0, stopped=false, stoppingEvent=true, stoppingFlag=true] [L47] 5 pendingIo := pendingIo + 1; VAL [pendingIo=1, stopped=false, stoppingEvent=true, stoppingFlag=true] [L70] 1 assume stoppingEvent; VAL [pendingIo=1, stopped=false, stoppingEvent=true, stoppingFlag=true] [L71] 1 stopped := true; VAL [pendingIo=1, stopped=true, stoppingEvent=true, stoppingFlag=true] [L36] 5 assert !stopped; VAL [pendingIo=1, stopped=true, stoppingEvent=true, stoppingFlag=true] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 66 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 281.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.5ms, PartialOrderReductionTime: 159.5ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: DeviceThreadThread1of1ForFork4 with 1 thread instances CFG has 9 procedures, 66 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3276.8ms, OverallIterations: 4, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.9ms, PartialOrderReductionTime: 1181.7ms, 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: 31.3ms SsaConstructionTime, 368.1ms SatisfiabilityAnalysisTime, 1155.6ms InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 467 ConstructedInterpolants, 0 QuantifiedInterpolants, 1777 SizeOfPredicates, 1 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 3118/4000 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...