/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking BOTH --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl
--------------------------------------------------------------------------------
This is Ultimate 0.2.4-wip.dk.conditional-comm-faa7b7a-m
[2024-04-28 16:18:01,696 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-04-28 16:18:01,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf
[2024-04-28 16:18:01,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-04-28 16:18:01,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-04-28 16:18:01,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-04-28 16:18:01,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-04-28 16:18:01,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-04-28 16:18:01,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-04-28 16:18:01,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-04-28 16:18:01,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-04-28 16:18:01,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-04-28 16:18:01,823 INFO L153 SettingsManager]: * Use SBE=true
[2024-04-28 16:18:01,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-04-28 16:18:01,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-04-28 16:18:01,825 INFO L153 SettingsManager]: * sizeof long=4
[2024-04-28 16:18:01,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-04-28 16:18:01,825 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-04-28 16:18:01,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-04-28 16:18:01,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-04-28 16:18:01,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-04-28 16:18:01,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-04-28 16:18:01,826 INFO L153 SettingsManager]: * sizeof long double=12
[2024-04-28 16:18:01,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-04-28 16:18:01,827 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-04-28 16:18:01,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-04-28 16:18:01,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-04-28 16:18:01,827 INFO L153 SettingsManager]: * To the following directory=./dump/
[2024-04-28 16:18:01,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-04-28 16:18:01,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-04-28 16:18:01,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-04-28 16:18:01,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-04-28 16:18:01,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-04-28 16:18:01,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-04-28 16:18:01,830 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES
[2024-04-28 16:18:01,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-04-28 16:18:01,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-04-28 16:18:01,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-04-28 16:18:01,830 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-04-28 16:18:01,830 INFO L153 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/UGemCutter-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
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> BOTH
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10
[2024-04-28 16:18:02,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-04-28 16:18:02,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-04-28 16:18:02,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-04-28 16:18:02,163 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser...
[2024-04-28 16:18:02,163 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized
[2024-04-28 16:18:02,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl
[2024-04-28 16:18:02,165 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl'
[2024-04-28 16:18:02,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-04-28 16:18:02,194 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements.
[2024-04-28 16:18:02,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-04-28 16:18:02,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-04-28 16:18:02,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-04-28 16:18:02,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/1) ...
[2024-04-28 16:18:02,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/1) ...
[2024-04-28 16:18:02,256 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0
[2024-04-28 16:18:02,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-04-28 16:18:02,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-04-28 16:18:02,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-04-28 16:18:02,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-04-28 16:18:02,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/1) ...
[2024-04-28 16:18:02,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/1) ...
[2024-04-28 16:18:02,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/1) ...
[2024-04-28 16:18:02,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/1) ...
[2024-04-28 16:18:02,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/1) ...
[2024-04-28 16:18:02,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/1) ...
[2024-04-28 16:18:02,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/1) ...
[2024-04-28 16:18:02,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/1) ...
[2024-04-28 16:18:02,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-04-28 16:18:02,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-04-28 16:18:02,278 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-04-28 16:18:02,278 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-04-28 16:18:02,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/1) ...
[2024-04-28 16:18:02,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-04-28 16:18:02,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-04-28 16:18:02,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-04-28 16:18:02,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-04-28 16:18:02,369 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration
[2024-04-28 16:18:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure thread1
[2024-04-28 16:18:02,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1
[2024-04-28 16:18:02,369 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration
[2024-04-28 16:18:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure thread2
[2024-04-28 16:18:02,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2
[2024-04-28 16:18:02,369 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration
[2024-04-28 16:18:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-04-28 16:18:02,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-04-28 16:18:02,370 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration
[2024-04-28 16:18:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread3
[2024-04-28 16:18:02,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3
[2024-04-28 16:18:02,370 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration
[2024-04-28 16:18:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread4
[2024-04-28 16:18:02,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4
[2024-04-28 16:18:02,371 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration
[2024-04-28 16:18:02,371 INFO L130 BoogieDeclarations]: Found specification of procedure thread5
[2024-04-28 16:18:02,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5
[2024-04-28 16:18:02,371 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration
[2024-04-28 16:18:02,371 INFO L130 BoogieDeclarations]: Found specification of procedure thread6
[2024-04-28 16:18:02,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6
[2024-04-28 16:18:02,372 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-04-28 16:18:02,417 INFO L241 CfgBuilder]: Building ICFG
[2024-04-28 16:18:02,420 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-04-28 16:18:02,576 INFO L282 CfgBuilder]: Performing block encoding
[2024-04-28 16:18:02,589 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-04-28 16:18:02,590 INFO L309 CfgBuilder]: Removed 4 assume(true) statements.
[2024-04-28 16:18:02,591 INFO L201 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:18:02 BoogieIcfgContainer
[2024-04-28 16:18:02,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-04-28 16:18:02,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-04-28 16:18:02,597 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-04-28 16:18:02,609 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-04-28 16:18:02,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 04:18:02" (1/2) ...
[2024-04-28 16:18:02,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c49c846 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:18:02, skipping insertion in model container
[2024-04-28 16:18:02,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:18:02" (2/2) ...
[2024-04-28 16:18:02,614 INFO L112 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl
[2024-04-28 16:18:02,621 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-04-28 16:18:02,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-04-28 16:18:02,632 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-04-28 16:18:02,632 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-04-28 16:18:02,725 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions.
[2024-04-28 16:18:02,761 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-04-28 16:18:02,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-04-28 16:18:02,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-04-28 16:18:02,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-04-28 16:18:02,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2024-04-28 16:18:02,799 INFO L187 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-04-28 16:18:02,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 16:18:02,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-04-28 16:18:02,818 INFO L357 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4dd12696, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-04-28 16:18:02,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-04-28 16:18:02,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (and 8 more)] ===
[2024-04-28 16:18:02,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 16:18:02,873 INFO L85 PathProgramCache]: Analyzing trace with hash -34957, now seen corresponding path program 1 times
[2024-04-28 16:18:02,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 16:18:02,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955208192]
[2024-04-28 16:18:02,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 16:18:02,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 16:18:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 16:18:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 16:18:03,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 16:18:03,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955208192]
[2024-04-28 16:18:03,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955208192] provided 1 perfect and 0 imperfect interpolant sequences
[2024-04-28 16:18:03,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-04-28 16:18:03,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-04-28 16:18:03,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648583846]
[2024-04-28 16:18:03,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-04-28 16:18:03,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-04-28 16:18:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 16:18:03,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-04-28 16:18:03,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-04-28 16:18:03,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 16:18:03,155 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 16:18:03,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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)
[2024-04-28 16:18:03,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 16:18:03,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-04-28 16:18:03,245 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (and 8 more)] ===
[2024-04-28 16:18:03,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 16:18:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash -599801993, now seen corresponding path program 1 times
[2024-04-28 16:18:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 16:18:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857796538]
[2024-04-28 16:18:03,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 16:18:03,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 16:18:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 16:18:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 16:18:03,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 16:18:03,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857796538]
[2024-04-28 16:18:03,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857796538] provided 1 perfect and 0 imperfect interpolant sequences
[2024-04-28 16:18:03,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-04-28 16:18:03,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-04-28 16:18:03,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854114946]
[2024-04-28 16:18:03,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-04-28 16:18:03,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-04-28 16:18:03,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 16:18:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-04-28 16:18:03,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-04-28 16:18:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 16:18:03,318 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 16:18:03,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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)
[2024-04-28 16:18:03,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 16:18:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-04-28 16:18:03,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (and 8 more)] ===
[2024-04-28 16:18:03,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 16:18:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1765923663, now seen corresponding path program 1 times
[2024-04-28 16:18:03,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 16:18:03,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410062286]
[2024-04-28 16:18:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 16:18:03,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 16:18:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 16:18:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 16:18:03,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 16:18:03,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410062286]
[2024-04-28 16:18:03,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410062286] provided 1 perfect and 0 imperfect interpolant sequences
[2024-04-28 16:18:03,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-04-28 16:18:03,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-04-28 16:18:03,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171408635]
[2024-04-28 16:18:03,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-04-28 16:18:03,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-04-28 16:18:03,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 16:18:03,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-04-28 16:18:03,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-04-28 16:18:03,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 16:18:03,538 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 16:18:03,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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)
[2024-04-28 16:18:03,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 16:18:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-04-28 16:18:03,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (and 8 more)] ===
[2024-04-28 16:18:03,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 16:18:03,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1566207289, now seen corresponding path program 1 times
[2024-04-28 16:18:03,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 16:18:03,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538158287]
[2024-04-28 16:18:03,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 16:18:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 16:18:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 16:18:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 16:18:03,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 16:18:03,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538158287]
[2024-04-28 16:18:03,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538158287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-04-28 16:18:03,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-04-28 16:18:03,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-04-28 16:18:03,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006946476]
[2024-04-28 16:18:03,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-04-28 16:18:03,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-04-28 16:18:03,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 16:18:03,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-04-28 16:18:03,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-04-28 16:18:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 16:18:03,693 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 16:18:03,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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)
[2024-04-28 16:18:03,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 16:18:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-04-28 16:18:03,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-04-28 16:18:03,792 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (and 8 more)] ===
[2024-04-28 16:18:03,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 16:18:03,793 INFO L85 PathProgramCache]: Analyzing trace with hash 872581365, now seen corresponding path program 2 times
[2024-04-28 16:18:03,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 16:18:03,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305764283]
[2024-04-28 16:18:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 16:18:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 16:18:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 16:18:03,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-04-28 16:18:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 16:18:03,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-04-28 16:18:03,901 INFO L363 BasicCegarLoop]: Counterexample is feasible
[2024-04-28 16:18:03,902 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (10 of 11 remaining)
[2024-04-28 16:18:03,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 11 remaining)
[2024-04-28 16:18:03,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 11 remaining)
[2024-04-28 16:18:03,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 11 remaining)
[2024-04-28 16:18:03,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 11 remaining)
[2024-04-28 16:18:03,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining)
[2024-04-28 16:18:03,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining)
[2024-04-28 16:18:03,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 11 remaining)
[2024-04-28 16:18:03,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 11 remaining)
[2024-04-28 16:18:03,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining)
[2024-04-28 16:18:03,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 11 remaining)
[2024-04-28 16:18:03,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-04-28 16:18:03,920 INFO L448 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1]
[2024-04-28 16:18:03,925 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-04-28 16:18:03,925 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2024-04-28 16:18:03,962 INFO L201 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:18:03 BasicIcfg
[2024-04-28 16:18:03,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-04-28 16:18:03,964 INFO L158 Benchmark]: Toolchain (without parser) took 1769.12ms. Allocated memory is still 268.4MB. Free memory was 234.0MB in the beginning and 230.6MB in the end (delta: 3.4MB). Peak memory consumption was 3.5MB. Max. memory is 8.0GB.
[2024-04-28 16:18:03,967 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 268.4MB. Free memory is still 235.1MB. There was no memory consumed. Max. memory is 8.0GB.
[2024-04-28 16:18:03,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.81ms. Allocated memory is still 268.4MB. Free memory was 233.8MB in the beginning and 241.2MB in the end (delta: -7.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2024-04-28 16:18:03,970 INFO L158 Benchmark]: Boogie Preprocessor took 19.33ms. Allocated memory is still 268.4MB. Free memory was 241.2MB in the beginning and 240.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2024-04-28 16:18:03,970 INFO L158 Benchmark]: RCFGBuilder took 313.08ms. Allocated memory is still 268.4MB. Free memory was 240.0MB in the beginning and 228.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2024-04-28 16:18:03,971 INFO L158 Benchmark]: TraceAbstraction took 1366.00ms. Allocated memory is still 268.4MB. Free memory was 226.9MB in the beginning and 230.6MB in the end (delta: -3.8MB). There was no memory consumed. Max. memory is 8.0GB.
[2024-04-28 16:18:03,972 INFO L338 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.13ms. Allocated memory is still 268.4MB. Free memory is still 235.1MB. There was no memory consumed. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 61.81ms. Allocated memory is still 268.4MB. Free memory was 233.8MB in the beginning and 241.2MB in the end (delta: -7.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 19.33ms. Allocated memory is still 268.4MB. Free memory was 241.2MB in the beginning and 240.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 313.08ms. Allocated memory is still 268.4MB. Free memory was 240.0MB in the beginning and 228.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 1366.00ms. Allocated memory is still 268.4MB. Free memory was 226.9MB in the beginning and 230.6MB in the end (delta: -3.8MB). There was no memory consumed. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Independence relation #1 benchmarks
ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2783, independent: 2214, independent conditional: 1890, independent unconditional: 324, dependent: 569, dependent conditional: 495, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2225, independent: 2214, independent conditional: 1890, independent unconditional: 324, dependent: 11, dependent conditional: 10, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2225, independent: 2214, independent conditional: 1890, independent unconditional: 324, dependent: 11, dependent conditional: 10, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2225, independent: 2214, independent conditional: 1890, independent unconditional: 324, dependent: 11, dependent conditional: 10, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2249, independent: 2214, independent conditional: 1082, independent unconditional: 1132, dependent: 35, dependent conditional: 15, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2249, independent: 2214, independent conditional: 486, independent unconditional: 1728, dependent: 35, dependent conditional: 5, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2249, independent: 2214, independent conditional: 486, independent unconditional: 1728, dependent: 35, dependent conditional: 5, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 205, independent: 195, independent conditional: 6, independent unconditional: 189, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 205, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 13, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 49, dependent conditional: 9, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2249, independent: 2019, independent conditional: 480, independent unconditional: 1539, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 205, unknown conditional: 9, unknown unconditional: 196] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 195, Positive conditional cache size: 6, Positive unconditional cache size: 189, Negative cache size: 10, Negative conditional cache size: 3, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 606, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2249, independent: 2214, independent conditional: 1082, independent unconditional: 1132, dependent: 35, dependent conditional: 15, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2249, independent: 2214, independent conditional: 486, independent unconditional: 1728, dependent: 35, dependent conditional: 5, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2249, independent: 2214, independent conditional: 486, independent unconditional: 1728, dependent: 35, dependent conditional: 5, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 205, independent: 195, independent conditional: 6, independent unconditional: 189, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 205, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 13, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 49, dependent conditional: 9, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2249, independent: 2019, independent conditional: 480, independent unconditional: 1539, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 205, unknown conditional: 9, unknown unconditional: 196] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 195, Positive conditional cache size: 6, Positive unconditional cache size: 189, Negative cache size: 10, Negative conditional cache size: 3, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 606 ], Independence queries for same thread: 558
- CounterExampleResult [Line: 121]: assertion can be violated
assertion can be violated
We found a FailurePath:
[L115] 0 assume x_0 == x_8 && y_1 == y_9;
VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L116] FORK 0 fork 1 thread1();
VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L60] 1 f1_2 := false;
[L61] 1 f2_3 := false;
VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L63] FORK 1 fork 2, 2 thread2();
VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L117] FORK 0 fork 4, 4, 4, 4 thread4();
VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L103] 3 f1_10 := false;
[L104] 3 f2_11 := false;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L106] FORK 3 fork 5, 5, 5, 5, 5 thread5();
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L64] FORK 1 fork 3, 3, 3 thread3();
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L107] FORK 3 fork 6, 6, 6, 6, 6, 6 thread6();
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L65] JOIN 2 join 2, 2;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L66] JOIN 5 join 3, 3, 3;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L118] JOIN 1 join 1;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L73] 4 temp_12 := x_8;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L74] 4 x_8 := temp_12 + 1;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1]
[L75] 4 f1_10 := true;
VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1]
[L88] 6 temp_14 := y_9;
VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1]
[L89] 6 y_9 := temp_14 + 1;
VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0]
[L90] 6 f2_11 := true;
VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0]
[L76] 4 assume f2_11;
VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0]
[L77] 4 temp_13 := y_9;
VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0]
[L78] 4 y_9 := temp_13 + 1;
VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1]
[L91] 6 assume f1_10;
VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1]
[L79] 4 f1_10 := false;
VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1]
[L92] 6 temp_15 := x_8;
VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1]
[L93] 6 x_8 := temp_15 + 1;
VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1]
[L94] 6 f2_11 := false;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1]
[L80] 4 assume !f2_11;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1]
[L95] 6 assume !f1_10;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1]
[L108] JOIN 4 join 5, 5, 5, 5, 5;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1]
[L109] JOIN 6 join 6, 6, 6, 6, 6, 6;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1]
[L119] JOIN 3 join 4, 4, 4, 4;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1]
[L120] 0 assume !(x_0 == x_8 && y_1 == y_9);
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1]
[L121] 0 assert false;
VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1]
- UnprovableResult [Line: 63]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 59]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 116]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 116]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 106]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 102]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 59]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 63]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 102]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 106]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 4/4 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, ConditionalCommutativityCheckTime: 0.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-04-28 16:18:03,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0
[2024-04-28 16:18:04,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...