/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 SLEEP_SET --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/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 20:12:46,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 20:12:46,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 20:12:46,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 20:12:46,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 20:12:46,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 20:12:46,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 20:12:46,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 20:12:46,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 20:12:46,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 20:12:46,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 20:12:46,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 20:12:46,535 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 20:12:46,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 20:12:46,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 20:12:46,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 20:12:46,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 20:12:46,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 20:12:46,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 20:12:46,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 20:12:46,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 20:12:46,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 20:12:46,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 20:12:46,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 20:12:46,545 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 20:12:46,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 20:12:46,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 20:12:46,546 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 20:12:46,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 20:12:46,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 20:12:46,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 20:12:46,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 20:12:46,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 20:12:46,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 20:12:46,548 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 20:12:46,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 20:12:46,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 20:12:46,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 20:12:46,549 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 20:12:46,549 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 -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-06 20:12:46,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 20:12:46,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 20:12:46,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 20:12:46,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 20:12:46,820 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 20:12:46,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-06 20:12:48,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 20:12:48,273 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 20:12:48,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-06 20:12:48,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f0f385247/b1207e3e6a7a4ee7ae5a710752e03aaa/FLAG79d621591 [2024-05-06 20:12:48,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f0f385247/b1207e3e6a7a4ee7ae5a710752e03aaa [2024-05-06 20:12:48,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 20:12:48,303 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 20:12:48,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 20:12:48,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 20:12:48,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 20:12:48,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62943f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48, skipping insertion in model container [2024-05-06 20:12:48,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,359 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 20:12:48,491 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-06 20:12:48,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 20:12:48,679 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 20:12:48,691 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-06 20:12:48,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 20:12:48,750 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 20:12:48,751 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 20:12:48,758 INFO L206 MainTranslator]: Completed translation [2024-05-06 20:12:48,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48 WrapperNode [2024-05-06 20:12:48,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 20:12:48,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 20:12:48,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 20:12:48,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 20:12:48,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,821 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-05-06 20:12:48,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 20:12:48,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 20:12:48,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 20:12:48,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 20:12:48,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 20:12:48,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 20:12:48,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 20:12:48,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 20:12:48,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (1/1) ... [2024-05-06 20:12:48,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 20:12:48,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 20:12:48,978 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-05-06 20:12:49,002 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-05-06 20:12:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 20:12:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 20:12:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 20:12:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 20:12:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 20:12:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 20:12:49,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 20:12:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 20:12:49,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 20:12:49,034 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 20:12:49,035 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 20:12:49,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 20:12:49,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 20:12:49,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 20:12:49,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 20:12:49,037 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 20:12:49,185 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 20:12:49,192 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 20:12:49,363 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 20:12:49,372 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 20:12:49,372 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 20:12:49,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 08:12:49 BoogieIcfgContainer [2024-05-06 20:12:49,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 20:12:49,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 20:12:49,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 20:12:49,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 20:12:49,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 08:12:48" (1/3) ... [2024-05-06 20:12:49,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1f94f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 08:12:49, skipping insertion in model container [2024-05-06 20:12:49,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:12:48" (2/3) ... [2024-05-06 20:12:49,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1f94f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 08:12:49, skipping insertion in model container [2024-05-06 20:12:49,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 08:12:49" (3/3) ... [2024-05-06 20:12:49,382 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-06 20:12:49,390 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 20:12:49,399 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 20:12:49,400 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 20:12:49,400 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 20:12:49,446 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 20:12:49,485 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 20:12:49,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 20:12:49,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 20:12:49,488 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-05-06 20:12:49,503 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-05-06 20:12:49,535 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 20:12:49,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:12:49,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 20:12:49,557 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;@1b87d8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 20:12:49,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-06 20:12:49,636 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 20:12:49,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:12:49,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1765759485, now seen corresponding path program 1 times [2024-05-06 20:12:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:12:49,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82044901] [2024-05-06 20:12:49,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:12:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 20:12:49,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:12:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82044901] [2024-05-06 20:12:49,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82044901] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:12:49,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:12:49,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 20:12:49,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109751759] [2024-05-06 20:12:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:12:49,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 20:12:49,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:12:49,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 20:12:49,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 20:12:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:49,993 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:12:49,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-05-06 20:12:49,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:50,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:50,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 20:12:50,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 20:12:50,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:12:50,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1974142207, now seen corresponding path program 1 times [2024-05-06 20:12:50,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:12:50,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115977868] [2024-05-06 20:12:50,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:50,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:12:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 20:12:50,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:12:50,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115977868] [2024-05-06 20:12:50,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115977868] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:12:50,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:12:50,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 20:12:50,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231155930] [2024-05-06 20:12:50,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:12:50,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 20:12:50,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:12:50,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 20:12:50,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 20:12:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:50,484 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:12:50,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-05-06 20:12:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1379691819, now seen corresponding path program 1 times [2024-05-06 20:12:50,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:12:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 20:12:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:51,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:12:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 20:12:51,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 20:12:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-06 20:12:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash -283309863, now seen corresponding path program 1 times [2024-05-06 20:12:51,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:51,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:51,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash 361471003, now seen corresponding path program 1 times [2024-05-06 20:12:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:52,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash -420384456, now seen corresponding path program 1 times [2024-05-06 20:12:52,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:52,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1265097459, now seen corresponding path program 1 times [2024-05-06 20:12:52,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:52,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1841924918, now seen corresponding path program 1 times [2024-05-06 20:12:52,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:52,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1444890337, now seen corresponding path program 1 times [2024-05-06 20:12:52,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:52,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1570630030, now seen corresponding path program 1 times [2024-05-06 20:12:52,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:52,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1436138861, now seen corresponding path program 1 times [2024-05-06 20:12:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,092 INFO L85 PathProgramCache]: Analyzing trace with hash -923504249, now seen corresponding path program 1 times [2024-05-06 20:12:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,303 INFO L85 PathProgramCache]: Analyzing trace with hash 801493557, now seen corresponding path program 1 times [2024-05-06 20:12:53,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:53,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash 302949334, now seen corresponding path program 1 times [2024-05-06 20:12:53,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1358292246, now seen corresponding path program 1 times [2024-05-06 20:12:53,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:53,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash 691520574, now seen corresponding path program 1 times [2024-05-06 20:12:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash 456503254, now seen corresponding path program 1 times [2024-05-06 20:12:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:53,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1370747405, now seen corresponding path program 1 times [2024-05-06 20:12:54,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:54,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 756759680, now seen corresponding path program 1 times [2024-05-06 20:12:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,276 INFO L85 PathProgramCache]: Analyzing trace with hash -615818479, now seen corresponding path program 1 times [2024-05-06 20:12:55,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:55,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash 395777220, now seen corresponding path program 1 times [2024-05-06 20:12:55,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:55,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2065440221, now seen corresponding path program 1 times [2024-05-06 20:12:55,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2144836564, now seen corresponding path program 1 times [2024-05-06 20:12:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1454834263, now seen corresponding path program 1 times [2024-05-06 20:12:55,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash 739667475, now seen corresponding path program 1 times [2024-05-06 20:12:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:55,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 20:12:55,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25 [2024-05-06 20:12:55,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 20:12:55,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:12:55,688 INFO L85 PathProgramCache]: Analyzing trace with hash -906602203, now seen corresponding path program 1 times [2024-05-06 20:12:55,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:12:55,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670684952] [2024-05-06 20:12:55,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:55,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:12:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 20:12:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:12:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670684952] [2024-05-06 20:12:55,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670684952] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:12:55,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:12:55,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 20:12:55,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281136023] [2024-05-06 20:12:55,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:12:55,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 20:12:55,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:12:55,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 20:12:55,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-06 20:12:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:55,850 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:12:55,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-05-06 20:12:55,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:55,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 20:12:55,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:57,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2089494718, now seen corresponding path program 1 times [2024-05-06 20:12:57,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1747672049, now seen corresponding path program 1 times [2024-05-06 20:12:57,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash -194923514, now seen corresponding path program 1 times [2024-05-06 20:12:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:57,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1668853087, now seen corresponding path program 1 times [2024-05-06 20:12:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1439306770, now seen corresponding path program 1 times [2024-05-06 20:12:57,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:57,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1893235285, now seen corresponding path program 1 times [2024-05-06 20:12:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1878589867, now seen corresponding path program 1 times [2024-05-06 20:12:57,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:57,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:12:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:12:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 20:12:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 20:12:57,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 20:12:57,668 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 20:12:57,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:12:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1856835031, now seen corresponding path program 2 times [2024-05-06 20:12:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:12:57,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440383654] [2024-05-06 20:12:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:57,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:12:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 20:12:57,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:12:57,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440383654] [2024-05-06 20:12:57,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440383654] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:12:57,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:12:57,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 20:12:57,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24766721] [2024-05-06 20:12:57,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:12:57,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 20:12:57,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:12:57,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 20:12:57,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 20:12:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:57,812 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:12:57,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-05-06 20:12:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 20:12:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 20:12:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:59,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 20:12:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 20:12:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:12:59,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-06 20:12:59,353 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 20:12:59,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:12:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1555204803, now seen corresponding path program 3 times [2024-05-06 20:12:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:12:59,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075380160] [2024-05-06 20:12:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:12:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:12:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:12:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 20:12:59,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:12:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075380160] [2024-05-06 20:12:59,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075380160] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:12:59,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:12:59,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 20:12:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988592054] [2024-05-06 20:12:59,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:12:59,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 20:12:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:12:59,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 20:12:59,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 20:12:59,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:59,511 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:12:59,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-05-06 20:12:59,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:12:59,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 20:12:59,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 20:12:59,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:12:59,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:13:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:13:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 20:13:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 20:13:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:13:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:13:01,250 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-06 20:13:01,251 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-06 20:13:01,251 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-06 20:13:01,251 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-06 20:13:01,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-06 20:13:01,255 INFO L448 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 20:13:01,258 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 20:13:01,258 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 20:13:01,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 08:13:01 BasicIcfg [2024-05-06 20:13:01,261 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 20:13:01,262 INFO L158 Benchmark]: Toolchain (without parser) took 12958.67ms. Allocated memory was 291.5MB in the beginning and 544.2MB in the end (delta: 252.7MB). Free memory was 221.6MB in the beginning and 489.9MB in the end (delta: -268.3MB). Peak memory consumption was 291.9MB. Max. memory is 8.0GB. [2024-05-06 20:13:01,262 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 166.7MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 20:13:01,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.18ms. Allocated memory is still 291.5MB. Free memory was 221.4MB in the beginning and 200.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-06 20:13:01,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.81ms. Allocated memory is still 291.5MB. Free memory was 200.7MB in the beginning and 198.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 20:13:01,263 INFO L158 Benchmark]: Boogie Preprocessor took 53.92ms. Allocated memory is still 291.5MB. Free memory was 198.6MB in the beginning and 261.8MB in the end (delta: -63.3MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. [2024-05-06 20:13:01,263 INFO L158 Benchmark]: RCFGBuilder took 496.84ms. Allocated memory is still 291.5MB. Free memory was 261.3MB in the beginning and 246.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-06 20:13:01,263 INFO L158 Benchmark]: TraceAbstraction took 11885.02ms. Allocated memory was 291.5MB in the beginning and 544.2MB in the end (delta: 252.7MB). Free memory was 245.6MB in the beginning and 489.9MB in the end (delta: -244.3MB). Peak memory consumption was 316.2MB. Max. memory is 8.0GB. [2024-05-06 20:13:01,265 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.11ms. Allocated memory is still 166.7MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 452.18ms. Allocated memory is still 291.5MB. Free memory was 221.4MB in the beginning and 200.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.81ms. Allocated memory is still 291.5MB. Free memory was 200.7MB in the beginning and 198.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.92ms. Allocated memory is still 291.5MB. Free memory was 198.6MB in the beginning and 261.8MB in the end (delta: -63.3MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. * RCFGBuilder took 496.84ms. Allocated memory is still 291.5MB. Free memory was 261.3MB in the beginning and 246.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11885.02ms. Allocated memory was 291.5MB in the beginning and 544.2MB in the end (delta: 252.7MB). Free memory was 245.6MB in the beginning and 489.9MB in the end (delta: -244.3MB). Peak memory consumption was 316.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 240957, independent: 237549, independent conditional: 237360, independent unconditional: 189, dependent: 3408, dependent conditional: 3408, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 240780, independent: 237549, independent conditional: 237360, independent unconditional: 189, dependent: 3231, dependent conditional: 3231, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 240780, independent: 237549, independent conditional: 237360, independent unconditional: 189, dependent: 3231, dependent conditional: 3231, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 240780, independent: 237549, independent conditional: 237360, independent unconditional: 189, dependent: 3231, dependent conditional: 3231, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 249364, independent: 237549, independent conditional: 113643, independent unconditional: 123906, dependent: 11815, dependent conditional: 8585, dependent unconditional: 3230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 249364, independent: 237549, independent conditional: 49238, independent unconditional: 188311, dependent: 11815, dependent conditional: 4684, dependent unconditional: 7131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 249364, independent: 237549, independent conditional: 49238, independent unconditional: 188311, dependent: 11815, dependent conditional: 4684, dependent unconditional: 7131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1052, independent: 1017, independent conditional: 197, independent unconditional: 820, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1052, independent: 1000, independent conditional: 0, independent unconditional: 1000, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 52, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, independent: 23, independent conditional: 20, independent unconditional: 3, dependent: 71, dependent conditional: 56, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 249364, independent: 236532, independent conditional: 49041, independent unconditional: 187491, dependent: 11780, dependent conditional: 4662, dependent unconditional: 7118, unknown: 1052, unknown conditional: 219, unknown unconditional: 833] , Statistics on independence cache: Total cache size (in pairs): 1052, Positive cache size: 1017, Positive conditional cache size: 197, Positive unconditional cache size: 820, Negative cache size: 35, Negative conditional cache size: 22, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68306, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 249364, independent: 237549, independent conditional: 113643, independent unconditional: 123906, dependent: 11815, dependent conditional: 8585, dependent unconditional: 3230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 249364, independent: 237549, independent conditional: 49238, independent unconditional: 188311, dependent: 11815, dependent conditional: 4684, dependent unconditional: 7131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 249364, independent: 237549, independent conditional: 49238, independent unconditional: 188311, dependent: 11815, dependent conditional: 4684, dependent unconditional: 7131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1052, independent: 1017, independent conditional: 197, independent unconditional: 820, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1052, independent: 1000, independent conditional: 0, independent unconditional: 1000, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 52, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, independent: 23, independent conditional: 20, independent unconditional: 3, dependent: 71, dependent conditional: 56, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 249364, independent: 236532, independent conditional: 49041, independent unconditional: 187491, dependent: 11780, dependent conditional: 4662, dependent unconditional: 7118, unknown: 1052, unknown conditional: 219, unknown unconditional: 833] , Statistics on independence cache: Total cache size (in pairs): 1052, Positive cache size: 1017, Positive conditional cache size: 197, Positive unconditional cache size: 820, Negative cache size: 35, Negative conditional cache size: 22, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68306 ], Independence queries for same thread: 177 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 118 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 10.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 6.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 81, ConditionalCommutativityTraceChecks: 30, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 20:13:01,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-06 20:13:01,487 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...