/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-complex/workstealqueue_mutex-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-06 04:23:23,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 04:23:23,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 04:23:23,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 04:23:23,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 04:23:23,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 04:23:23,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 04:23:23,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 04:23:23,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 04:23:23,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 04:23:23,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 04:23:23,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 04:23:23,246 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 04:23:23,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 04:23:23,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 04:23:23,247 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 04:23:23,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 04:23:23,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 04:23:23,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 04:23:23,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 04:23:23,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 04:23:23,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 04:23:23,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 04:23:23,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 04:23:23,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 04:23:23,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 04:23:23,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 04:23:23,250 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 04:23:23,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 04:23:23,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 04:23:23,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 04:23:23,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 04:23:23,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 04:23:23,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 04:23:23,251 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 04:23:23,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 04:23:23,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 04:23:23,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 04:23:23,252 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 04:23:23,253 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-04-06 04:23:23,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 04:23:23,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 04:23:23,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 04:23:23,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-06 04:23:23,457 INFO L274 PluginConnector]: CDTParser initialized [2024-04-06 04:23:23,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2024-04-06 04:23:24,520 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-06 04:23:24,711 INFO L384 CDTParser]: Found 1 translation units. [2024-04-06 04:23:24,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2024-04-06 04:23:24,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1e2bbdc49/17ded485dbdf4523b8d8abc25a4d7dc8/FLAG85261dcc6 [2024-04-06 04:23:24,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1e2bbdc49/17ded485dbdf4523b8d8abc25a4d7dc8 [2024-04-06 04:23:24,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 04:23:24,756 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-06 04:23:24,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-06 04:23:24,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-06 04:23:24,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-06 04:23:24,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 04:23:24" (1/1) ... [2024-04-06 04:23:24,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d67d8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:24, skipping insertion in model container [2024-04-06 04:23:24,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 04:23:24" (1/1) ... [2024-04-06 04:23:24,832 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-06 04:23:25,323 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-complex/workstealqueue_mutex-2.i[76469,76482] [2024-04-06 04:23:25,361 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-complex/workstealqueue_mutex-2.i[79042,79055] [2024-04-06 04:23:25,369 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-complex/workstealqueue_mutex-2.i[79451,79464] [2024-04-06 04:23:25,389 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-06 04:23:25,402 INFO L202 MainTranslator]: Completed pre-run [2024-04-06 04:23:25,448 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-complex/workstealqueue_mutex-2.i[76469,76482] [2024-04-06 04:23:25,481 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-complex/workstealqueue_mutex-2.i[79042,79055] [2024-04-06 04:23:25,483 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-complex/workstealqueue_mutex-2.i[79451,79464] [2024-04-06 04:23:25,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-06 04:23:25,636 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-06 04:23:25,636 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-06 04:23:25,642 INFO L206 MainTranslator]: Completed translation [2024-04-06 04:23:25,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25 WrapperNode [2024-04-06 04:23:25,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-06 04:23:25,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 04:23:25,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 04:23:25,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 04:23:25,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (1/1) ... [2024-04-06 04:23:25,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (1/1) ... [2024-04-06 04:23:25,735 INFO L138 Inliner]: procedures = 490, calls = 130, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1858 [2024-04-06 04:23:25,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 04:23:25,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 04:23:25,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 04:23:25,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 04:23:25,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (1/1) ... [2024-04-06 04:23:25,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (1/1) ... [2024-04-06 04:23:25,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (1/1) ... [2024-04-06 04:23:25,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (1/1) ... [2024-04-06 04:23:25,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (1/1) ... [2024-04-06 04:23:25,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (1/1) ... [2024-04-06 04:23:25,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (1/1) ... [2024-04-06 04:23:25,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (1/1) ... [2024-04-06 04:23:25,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 04:23:25,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 04:23:25,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 04:23:25,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 04:23:25,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (1/1) ... [2024-04-06 04:23:25,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 04:23:25,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 04:23:25,864 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-06 04:23:25,897 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-06 04:23:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2024-04-06 04:23:25,936 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2024-04-06 04:23:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-06 04:23:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-06 04:23:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-06 04:23:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-06 04:23:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-04-06 04:23:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-06 04:23:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-04-06 04:23:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 04:23:25,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 04:23:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-06 04:23:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-04-06 04:23:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-04-06 04:23:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-06 04:23:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-06 04:23:25,941 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-06 04:23:26,414 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 04:23:26,416 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 04:23:28,012 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 04:23:28,231 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 04:23:28,231 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2024-04-06 04:23:28,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 04:23:28 BoogieIcfgContainer [2024-04-06 04:23:28,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 04:23:28,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 04:23:28,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 04:23:28,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 04:23:28,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 04:23:24" (1/3) ... [2024-04-06 04:23:28,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e99dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 04:23:28, skipping insertion in model container [2024-04-06 04:23:28,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:23:25" (2/3) ... [2024-04-06 04:23:28,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e99dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 04:23:28, skipping insertion in model container [2024-04-06 04:23:28,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 04:23:28" (3/3) ... [2024-04-06 04:23:28,239 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2024-04-06 04:23:28,246 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 04:23:28,252 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 04:23:28,253 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-04-06 04:23:28,253 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 04:23:28,420 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-04-06 04:23:28,461 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 04:23:28,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 04:23:28,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 04:23:28,482 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-06 04:23:28,496 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-06 04:23:28,526 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 04:23:28,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 04:23:28,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 04:23:28,560 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;@78407b18, 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 [2024-04-06 04:23:28,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-06 04:23:28,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-06 04:23:28,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 04:23:28,672 INFO L85 PathProgramCache]: Analyzing trace with hash 701593596, now seen corresponding path program 1 times [2024-04-06 04:23:28,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 04:23:28,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318093751] [2024-04-06 04:23:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 04:23:28,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 04:23:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 04:23:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 04:23:29,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 04:23:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318093751] [2024-04-06 04:23:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318093751] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 04:23:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 04:23:29,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 04:23:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792005484] [2024-04-06 04:23:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 04:23:29,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-06 04:23:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 04:23:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-06 04:23:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-06 04:23:29,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 04:23:29,408 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 04:23:29,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 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-06 04:23:29,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 04:23:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-06 04:23:29,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-06 04:23:29,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-06 04:23:29,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 04:23:29,514 INFO L85 PathProgramCache]: Analyzing trace with hash 207193806, now seen corresponding path program 1 times [2024-04-06 04:23:29,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 04:23:29,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671425937] [2024-04-06 04:23:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 04:23:29,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 04:23:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 04:23:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 04:23:29,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 04:23:29,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671425937] [2024-04-06 04:23:29,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671425937] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 04:23:29,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196848713] [2024-04-06 04:23:29,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 04:23:29,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 04:23:29,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 04:23:30,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-06 04:23:30,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-06 04:23:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 04:23:30,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 4 conjunts are in the unsatisfiable core [2024-04-06 04:23:30,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 04:23:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 04:23:30,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 04:23:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 04:23:30,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196848713] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 04:23:30,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 04:23:30,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-04-06 04:23:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743506272] [2024-04-06 04:23:30,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 04:23:30,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-04-06 04:23:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 04:23:30,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-04-06 04:23:30,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-04-06 04:23:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 04:23:30,425 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 04:23:30,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.5) internal successors, (235), 10 states have internal predecessors, (235), 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-06 04:23:30,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-06 04:23:30,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 04:23:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-06 04:23:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 04:23:30,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-06 04:23:30,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-04-06 04:23:30,757 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-06 04:23:30,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 04:23:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash 196159730, now seen corresponding path program 2 times [2024-04-06 04:23:30,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 04:23:30,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707671490] [2024-04-06 04:23:30,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 04:23:30,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 04:23:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 04:23:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 04:23:31,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 04:23:31,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707671490] [2024-04-06 04:23:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707671490] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 04:23:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789002927] [2024-04-06 04:23:31,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-06 04:23:31,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 04:23:31,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 04:23:31,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-06 04:23:31,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-06 04:23:31,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-06 04:23:31,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 04:23:31,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 8 conjunts are in the unsatisfiable core [2024-04-06 04:23:31,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 04:23:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 04:23:31,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 04:23:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 04:23:31,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789002927] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 04:23:31,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 04:23:31,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2024-04-06 04:23:31,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971604174] [2024-04-06 04:23:31,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 04:23:31,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-06 04:23:31,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 04:23:31,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-06 04:23:31,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-04-06 04:23:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 04:23:31,578 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 04:23:31,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.09090909090909) internal successors, (243), 11 states have internal predecessors, (243), 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-06 04:23:31,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-06 04:23:31,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 04:23:31,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 04:23:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-06 04:23:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 04:23:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-04-06 04:23:31,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-06 04:23:31,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 04:23:31,912 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-06 04:23:31,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 04:23:31,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1306461116, now seen corresponding path program 3 times [2024-04-06 04:23:31,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 04:23:31,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260924130] [2024-04-06 04:23:31,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 04:23:31,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 04:23:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 04:23:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-06 04:23:46,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 04:23:46,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260924130] [2024-04-06 04:23:46,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260924130] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 04:23:46,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16954974] [2024-04-06 04:23:46,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-06 04:23:46,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 04:23:46,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 04:23:46,905 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-06 04:23:46,906 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-06 04:23:55,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-04-06 04:23:55,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 04:23:55,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 195 conjunts are in the unsatisfiable core [2024-04-06 04:23:55,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 04:23:56,014 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2024-04-06 04:23:56,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2024-04-06 04:23:57,233 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-06 04:23:57,525 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 23 treesize of output 11 [2024-04-06 04:23:58,579 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 19 treesize of output 18 [2024-04-06 04:23:59,290 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 23 treesize of output 16 [2024-04-06 04:23:59,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 04:23:59,687 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 23 treesize of output 16 [2024-04-06 04:23:59,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 04:23:59,911 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 23 treesize of output 16 [2024-04-06 04:24:00,459 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 23 treesize of output 16 [2024-04-06 04:24:00,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-06 04:24:01,145 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2024-04-06 04:24:01,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2024-04-06 04:24:02,550 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2024-04-06 04:24:02,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2024-04-06 04:24:04,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2024-04-06 04:24:04,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2024-04-06 04:24:07,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 04:24:07,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-04-06 04:24:08,179 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-04-06 04:24:08,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2024-04-06 04:24:09,513 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-04-06 04:24:09,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2024-04-06 04:24:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-04-06 04:24:10,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 04:24:10,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 04:24:10,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 101 [2024-04-06 04:24:10,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 04:24:10,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 95 [2024-04-06 04:24:11,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-04-06 04:24:33,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 04:24:33,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 115 [2024-04-06 04:24:33,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 04:24:33,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 109 [2024-04-06 04:24:35,791 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base|))) (let ((.cse10 (select |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_#in~expected#1.base|)) (.cse11 (select .cse5 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset|))) (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse0 (= (select .cse10 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset|) .cse11))) (and (or (not .cse0) (and (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_DerPreprocessor_7 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse4 (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse5 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_7)))) (let ((.cse1 (store (select .cse4 |c_~#q~0.base|) v_prenex_18 v_prenex_20))) (or (not (= (select (store |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_prenex_19) v_prenex_17) 0)) (= (select .cse1 .cse2) 0) (< .cse3 v_prenex_18) (not (= (select (select (store .cse4 |c_~#q~0.base| .cse1) v_prenex_17) 0) 0)))))) (forall ((|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_56| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_StealerThread1of1ForFork0_atomic_exchange_~obj#1.offset_28| Int) (v_ArrVal_839 Int) (v_DerPreprocessor_7 Int) (|StealerThread1of1ForFork0_atomic_exchange_~v#1| Int)) (let ((.cse6 (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse5 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_7)))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| (store (select .cse6 |c_~#q~0.base|) |v_StealerThread1of1ForFork0_atomic_exchange_~obj#1.offset_28| |StealerThread1of1ForFork0_atomic_exchange_~v#1|)) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_56|) 0) 0)) (not (= (select (store |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_839) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_56|) 0)) (< (select (select (store .cse6 |c_~#q~0.base| v_DerPreprocessor_2) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_56|) 0) (+ (select (select .cse6 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|) 1)) (< .cse3 |v_StealerThread1of1ForFork0_atomic_exchange_~obj#1.offset_28|)))))) (or (let ((.cse7 (store |c_#memory_int| |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_#in~expected#1.base| (store .cse10 |c_StealerThread1of1ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset| .cse11)))) (let ((.cse8 (select .cse7 |c_~#q~0.base|))) (and (forall ((|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_56| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_839 Int) (|v_StealerThread1of1ForFork0_atomic_exchange_~obj#1.offset_28| Int) (|StealerThread1of1ForFork0_atomic_exchange_~v#1| Int)) (or (< (select (select (store .cse7 |c_~#q~0.base| v_DerPreprocessor_2) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_56|) 0) (+ (select (select .cse7 |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of1ForFork0_readV_~#expected~0#1.offset|) 1)) (not (= (select (store |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_839) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_56|) 0)) (< .cse3 |v_StealerThread1of1ForFork0_atomic_exchange_~obj#1.offset_28|) (not (= 0 (select (select (store .cse7 |c_~#q~0.base| (store .cse8 |v_StealerThread1of1ForFork0_atomic_exchange_~obj#1.offset_28| |StealerThread1of1ForFork0_atomic_exchange_~v#1|)) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_56|) 0))))) (forall ((|v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_56| Int) (v_ArrVal_839 Int) (|v_StealerThread1of1ForFork0_atomic_exchange_~obj#1.offset_28| Int) (|StealerThread1of1ForFork0_atomic_exchange_~v#1| Int)) (let ((.cse9 (store .cse8 |v_StealerThread1of1ForFork0_atomic_exchange_~obj#1.offset_28| |StealerThread1of1ForFork0_atomic_exchange_~v#1|))) (or (= (select .cse9 .cse2) 0) (not (= (select (store |c_#valid| |c_StealerThread1of1ForFork0_readV_~#expected~0#1.base| v_ArrVal_839) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_56|) 0)) (< .cse3 |v_StealerThread1of1ForFork0_atomic_exchange_~obj#1.offset_28|) (not (= 0 (select (select (store .cse7 |c_~#q~0.base| .cse9) |v_StealerThread1of1ForFork0_readV_~#expected~0#1.base_56|) 0))))))))) .cse0))))) is different from false [2024-04-06 04:29:18,313 INFO L349 Elim1Store]: treesize reduction 45, result has 57.1 percent of original size [2024-04-06 04:29:18,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 538 treesize of output 293 [2024-04-06 04:31:35,143 WARN L293 SmtUtils]: Spent 2.27m on a formula simplification. DAG size of input: 37 DAG size of output: 26 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-06 04:31:35,143 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2024-04-06 04:31:35,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 246359618 treesize of output 244607555 [2024-04-06 04:31:46,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 04:31:46,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 290446350 treesize of output 289990946 [2024-04-06 04:33:48,236 WARN L293 SmtUtils]: Spent 2.03m on a formula simplification. DAG size of input: 43422 DAG size of output: 2535 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-04-06 04:33:48,413 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 04:33:48,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 04:33:48,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 677220 treesize of output 664556 [2024-04-06 04:34:15,279 WARN L293 SmtUtils]: Spent 26.69s on a formula simplification. DAG size of input: 2532 DAG size of output: 2541 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-04-06 04:34:15,332 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 04:34:15,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 04:34:15,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 735267 treesize of output 684603 [2024-04-06 04:34:49,120 WARN L293 SmtUtils]: Spent 33.58s on a formula simplification. DAG size of input: 2480 DAG size of output: 2477 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-04-06 04:34:49,256 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 04:34:49,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 04:34:49,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 693193 treesize of output 686911 [2024-04-06 04:35:07,397 WARN L293 SmtUtils]: Spent 17.96s on a formula simplification. DAG size of input: 2325 DAG size of output: 2323 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-04-06 04:35:07,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 04:35:07,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-06 04:35:07,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 722295 treesize of output 697055 [2024-04-06 04:35:46,985 WARN L293 SmtUtils]: Spent 39.31s on a formula simplification. DAG size of input: 2212 DAG size of output: 2211 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-04-06 04:36:45,656 WARN L293 SmtUtils]: Spent 39.00s on a formula simplification that was a NOOP. DAG size: 1793 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2024-04-06 04:37:47,249 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-04-06 04:37:47,256 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-06 04:37:47,256 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-06 04:37:47,256 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-06 04:37:47,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-04-06 04:37:47,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 04:37:47,460 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 248 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. [2024-04-06 04:37:47,462 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-04-06 04:37:47,462 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-04-06 04:37:47,462 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-04-06 04:37:47,465 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-04-06 04:37:47,465 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-04-06 04:37:47,468 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2024-04-06 04:37:47,470 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-06 04:37:47,470 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-06 04:37:47,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 04:37:47 BasicIcfg [2024-04-06 04:37:47,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-06 04:37:47,475 INFO L158 Benchmark]: Toolchain (without parser) took 862716.51ms. Allocated memory was 354.4MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 280.3MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2024-04-06 04:37:47,475 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 04:37:47,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 884.28ms. Allocated memory is still 354.4MB. Free memory was 279.9MB in the beginning and 297.5MB in the end (delta: -17.6MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2024-04-06 04:37:47,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.83ms. Allocated memory is still 354.4MB. Free memory was 297.5MB in the beginning and 287.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-04-06 04:37:47,476 INFO L158 Benchmark]: Boogie Preprocessor took 95.17ms. Allocated memory is still 354.4MB. Free memory was 287.0MB in the beginning and 277.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-04-06 04:37:47,477 INFO L158 Benchmark]: RCFGBuilder took 2401.37ms. Allocated memory is still 354.4MB. Free memory was 277.6MB in the beginning and 139.0MB in the end (delta: 138.6MB). Peak memory consumption was 138.6MB. Max. memory is 8.0GB. [2024-04-06 04:37:47,477 INFO L158 Benchmark]: TraceAbstraction took 859237.27ms. Allocated memory was 354.4MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 138.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2024-04-06 04:37:47,478 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.09ms. Allocated memory is still 177.2MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 884.28ms. Allocated memory is still 354.4MB. Free memory was 279.9MB in the beginning and 297.5MB in the end (delta: -17.6MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 91.83ms. Allocated memory is still 354.4MB. Free memory was 297.5MB in the beginning and 287.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 95.17ms. Allocated memory is still 354.4MB. Free memory was 287.0MB in the beginning and 277.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2401.37ms. Allocated memory is still 354.4MB. Free memory was 277.6MB in the beginning and 139.0MB in the end (delta: 138.6MB). Peak memory consumption was 138.6MB. Max. memory is 8.0GB. * TraceAbstraction took 859237.27ms. Allocated memory was 354.4MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 138.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6186, independent: 3735, independent conditional: 2550, independent unconditional: 1185, dependent: 2451, dependent conditional: 1654, dependent unconditional: 797, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3735, independent: 3735, independent conditional: 2550, independent unconditional: 1185, 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: 3735, independent: 3735, independent conditional: 2550, independent unconditional: 1185, 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: 3735, independent: 3735, independent conditional: 2550, independent unconditional: 1185, 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: 3735, independent: 3735, independent conditional: 52, independent unconditional: 3683, 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: 3735, independent: 3735, independent conditional: 10, independent unconditional: 3725, 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: 3735, independent: 3735, independent conditional: 10, independent unconditional: 3725, 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: 485, independent: 485, independent conditional: 0, independent unconditional: 485, 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: 485, independent: 485, independent conditional: 0, independent unconditional: 485, 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: 3735, independent: 3250, independent conditional: 10, independent unconditional: 3240, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 485, unknown conditional: 0, unknown unconditional: 485] , Statistics on independence cache: Total cache size (in pairs): 485, Positive cache size: 485, Positive conditional cache size: 0, Positive unconditional cache size: 485, 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: 42, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3735, independent: 3735, independent conditional: 52, independent unconditional: 3683, 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: 3735, independent: 3735, independent conditional: 10, independent unconditional: 3725, 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: 3735, independent: 3735, independent conditional: 10, independent unconditional: 3725, 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: 485, independent: 485, independent conditional: 0, independent unconditional: 485, 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: 485, independent: 485, independent conditional: 0, independent unconditional: 485, 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: 3735, independent: 3250, independent conditional: 10, independent unconditional: 3240, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 485, unknown conditional: 0, unknown unconditional: 485] , Statistics on independence cache: Total cache size (in pairs): 485, Positive cache size: 485, Positive conditional cache size: 0, Positive unconditional cache size: 485, 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: 42 ], Independence queries for same thread: 2451 - TimeoutResultAtElement [Line: 1952]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 248 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1793]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 248 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 248 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 248 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 248 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 248 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 1904 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 859.0s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 24, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1562 ConstructedInterpolants, 0 QuantifiedInterpolants, 1816 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1364 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 35/137 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown