/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-None-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2022/bluetooth-incorrect05.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 16:28:48,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 16:28:48,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 16:28:48,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 16:28:48,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 16:28:48,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 16:28:48,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 16:28:48,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 16:28:48,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 16:28:48,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 16:28:48,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 16:28:48,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 16:28:48,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 16:28:48,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 16:28:48,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 16:28:48,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 16:28:48,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 16:28:48,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 16:28:48,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 16:28:48,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 16:28:48,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 16:28:48,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 16:28:48,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 16:28:48,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 16:28:48,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 16:28:48,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 16:28:48,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 16:28:48,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 16:28:48,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 16:28:48,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 16:28:48,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 16:28:48,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 16:28:48,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 16:28:48,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 16:28:48,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 16:28:48,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 16:28:48,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 16:28:48,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 16:28:48,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 16:28:48,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 16:28:48,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 16:28:48,980 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-None-NoLbe.epf [2021-08-21 16:28:49,000 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 16:28:49,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 16:28:49,001 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-21 16:28:49,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-21 16:28:49,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 16:28:49,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 16:28:49,004 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 16:28:49,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 16:28:49,004 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 16:28:49,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 16:28:49,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 16:28:49,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 16:28:49,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 16:28:49,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 16:28:49,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 16:28:49,005 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 16:28:49,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 16:28:49,005 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 16:28:49,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 16:28:49,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 16:28:49,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 16:28:49,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 16:28:49,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 16:28:49,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 16:28:49,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 16:28:49,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 16:28:49,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 16:28:49,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 16:28:49,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 16:28:49,007 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 16:28:49,007 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-08-21 16:28:49,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 16:28:49,007 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-08-21 16:28:49,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 16:28:49,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 16:28:49,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 16:28:49,259 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-08-21 16:28:49,261 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-08-21 16:28:49,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2022/bluetooth-incorrect05.bpl [2021-08-21 16:28:49,261 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2022/bluetooth-incorrect05.bpl' [2021-08-21 16:28:49,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 16:28:49,287 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-08-21 16:28:49,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 16:28:49,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 16:28:49,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 16:28:49,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 04:28:49" (1/1) ... [2021-08-21 16:28:49,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 04:28:49" (1/1) ... [2021-08-21 16:28:49,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 16:28:49,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 16:28:49,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 16:28:49,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 16:28:49,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 04:28:49" (1/1) ... [2021-08-21 16:28:49,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 04:28:49" (1/1) ... [2021-08-21 16:28:49,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 04:28:49" (1/1) ... [2021-08-21 16:28:49,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 04:28:49" (1/1) ... [2021-08-21 16:28:49,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 04:28:49" (1/1) ... [2021-08-21 16:28:49,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 04:28:49" (1/1) ... [2021-08-21 16:28:49,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 04:28:49" (1/1) ... [2021-08-21 16:28:49,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 16:28:49,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 16:28:49,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 16:28:49,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 16:28:49,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 04:28:49" (1/1) ... [2021-08-21 16:28:49,330 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 16:28:49,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 16:28:49,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-21 16:28:49,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-21 16:28:49,375 INFO L124 BoogieDeclarations]: Specification and implementation of procedure DeviceThreadWithAssert given in one single declaration [2021-08-21 16:28:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure DeviceThreadWithAssert [2021-08-21 16:28:49,376 INFO L138 BoogieDeclarations]: Found implementation of procedure DeviceThreadWithAssert [2021-08-21 16:28:49,376 INFO L124 BoogieDeclarations]: Specification and implementation of procedure DeviceThread given in one single declaration [2021-08-21 16:28:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure DeviceThread [2021-08-21 16:28:49,376 INFO L138 BoogieDeclarations]: Found implementation of procedure DeviceThread [2021-08-21 16:28:49,376 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ServerThread given in one single declaration [2021-08-21 16:28:49,377 INFO L130 BoogieDeclarations]: Found specification of procedure ServerThread [2021-08-21 16:28:49,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ServerThread [2021-08-21 16:28:49,378 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-08-21 16:28:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 16:28:49,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 16:28:49,379 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 16:28:49,557 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 16:28:49,557 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-08-21 16:28:49,558 INFO L202 PluginConnector]: Adding new model bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 04:28:49 BoogieIcfgContainer [2021-08-21 16:28:49,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 16:28:49,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 16:28:49,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 16:28:49,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 16:28:49,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.08 04:28:49" (1/2) ... [2021-08-21 16:28:49,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8692db and model type bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 04:28:49, skipping insertion in model container [2021-08-21 16:28:49,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 04:28:49" (2/2) ... [2021-08-21 16:28:49,563 INFO L111 eAbstractionObserver]: Analyzing ICFG bluetooth-incorrect05.bpl [2021-08-21 16:28:49,566 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 16:28:49,566 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 16:28:49,566 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-21 16:28:49,567 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 16:28:49,601 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-21 16:28:49,657 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-08-21 16:28:49,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 16:28:49,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-08-21 16:28:49,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2021-08-21 16:28:49,690 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 16:28:49,694 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 16:28:49,695 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-08-21 16:28:49,701 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 44 transitions, 118 flow [2021-08-21 16:28:50,686 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 18431 states, 18429 states have (on average 6.1745075695914045) internal successors, (113790), 18430 states have internal predecessors, (113790), 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-08-21 16:28:50,700 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting DeviceThreadWithAssertErr0ASSERT_VIOLATIONASSERT === [DeviceThreadWithAssertErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 4 more)] === [2021-08-21 16:28:50,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 16:28:50,706 INFO L82 PathProgramCache]: Analyzing trace with hash -752326333, now seen corresponding path program 1 times [2021-08-21 16:28:50,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 16:28:50,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721994557] [2021-08-21 16:28:50,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 16:28:50,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 16:28:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 16:28:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 16:28:50,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 16:28:50,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721994557] [2021-08-21 16:28:50,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721994557] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 16:28:50,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 16:28:50,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 16:28:50,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259405726] [2021-08-21 16:28:50,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 16:28:50,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 16:28:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 16:28:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 16:28:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-21 16:28:50,810 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-08-21 16:28:50,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-08-21 16:28:50,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-08-21 16:28:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 16:28:50,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 16:28:50,868 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting DeviceThreadWithAssertErr0ASSERT_VIOLATIONASSERT === [DeviceThreadWithAssertErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 4 more)] === [2021-08-21 16:28:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 16:28:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash -208999560, now seen corresponding path program 1 times [2021-08-21 16:28:50,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 16:28:50,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869235402] [2021-08-21 16:28:50,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 16:28:50,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 16:28:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 16:28:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2021-08-21 16:28:51,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 16:28:51,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869235402] [2021-08-21 16:28:51,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869235402] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 16:28:51,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 16:28:51,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-21 16:28:51,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319989646] [2021-08-21 16:28:51,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 16:28:51,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 16:28:51,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 16:28:51,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 16:28:51,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-21 16:28:51,006 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-08-21 16:28:51,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-08-21 16:28:51,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-08-21 16:28:51,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-08-21 16:28:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 16:28:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 16:28:51,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 16:28:51,040 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting DeviceThreadWithAssertErr0ASSERT_VIOLATIONASSERT === [DeviceThreadWithAssertErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 4 more)] === [2021-08-21 16:28:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 16:28:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1131707431, now seen corresponding path program 2 times [2021-08-21 16:28:51,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 16:28:51,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137187918] [2021-08-21 16:28:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 16:28:51,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 16:28:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 16:28:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 207 proven. 146 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2021-08-21 16:28:51,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 16:28:51,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137187918] [2021-08-21 16:28:51,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137187918] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-21 16:28:51,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398939772] [2021-08-21 16:28:51,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-21 16:28:51,609 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-21 16:28:51,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 16:28:51,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-21 16:28:51,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-21 16:28:51,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-21 16:28:51,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-21 16:28:51,744 WARN L261 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 129 conjunts are in the unsatisfiable core [2021-08-21 16:28:51,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-21 16:28:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 18 proven. 335 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2021-08-21 16:28:52,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398939772] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-21 16:28:52,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-21 16:28:52,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-08-21 16:28:52,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755847081] [2021-08-21 16:28:52,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-21 16:28:52,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 16:28:52,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-21 16:28:52,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-08-21 16:28:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-21 16:28:52,756 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-08-21 16:28:52,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 12 states have internal predecessors, (87), 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-08-21 16:28:52,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-08-21 16:28:52,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-08-21 16:28:52,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-08-21 16:28:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 16:28:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 16:28:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-21 16:28:52,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-21 16:28:53,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-08-21 16:28:53,099 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting DeviceThreadWithAssertErr0ASSERT_VIOLATIONASSERT === [DeviceThreadWithAssertErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 4 more)] === [2021-08-21 16:28:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 16:28:53,100 INFO L82 PathProgramCache]: Analyzing trace with hash 686482253, now seen corresponding path program 3 times [2021-08-21 16:28:53,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 16:28:53,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182874654] [2021-08-21 16:28:53,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 16:28:53,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 16:28:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 16:28:53,126 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 16:28:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 16:28:53,185 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 16:28:53,186 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 16:28:53,186 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location DeviceThreadWithAssertErr0ASSERT_VIOLATIONASSERT [2021-08-21 16:28:53,188 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location DeviceThreadWithAssertErr0ASSERT_VIOLATIONASSERT [2021-08-21 16:28:53,188 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 16:28:53,188 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 16:28:53,188 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-21 16:28:53,188 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-08-21 16:28:53,188 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4INUSE_VIOLATION [2021-08-21 16:28:53,189 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5INUSE_VIOLATION [2021-08-21 16:28:53,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 16:28:53,195 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 16:28:53,196 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 16:28:53,235 INFO L202 PluginConnector]: Adding new model bluetooth-incorrect05.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 04:28:53 BasicIcfg [2021-08-21 16:28:53,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 16:28:53,237 INFO L168 Benchmark]: Toolchain (without parser) took 3948.63 ms. Allocated memory was 224.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 204.8 MB in the beginning and 1.2 GB in the end (delta: -976.3 MB). Peak memory consumption was 171.9 MB. Max. memory is 8.0 GB. [2021-08-21 16:28:53,237 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.09 ms. Allocated memory is still 224.4 MB. Free memory is still 206.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 16:28:53,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.92 ms. Allocated memory is still 224.4 MB. Free memory was 204.8 MB in the beginning and 202.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 16:28:53,238 INFO L168 Benchmark]: Boogie Preprocessor took 9.47 ms. Allocated memory is still 224.4 MB. Free memory was 202.9 MB in the beginning and 202.0 MB in the end (delta: 958.6 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-08-21 16:28:53,238 INFO L168 Benchmark]: RCFGBuilder took 235.24 ms. Allocated memory is still 224.4 MB. Free memory was 202.0 MB in the beginning and 187.4 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-08-21 16:28:53,238 INFO L168 Benchmark]: TraceAbstraction took 3675.91 ms. Allocated memory was 224.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 186.9 MB in the beginning and 1.2 GB in the end (delta: -994.2 MB). Peak memory consumption was 154.1 MB. Max. memory is 8.0 GB. [2021-08-21 16:28:53,240 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.09 ms. Allocated memory is still 224.4 MB. Free memory is still 206.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 23.92 ms. Allocated memory is still 224.4 MB. Free memory was 204.8 MB in the beginning and 202.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 9.47 ms. Allocated memory is still 224.4 MB. Free memory was 202.9 MB in the beginning and 202.0 MB in the end (delta: 958.6 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 235.24 ms. Allocated memory is still 224.4 MB. Free memory was 202.0 MB in the beginning and 187.4 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3675.91 ms. Allocated memory was 224.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 186.9 MB in the beginning and 1.2 GB in the end (delta: -994.2 MB). Peak memory consumption was 154.1 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 38]: assertion can be violated assertion can be violated We found a FailurePath: [L14] 0 pendingIo := 1; VAL [pendingIo=1] [L15] 0 stopped := false; VAL [pendingIo=1, stopped=false] [L16] 0 stoppingEvent := false; VAL [pendingIo=1, stopped=false, stoppingEvent=false] [L17] 0 stoppingFlag := false; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L19] FORK 0 fork 0 ServerThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L21] FORK 0 fork 1 DeviceThreadWithAssert(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L22] FORK 0 fork 2 DeviceThread(); VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L23] FORK 0 fork 3 DeviceThread(); VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L24] FORK 0 fork 4 DeviceThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L25] FORK 0 fork 5 DeviceThread(); VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 6 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 5 pendingIo := pendingIo - 1; [L70] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 5 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 6 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 5 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=4, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 5 pendingIo := pendingIo - 1; [L70] COND FALSE 5 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 6 pendingIo := pendingIo - 1; [L70] COND FALSE 6 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 6 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 3 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 6 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 6 pendingIo := pendingIo - 1; [L70] COND FALSE 6 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 3 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=3, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 3 pendingIo := pendingIo - 1; [L70] COND FALSE 3 !(pendingIo == 0) VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 4 assume !stoppingFlag; VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L38] 2 assert !stopped; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L69] 2 pendingIo := pendingIo - 1; [L70] COND FALSE 2 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=false] [L61] 4 pendingIo := pendingIo + 1; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L60] 2 assume !stoppingFlag; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=false] [L82] 1 stoppingFlag := true; VAL [pendingIo=2, stopped=false, stoppingEvent=false, stoppingFlag=true] [L69] 4 pendingIo := pendingIo - 1; [L70] COND FALSE 4 !(pendingIo == 0) VAL [pendingIo=1, stopped=false, stoppingEvent=false, stoppingFlag=true] [L92] 1 pendingIo := pendingIo - 1; [L93] COND TRUE 1 pendingIo == 0 [L94] 1 stoppingEvent := true; VAL [pendingIo=0, stopped=false, stoppingEvent=true, stoppingFlag=true] [L61] 2 pendingIo := pendingIo + 1; VAL [pendingIo=1, stopped=false, stoppingEvent=true, stoppingFlag=true] [L84] 1 assume stoppingEvent; VAL [pendingIo=1, stopped=false, stoppingEvent=true, stoppingFlag=true] [L85] 1 stopped := true; VAL [pendingIo=1, stopped=true, stoppingEvent=true, stoppingFlag=true] [L38] 2 assert !stopped; VAL [pendingIo=1, stopped=true, stoppingEvent=true, stoppingFlag=true] - UnprovableResult [Line: 19]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 10 procedures, 62 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3541.4ms, OverallIterations: 4, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 991.8ms, PartialOrderReductionTime: 230.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18431occurred 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: 27.9ms SsaConstructionTime, 211.7ms SatisfiabilityAnalysisTime, 1603.9ms InterpolantComputationTime, 488 NumberOfCodeBlocks, 488 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 1449 SizeOfPredicates, 1 NumberOfNonLiveVariables, 196 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2166/2647 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! [2021-08-21 16:28:53,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2021-08-21 16:28:53,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...