/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 DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 19:59:23,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 19:59:23,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 19:59:23,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 19:59:23,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 19:59:23,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 19:59:23,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 19:59:23,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 19:59:23,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 19:59:23,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 19:59:23,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 19:59:23,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 19:59:23,324 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 19:59:23,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 19:59:23,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 19:59:23,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 19:59:23,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 19:59:23,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 19:59:23,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 19:59:23,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 19:59:23,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 19:59:23,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 19:59:23,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 19:59:23,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 19:59:23,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 19:59:23,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 19:59:23,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 19:59:23,333 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 19:59:23,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 19:59:23,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 19:59:23,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 19:59:23,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 19:59:23,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 19:59:23,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 19:59:23,334 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 19:59:23,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 19:59:23,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 19:59:23,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 19:59:23,356 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 19:59:23,356 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 -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 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-05 19:59:23,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 19:59:23,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 19:59:23,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 19:59:23,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 19:59:23,613 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 19:59:23,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2024-04-05 19:59:24,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 19:59:24,960 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 19:59:24,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2024-04-05 19:59:24,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4fcf0d83a/f64cf97ca9bd46caabaaf68ceade8c49/FLAGa5839c5c8 [2024-04-05 19:59:24,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4fcf0d83a/f64cf97ca9bd46caabaaf68ceade8c49 [2024-04-05 19:59:24,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 19:59:24,999 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 19:59:24,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 19:59:25,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 19:59:25,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 19:59:25,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 07:59:24" (1/1) ... [2024-04-05 19:59:25,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781205e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25, skipping insertion in model container [2024-04-05 19:59:25,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 07:59:24" (1/1) ... [2024-04-05 19:59:25,044 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 19:59:25,437 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i[58135,58148] [2024-04-05 19:59:25,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 19:59:25,483 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 19:59:25,584 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i[58135,58148] [2024-04-05 19:59:25,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 19:59:25,658 INFO L206 MainTranslator]: Completed translation [2024-04-05 19:59:25,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25 WrapperNode [2024-04-05 19:59:25,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 19:59:25,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 19:59:25,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 19:59:25,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 19:59:25,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (1/1) ... [2024-04-05 19:59:25,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (1/1) ... [2024-04-05 19:59:25,700 INFO L138 Inliner]: procedures = 378, calls = 82, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 269 [2024-04-05 19:59:25,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 19:59:25,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 19:59:25,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 19:59:25,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 19:59:25,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (1/1) ... [2024-04-05 19:59:25,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (1/1) ... [2024-04-05 19:59:25,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (1/1) ... [2024-04-05 19:59:25,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (1/1) ... [2024-04-05 19:59:25,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (1/1) ... [2024-04-05 19:59:25,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (1/1) ... [2024-04-05 19:59:25,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (1/1) ... [2024-04-05 19:59:25,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (1/1) ... [2024-04-05 19:59:25,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 19:59:25,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 19:59:25,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 19:59:25,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 19:59:25,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (1/1) ... [2024-04-05 19:59:25,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 19:59:25,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:59:25,772 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-05 19:59:25,792 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-05 19:59:25,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 19:59:25,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-04-05 19:59:25,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 19:59:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-04-05 19:59:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-04-05 19:59:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 19:59:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 19:59:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-04-05 19:59:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-04-05 19:59:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 19:59:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-04-05 19:59:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-04-05 19:59:25,819 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-04-05 19:59:25,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 19:59:25,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 19:59:25,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 19:59:25,821 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 19:59:25,987 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 19:59:25,989 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 19:59:26,268 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 19:59:26,307 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 19:59:26,308 INFO L309 CfgBuilder]: Removed 23 assume(true) statements. [2024-04-05 19:59:26,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 07:59:26 BoogieIcfgContainer [2024-04-05 19:59:26,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 19:59:26,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 19:59:26,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 19:59:26,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 19:59:26,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 07:59:24" (1/3) ... [2024-04-05 19:59:26,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d846a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 07:59:26, skipping insertion in model container [2024-04-05 19:59:26,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:59:25" (2/3) ... [2024-04-05 19:59:26,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d846a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 07:59:26, skipping insertion in model container [2024-04-05 19:59:26,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 07:59:26" (3/3) ... [2024-04-05 19:59:26,323 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_94-alloc_region_racing.i [2024-04-05 19:59:26,329 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 19:59:26,336 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 19:59:26,336 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-04-05 19:59:26,337 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 19:59:26,398 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-04-05 19:59:26,441 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:59:26,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:59:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:59:26,444 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-05 19:59:26,471 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-05 19:59:26,489 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:59:26,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:26,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:59:26,506 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;@3bf23de0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:59:26,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-04-05 19:59:26,572 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 19:59:26,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2091256781, now seen corresponding path program 1 times [2024-04-05 19:59:26,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:26,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553253187] [2024-04-05 19:59:26,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:26,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:59:26,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:26,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553253187] [2024-04-05 19:59:26,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553253187] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:26,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:26,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:59:26,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619063401] [2024-04-05 19:59:26,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:26,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:59:26,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:26,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:59:26,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:59:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:26,889 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:26,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 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-05 19:59:26,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:26,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 19:59:26,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 19:59:26,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:26,924 INFO L85 PathProgramCache]: Analyzing trace with hash 191599793, now seen corresponding path program 1 times [2024-04-05 19:59:26,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:26,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8505639] [2024-04-05 19:59:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:26,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:59:27,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 19:59:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:59:27,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 19:59:27,143 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 19:59:27,144 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-04-05 19:59:27,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-04-05 19:59:27,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-04-05 19:59:27,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-04-05 19:59:27,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 19:59:27,156 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-04-05 19:59:27,157 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 19:59:27,157 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-04-05 19:59:27,222 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 19:59:27,236 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:59:27,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:59:27,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:59:27,300 INFO L229 MonitoredProcess]: Starting monitored process 3 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-05 19:59:27,306 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:59:27,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:27,306 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:59:27,307 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;@3bf23de0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:59:27,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-05 19:59:27,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-04-05 19:59:27,378 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 19:59:27,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1168647552, now seen corresponding path program 1 times [2024-04-05 19:59:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:27,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293568750] [2024-04-05 19:59:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:27,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 19:59:27,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:27,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293568750] [2024-04-05 19:59:27,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293568750] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:27,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:27,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:59:27,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182638797] [2024-04-05 19:59:27,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:27,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:59:27,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:27,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:59:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:59:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:27,488 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:27,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 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-05 19:59:27,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:27,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 19:59:27,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 19:59:27,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash 521597660, now seen corresponding path program 1 times [2024-04-05 19:59:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537944878] [2024-04-05 19:59:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:59:28,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537944878] [2024-04-05 19:59:28,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537944878] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:28,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:28,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 19:59:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605084686] [2024-04-05 19:59:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:28,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 19:59:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:28,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 19:59:28,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 19:59:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:28,208 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:28,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 8 states have internal predecessors, (138), 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-05 19:59:28,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:28,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 19:59:28,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-05 19:59:28,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 19:59:28,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1781781982, now seen corresponding path program 1 times [2024-04-05 19:59:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:28,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680100081] [2024-04-05 19:59:28,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:59:28,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 19:59:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:59:28,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 19:59:28,552 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 19:59:28,553 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-04-05 19:59:28,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-04-05 19:59:28,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-04-05 19:59:28,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-04-05 19:59:28,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-04-05 19:59:28,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 19:59:28,558 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-04-05 19:59:28,558 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 19:59:28,559 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-04-05 19:59:28,614 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-04-05 19:59:28,618 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:59:28,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:59:28,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:59:28,620 INFO L229 MonitoredProcess]: Starting monitored process 4 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-05 19:59:28,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-04-05 19:59:28,651 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:59:28,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:28,652 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:59:28,652 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;@3bf23de0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:59:28,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-05 19:59:28,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:59:28,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1054782954, now seen corresponding path program 1 times [2024-04-05 19:59:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:28,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774414844] [2024-04-05 19:59:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:28,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-04-05 19:59:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:28,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774414844] [2024-04-05 19:59:28,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774414844] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:28,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:28,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:59:28,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051021765] [2024-04-05 19:59:28,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:28,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:59:28,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:28,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:59:28,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:59:28,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:28,748 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:28,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 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-05 19:59:28,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:28,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 19:59:28,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:59:28,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash 697223184, now seen corresponding path program 1 times [2024-04-05 19:59:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:28,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621643789] [2024-04-05 19:59:28,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:28,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 19:59:29,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:29,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621643789] [2024-04-05 19:59:29,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621643789] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:29,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:29,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 19:59:29,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962524353] [2024-04-05 19:59:29,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:29,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 19:59:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 19:59:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 19:59:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:29,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:29,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 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-05 19:59:29,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:29,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:29,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 19:59:29,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-05 19:59:29,425 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:59:29,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1396008049, now seen corresponding path program 1 times [2024-04-05 19:59:29,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:29,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420535627] [2024-04-05 19:59:29,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:29,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 19:59:30,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:30,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420535627] [2024-04-05 19:59:30,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420535627] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 19:59:30,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602581226] [2024-04-05 19:59:30,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:30,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:59:30,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:59:30,014 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 19:59:30,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-05 19:59:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:30,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 13 conjunts are in the unsatisfiable core [2024-04-05 19:59:30,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 19:59:30,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-05 19:59:30,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 19:59:30,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 19:59:30,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 19:59:30,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 19:59:31,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 19:59:31,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 19:59:31,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 19:59:31,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 19:59:31,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 19:59:31,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 19:59:31,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 19:59:31,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 19:59:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 19:59:31,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 19:59:31,231 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1055 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1055) |c_~#B_mutex~0.base|) |c_~#B_mutex~0.offset|) 0))) is different from false [2024-04-05 19:59:33,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 19:59:33,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-04-05 19:59:33,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2024-04-05 19:59:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 0 refuted. 10 times theorem prover too weak. 10 trivial. 10 not checked. [2024-04-05 19:59:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602581226] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 19:59:33,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 19:59:33,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2024-04-05 19:59:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850635030] [2024-04-05 19:59:33,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 19:59:33,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-04-05 19:59:33,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:33,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-04-05 19:59:33,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=258, Unknown=5, NotChecked=34, Total=380 [2024-04-05 19:59:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:33,712 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:33,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 21.95) internal successors, (439), 20 states have internal predecessors, (439), 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-05 19:59:33,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:33,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 19:59:33,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:33,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 19:59:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 19:59:33,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-05 19:59:34,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 19:59:34,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 19:59:34,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:34,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1579420976, now seen corresponding path program 1 times [2024-04-05 19:59:34,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:34,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684118627] [2024-04-05 19:59:34,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:59:34,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 19:59:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:59:34,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 19:59:34,207 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 19:59:34,207 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-04-05 19:59:34,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-04-05 19:59:34,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-04-05 19:59:34,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-04-05 19:59:34,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-04-05 19:59:34,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-04-05 19:59:34,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-04-05 19:59:34,210 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 19:59:34,210 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 19:59:34,210 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-04-05 19:59:34,257 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-05 19:59:34,261 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:59:34,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:59:34,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:59:34,298 INFO L229 MonitoredProcess]: Starting monitored process 6 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-05 19:59:34,301 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:59:34,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:34,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:59:34,302 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;@3bf23de0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:59:34,302 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-05 19:59:34,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-04-05 19:59:34,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:59:34,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:34,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1056438489, now seen corresponding path program 1 times [2024-04-05 19:59:34,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:34,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523693642] [2024-04-05 19:59:34,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:34,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-04-05 19:59:34,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:34,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523693642] [2024-04-05 19:59:34,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523693642] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:34,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:34,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:59:34,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881825881] [2024-04-05 19:59:34,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:34,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:59:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:34,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:59:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:59:34,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:34,454 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:34,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 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-05 19:59:34,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:34,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-04-05 19:59:34,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:59:34,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash 789344091, now seen corresponding path program 1 times [2024-04-05 19:59:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:34,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211546164] [2024-04-05 19:59:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-04-05 19:59:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:35,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211546164] [2024-04-05 19:59:35,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211546164] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:35,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:35,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 19:59:35,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399342476] [2024-04-05 19:59:35,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:35,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 19:59:35,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 19:59:35,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 19:59:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:35,053 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:35,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 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-05 19:59:35,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:35,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:35,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:35,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 19:59:35,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-04-05 19:59:35,248 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:59:35,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash 907530658, now seen corresponding path program 1 times [2024-04-05 19:59:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:35,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992679345] [2024-04-05 19:59:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-04-05 19:59:35,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:35,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992679345] [2024-04-05 19:59:35,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992679345] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:35,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:35,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-04-05 19:59:35,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235926905] [2024-04-05 19:59:35,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:35,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-04-05 19:59:35,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:35,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-04-05 19:59:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-04-05 19:59:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:35,794 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:35,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.444444444444443) internal successors, (220), 9 states have internal predecessors, (220), 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-05 19:59:35,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:35,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 19:59:35,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 19:59:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 19:59:36,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-04-05 19:59:36,009 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 19:59:36,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2121603800, now seen corresponding path program 1 times [2024-04-05 19:59:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:36,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260960789] [2024-04-05 19:59:36,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:59:36,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 19:59:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:59:36,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 19:59:36,227 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 19:59:36,227 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-04-05 19:59:36,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-04-05 19:59:36,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-04-05 19:59:36,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-04-05 19:59:36,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-04-05 19:59:36,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-04-05 19:59:36,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-04-05 19:59:36,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-04-05 19:59:36,229 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 19:59:36,229 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 19:59:36,229 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-04-05 19:59:36,279 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-04-05 19:59:36,283 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:59:36,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:59:36,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:59:36,285 INFO L229 MonitoredProcess]: Starting monitored process 7 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-05 19:59:36,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-04-05 19:59:36,289 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:59:36,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:36,290 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:59:36,290 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;@3bf23de0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:59:36,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-04-05 19:59:36,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-04-05 19:59:36,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:36,380 INFO L85 PathProgramCache]: Analyzing trace with hash 462221185, now seen corresponding path program 1 times [2024-04-05 19:59:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025529817] [2024-04-05 19:59:36,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:36,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-04-05 19:59:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:36,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025529817] [2024-04-05 19:59:36,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025529817] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:36,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:36,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:59:36,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599745127] [2024-04-05 19:59:36,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:36,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:59:36,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:59:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:59:36,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:36,446 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:36,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 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-05 19:59:36,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:36,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-04-05 19:59:36,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-04-05 19:59:36,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1512937749, now seen corresponding path program 1 times [2024-04-05 19:59:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:36,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989480834] [2024-04-05 19:59:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:36,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-04-05 19:59:37,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:37,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989480834] [2024-04-05 19:59:37,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989480834] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:37,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:37,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 19:59:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044509728] [2024-04-05 19:59:37,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:37,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 19:59:37,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:37,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 19:59:37,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 19:59:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:37,149 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:37,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.75) internal successors, (302), 8 states have internal predecessors, (302), 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-05 19:59:37,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:37,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 19:59:37,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-04-05 19:59:37,413 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-04-05 19:59:37,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:37,414 INFO L85 PathProgramCache]: Analyzing trace with hash -10813987, now seen corresponding path program 1 times [2024-04-05 19:59:37,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:37,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826903279] [2024-04-05 19:59:37,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-04-05 19:59:38,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826903279] [2024-04-05 19:59:38,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826903279] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:38,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:38,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-04-05 19:59:38,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397226317] [2024-04-05 19:59:38,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:38,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-04-05 19:59:38,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:38,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-04-05 19:59:38,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-04-05 19:59:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:38,150 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:38,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 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-05 19:59:38,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:38,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 19:59:38,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 19:59:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 19:59:38,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-04-05 19:59:38,492 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-04-05 19:59:38,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:38,492 INFO L85 PathProgramCache]: Analyzing trace with hash -585236435, now seen corresponding path program 1 times [2024-04-05 19:59:38,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:38,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907033716] [2024-04-05 19:59:38,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:38,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:59:38,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 19:59:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:59:39,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 19:59:39,012 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 19:59:39,012 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-04-05 19:59:39,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-04-05 19:59:39,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-04-05 19:59:39,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-04-05 19:59:39,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-04-05 19:59:39,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-04-05 19:59:39,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-04-05 19:59:39,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-04-05 19:59:39,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-04-05 19:59:39,015 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 19:59:39,015 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 19:59:39,015 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-04-05 19:59:39,069 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-04-05 19:59:39,073 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:59:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:59:39,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:59:39,098 INFO L229 MonitoredProcess]: Starting monitored process 8 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-05 19:59:39,104 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:59:39,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:39,105 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:59:39,105 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;@3bf23de0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:59:39,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-04-05 19:59:39,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-04-05 19:59:39,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2024-04-05 19:59:39,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:59:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2081921526, now seen corresponding path program 1 times [2024-04-05 19:59:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:59:39,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681925520] [2024-04-05 19:59:39,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-04-05 19:59:39,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:59:39,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681925520] [2024-04-05 19:59:39,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681925520] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:59:39,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:59:39,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:59:39,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959438624] [2024-04-05 19:59:39,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:59:39,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:59:39,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:59:39,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:59:39,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:59:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:39,219 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:59:39,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 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-05 19:59:39,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:59:39,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 238 [2024-04-05 19:59:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2127646584, now seen corresponding path program 1 times [2024-04-05 19:59:39,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:39,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:39,678 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-05 19:59:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:59:39,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:59:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:59:40,047 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-05 19:59:40,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 19:59:40,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-04-05 19:59:40,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable17 [2024-04-05 19:59:40,632 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@646ee36f at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:183) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-04-05 19:59:40,635 INFO L158 Benchmark]: Toolchain (without parser) took 15636.09ms. Allocated memory was 343.9MB in the beginning and 1.0GB in the end (delta: 696.3MB). Free memory was 269.0MB in the beginning and 743.2MB in the end (delta: -474.2MB). Peak memory consumption was 223.3MB. Max. memory is 8.0GB. [2024-04-05 19:59:40,635 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 343.9MB. Free memory is still 310.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 19:59:40,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 658.92ms. Allocated memory is still 343.9MB. Free memory was 268.8MB in the beginning and 287.1MB in the end (delta: -18.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2024-04-05 19:59:40,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.17ms. Allocated memory is still 343.9MB. Free memory was 287.1MB in the beginning and 284.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-05 19:59:40,635 INFO L158 Benchmark]: Boogie Preprocessor took 43.71ms. Allocated memory is still 343.9MB. Free memory was 284.0MB in the beginning and 280.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-05 19:59:40,636 INFO L158 Benchmark]: RCFGBuilder took 564.48ms. Allocated memory is still 343.9MB. Free memory was 280.9MB in the beginning and 249.9MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2024-04-05 19:59:40,636 INFO L158 Benchmark]: TraceAbstraction took 14323.26ms. Allocated memory was 343.9MB in the beginning and 1.0GB in the end (delta: 696.3MB). Free memory was 248.9MB in the beginning and 743.7MB in the end (delta: -494.8MB). Peak memory consumption was 203.5MB. Max. memory is 8.0GB. [2024-04-05 19:59:40,637 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 343.9MB. Free memory is still 310.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 658.92ms. Allocated memory is still 343.9MB. Free memory was 268.8MB in the beginning and 287.1MB in the end (delta: -18.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.17ms. Allocated memory is still 343.9MB. Free memory was 287.1MB in the beginning and 284.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.71ms. Allocated memory is still 343.9MB. Free memory was 284.0MB in the beginning and 280.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 564.48ms. Allocated memory is still 343.9MB. Free memory was 280.9MB in the beginning and 249.9MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 14323.26ms. Allocated memory was 343.9MB in the beginning and 1.0GB in the end (delta: 696.3MB). Free memory was 248.9MB in the beginning and 743.7MB in the end (delta: -494.8MB). Peak memory consumption was 203.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 446, independent: 321, independent conditional: 216, independent unconditional: 105, dependent: 125, dependent conditional: 91, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 321, independent: 321, independent conditional: 216, independent unconditional: 105, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 321, independent conditional: 216, independent unconditional: 105, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 321, independent: 321, independent conditional: 216, independent unconditional: 105, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 321, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 321, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 85, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 85, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 321, independent: 236, independent conditional: 0, independent unconditional: 236, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 85, unknown conditional: 0, unknown unconditional: 85] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 321, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 321, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 85, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 85, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 321, independent: 236, independent conditional: 0, independent unconditional: 236, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 85, unknown conditional: 0, unknown unconditional: 85] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0 ], Independence queries for same thread: 125 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1906, independent: 1453, independent conditional: 1147, independent unconditional: 306, dependent: 453, dependent conditional: 388, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1453, independent: 1453, independent conditional: 1147, independent unconditional: 306, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1453, independent: 1453, independent conditional: 1147, independent unconditional: 306, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1453, independent: 1453, independent conditional: 1147, independent unconditional: 306, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1453, independent: 1453, independent conditional: 143, independent unconditional: 1310, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1453, independent: 1453, independent conditional: 16, independent unconditional: 1437, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1453, independent: 1453, independent conditional: 16, independent unconditional: 1437, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 274, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 274, independent: 273, independent conditional: 0, independent unconditional: 273, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1453, independent: 1179, independent conditional: 16, independent unconditional: 1163, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 274, unknown conditional: 0, unknown unconditional: 274] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 274, Positive conditional cache size: 0, Positive unconditional cache size: 274, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 127, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1453, independent: 1453, independent conditional: 143, independent unconditional: 1310, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1453, independent: 1453, independent conditional: 16, independent unconditional: 1437, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1453, independent: 1453, independent conditional: 16, independent unconditional: 1437, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 274, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 274, independent: 273, independent conditional: 0, independent unconditional: 273, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1453, independent: 1179, independent conditional: 16, independent unconditional: 1163, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 274, unknown conditional: 0, unknown unconditional: 274] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 274, Positive conditional cache size: 0, Positive unconditional cache size: 274, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 127 ], Independence queries for same thread: 453 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6184, independent: 4999, independent conditional: 4266, independent unconditional: 733, dependent: 1185, dependent conditional: 1078, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5010, independent: 4999, independent conditional: 4266, independent unconditional: 733, 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: 5010, independent: 4999, independent conditional: 4266, independent unconditional: 733, 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: 5010, independent: 4999, independent conditional: 4266, independent unconditional: 733, 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: 5039, independent: 4999, independent conditional: 558, independent unconditional: 4441, dependent: 40, dependent conditional: 12, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5039, independent: 4999, independent conditional: 210, independent unconditional: 4789, dependent: 40, dependent conditional: 10, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5039, independent: 4999, independent conditional: 210, independent unconditional: 4789, dependent: 40, dependent conditional: 10, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 745, independent: 737, independent conditional: 12, independent unconditional: 725, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 745, independent: 722, independent conditional: 0, independent unconditional: 722, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 49, independent conditional: 12, independent unconditional: 37, dependent: 28, dependent conditional: 19, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5039, independent: 4262, independent conditional: 198, independent unconditional: 4064, dependent: 32, dependent conditional: 6, dependent unconditional: 26, unknown: 745, unknown conditional: 16, unknown unconditional: 729] , Statistics on independence cache: Total cache size (in pairs): 745, Positive cache size: 737, Positive conditional cache size: 12, Positive unconditional cache size: 725, Negative cache size: 8, Negative conditional cache size: 4, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 350, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5039, independent: 4999, independent conditional: 558, independent unconditional: 4441, dependent: 40, dependent conditional: 12, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5039, independent: 4999, independent conditional: 210, independent unconditional: 4789, dependent: 40, dependent conditional: 10, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5039, independent: 4999, independent conditional: 210, independent unconditional: 4789, dependent: 40, dependent conditional: 10, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 745, independent: 737, independent conditional: 12, independent unconditional: 725, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 745, independent: 722, independent conditional: 0, independent unconditional: 722, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 49, independent conditional: 12, independent unconditional: 37, dependent: 28, dependent conditional: 19, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5039, independent: 4262, independent conditional: 198, independent unconditional: 4064, dependent: 32, dependent conditional: 6, dependent unconditional: 26, unknown: 745, unknown conditional: 16, unknown unconditional: 729] , Statistics on independence cache: Total cache size (in pairs): 745, Positive cache size: 737, Positive conditional cache size: 12, Positive unconditional cache size: 725, Negative cache size: 8, Negative conditional cache size: 4, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 350 ], Independence queries for same thread: 1174 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13262, independent: 11085, independent conditional: 9574, independent unconditional: 1511, dependent: 2177, dependent conditional: 2009, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11128, independent: 11085, independent conditional: 9574, independent unconditional: 1511, dependent: 43, dependent conditional: 38, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11128, independent: 11085, independent conditional: 9574, independent unconditional: 1511, dependent: 43, dependent conditional: 38, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11128, independent: 11085, independent conditional: 9574, independent unconditional: 1511, dependent: 43, dependent conditional: 38, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11233, independent: 11085, independent conditional: 1130, independent unconditional: 9955, dependent: 148, dependent conditional: 50, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11233, independent: 11085, independent conditional: 542, independent unconditional: 10543, dependent: 148, dependent conditional: 40, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11233, independent: 11085, independent conditional: 542, independent unconditional: 10543, dependent: 148, dependent conditional: 40, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1416, independent: 1377, independent conditional: 36, independent unconditional: 1341, dependent: 39, dependent conditional: 18, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1416, independent: 1346, independent conditional: 0, independent unconditional: 1346, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 31, independent conditional: 13, independent unconditional: 18, dependent: 39, dependent conditional: 18, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 31, independent conditional: 13, independent unconditional: 18, dependent: 39, dependent conditional: 18, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 131, independent: 70, independent conditional: 20, independent unconditional: 49, dependent: 61, dependent conditional: 28, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11233, independent: 9708, independent conditional: 506, independent unconditional: 9202, dependent: 109, dependent conditional: 22, dependent unconditional: 87, unknown: 1416, unknown conditional: 54, unknown unconditional: 1362] , Statistics on independence cache: Total cache size (in pairs): 1416, Positive cache size: 1377, Positive conditional cache size: 36, Positive unconditional cache size: 1341, Negative cache size: 39, Negative conditional cache size: 18, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 598, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11233, independent: 11085, independent conditional: 1130, independent unconditional: 9955, dependent: 148, dependent conditional: 50, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11233, independent: 11085, independent conditional: 542, independent unconditional: 10543, dependent: 148, dependent conditional: 40, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11233, independent: 11085, independent conditional: 542, independent unconditional: 10543, dependent: 148, dependent conditional: 40, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1416, independent: 1377, independent conditional: 36, independent unconditional: 1341, dependent: 39, dependent conditional: 18, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1416, independent: 1346, independent conditional: 0, independent unconditional: 1346, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 31, independent conditional: 13, independent unconditional: 18, dependent: 39, dependent conditional: 18, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 31, independent conditional: 13, independent unconditional: 18, dependent: 39, dependent conditional: 18, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 131, independent: 70, independent conditional: 20, independent unconditional: 49, dependent: 61, dependent conditional: 28, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11233, independent: 9708, independent conditional: 506, independent unconditional: 9202, dependent: 109, dependent conditional: 22, dependent unconditional: 87, unknown: 1416, unknown conditional: 54, unknown unconditional: 1362] , Statistics on independence cache: Total cache size (in pairs): 1416, Positive cache size: 1377, Positive conditional cache size: 36, Positive unconditional cache size: 1341, Negative cache size: 39, Negative conditional cache size: 18, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 598 ], Independence queries for same thread: 2134 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19194, independent: 16162, independent conditional: 13873, independent unconditional: 2289, dependent: 3032, dependent conditional: 2803, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16216, independent: 16162, independent conditional: 13873, independent unconditional: 2289, dependent: 54, dependent conditional: 45, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16216, independent: 16162, independent conditional: 13873, independent unconditional: 2289, dependent: 54, dependent conditional: 45, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16216, independent: 16162, independent conditional: 13873, independent unconditional: 2289, dependent: 54, dependent conditional: 45, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16346, independent: 16162, independent conditional: 1455, independent unconditional: 14707, dependent: 184, dependent conditional: 56, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16346, independent: 16162, independent conditional: 589, independent unconditional: 15573, dependent: 184, dependent conditional: 38, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16346, independent: 16162, independent conditional: 589, independent unconditional: 15573, dependent: 184, dependent conditional: 38, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2144, independent: 2097, independent conditional: 44, independent unconditional: 2053, dependent: 47, dependent conditional: 17, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2144, independent: 2046, independent conditional: 0, independent unconditional: 2046, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 98, independent: 51, independent conditional: 19, independent unconditional: 32, dependent: 47, dependent conditional: 17, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 98, independent: 51, independent conditional: 19, independent unconditional: 32, dependent: 47, dependent conditional: 17, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 210, independent: 142, independent conditional: 28, independent unconditional: 114, dependent: 68, dependent conditional: 23, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 16346, independent: 14065, independent conditional: 545, independent unconditional: 13520, dependent: 137, dependent conditional: 21, dependent unconditional: 116, unknown: 2144, unknown conditional: 61, unknown unconditional: 2083] , Statistics on independence cache: Total cache size (in pairs): 2144, Positive cache size: 2097, Positive conditional cache size: 44, Positive unconditional cache size: 2053, Negative cache size: 47, Negative conditional cache size: 17, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 884, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16346, independent: 16162, independent conditional: 1455, independent unconditional: 14707, dependent: 184, dependent conditional: 56, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16346, independent: 16162, independent conditional: 589, independent unconditional: 15573, dependent: 184, dependent conditional: 38, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16346, independent: 16162, independent conditional: 589, independent unconditional: 15573, dependent: 184, dependent conditional: 38, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2144, independent: 2097, independent conditional: 44, independent unconditional: 2053, dependent: 47, dependent conditional: 17, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2144, independent: 2046, independent conditional: 0, independent unconditional: 2046, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 98, independent: 51, independent conditional: 19, independent unconditional: 32, dependent: 47, dependent conditional: 17, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 98, independent: 51, independent conditional: 19, independent unconditional: 32, dependent: 47, dependent conditional: 17, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 210, independent: 142, independent conditional: 28, independent unconditional: 114, dependent: 68, dependent conditional: 23, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 16346, independent: 14065, independent conditional: 545, independent unconditional: 13520, dependent: 137, dependent conditional: 21, dependent unconditional: 116, unknown: 2144, unknown conditional: 61, unknown unconditional: 2083] , Statistics on independence cache: Total cache size (in pairs): 2144, Positive cache size: 2097, Positive conditional cache size: 44, Positive unconditional cache size: 2053, Negative cache size: 47, Negative conditional cache size: 17, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 884 ], Independence queries for same thread: 2978 - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@646ee36f de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@646ee36f: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-05 19:59:40,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0 [2024-04-05 19:59:40,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Ended with exit code 0 [2024-04-05 19:59:41,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2024-04-05 19:59:41,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2024-04-05 19:59:41,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-04-05 19:59:41,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-04-05 19:59:41,878 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...