/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --traceabstraction.refinement.strategy.for.commutativity.condition.synthesis BADGER -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 15:12:37,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 15:12:37,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 15:12:37,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 15:12:37,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 15:12:37,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 15:12:37,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 15:12:37,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 15:12:37,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 15:12:37,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 15:12:37,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 15:12:37,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 15:12:37,525 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 15:12:37,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 15:12:37,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 15:12:37,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 15:12:37,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 15:12:37,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 15:12:37,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 15:12:37,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 15:12:37,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 15:12:37,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 15:12:37,527 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 15:12:37,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 15:12:37,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 15:12:37,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 15:12:37,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 15:12:37,527 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 15:12:37,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 15:12:37,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 15:12:37,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 15:12:37,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 15:12:37,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 15:12:37,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 15:12:37,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 15:12:37,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 15:12:37,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 15:12:37,528 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 15:12:37,528 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 15:12:37,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Refinement strategy for commutativity condition synthesis -> BADGER [2024-11-14 15:12:37,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 15:12:37,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 15:12:37,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 15:12:37,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 15:12:37,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 15:12:37,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-11-14 15:12:39,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 15:12:39,401 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 15:12:39,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-11-14 15:12:39,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/1c624ee89/ed6c964488ed463683da13eb8b01b7d4/FLAG71223221c [2024-11-14 15:12:39,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/1c624ee89/ed6c964488ed463683da13eb8b01b7d4 [2024-11-14 15:12:39,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 15:12:39,649 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 15:12:39,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 15:12:39,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 15:12:39,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 15:12:39,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:12:39" (1/1) ... [2024-11-14 15:12:39,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52511f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:39, skipping insertion in model container [2024-11-14 15:12:39,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:12:39" (1/1) ... [2024-11-14 15:12:39,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 15:12:39,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i[31308,31321] [2024-11-14 15:12:40,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 15:12:40,044 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 15:12:40,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i[31308,31321] [2024-11-14 15:12:40,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 15:12:40,142 INFO L204 MainTranslator]: Completed translation [2024-11-14 15:12:40,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40 WrapperNode [2024-11-14 15:12:40,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 15:12:40,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 15:12:40,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 15:12:40,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 15:12:40,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (1/1) ... [2024-11-14 15:12:40,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (1/1) ... [2024-11-14 15:12:40,211 INFO L138 Inliner]: procedures = 179, calls = 46, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 825 [2024-11-14 15:12:40,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 15:12:40,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 15:12:40,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 15:12:40,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 15:12:40,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (1/1) ... [2024-11-14 15:12:40,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (1/1) ... [2024-11-14 15:12:40,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (1/1) ... [2024-11-14 15:12:40,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (1/1) ... [2024-11-14 15:12:40,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (1/1) ... [2024-11-14 15:12:40,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (1/1) ... [2024-11-14 15:12:40,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (1/1) ... [2024-11-14 15:12:40,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (1/1) ... [2024-11-14 15:12:40,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 15:12:40,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 15:12:40,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 15:12:40,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 15:12:40,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (1/1) ... [2024-11-14 15:12:40,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 15:12:40,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 15:12:40,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 15:12:40,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 15:12:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 15:12:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-14 15:12:40,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-14 15:12:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 15:12:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 15:12:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 15:12:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 15:12:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 15:12:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 15:12:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 15:12:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 15:12:40,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 15:12:40,330 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 15:12:40,473 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 15:12:40,475 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 15:12:41,244 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 15:12:41,245 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 15:12:41,447 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 15:12:41,448 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 15:12:41,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:12:41 BoogieIcfgContainer [2024-11-14 15:12:41,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 15:12:41,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 15:12:41,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 15:12:41,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 15:12:41,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:12:39" (1/3) ... [2024-11-14 15:12:41,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af3d70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:12:41, skipping insertion in model container [2024-11-14 15:12:41,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:40" (2/3) ... [2024-11-14 15:12:41,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af3d70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:12:41, skipping insertion in model container [2024-11-14 15:12:41,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:12:41" (3/3) ... [2024-11-14 15:12:41,457 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2024-11-14 15:12:41,473 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 15:12:41,475 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas_longer-1.i that has 2 procedures, 744 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-14 15:12:41,476 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 15:12:41,596 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 15:12:41,671 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 15:12:41,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 15:12:41,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 15:12:41,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-14 15:12:41,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-14 15:12:41,762 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 15:12:41,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-11-14 15:12:41,782 INFO L333 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, 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;@5aa4e719, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 15:12:41,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 15:12:42,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 15:12:42,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 15:12:42,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1585023130, now seen corresponding path program 1 times [2024-11-14 15:12:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 15:12:42,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740055489] [2024-11-14 15:12:42,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 15:12:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 15:12:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 15:12:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 15:12:44,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 15:12:44,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740055489] [2024-11-14 15:12:44,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740055489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 15:12:44,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 15:12:44,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 15:12:44,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691583381] [2024-11-14 15:12:44,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 15:12:44,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 15:12:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 15:12:44,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 15:12:44,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 15:12:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 15:12:44,192 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 15:12:44,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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-11-14 15:12:44,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 15:12:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 15:12:44,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 15:12:44,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 15:12:44,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 15:12:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash 84910909, now seen corresponding path program 1 times [2024-11-14 15:12:44,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 15:12:44,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714906819] [2024-11-14 15:12:44,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 15:12:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 15:12:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 15:12:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 15:12:45,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 15:12:45,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714906819] [2024-11-14 15:12:45,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714906819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 15:12:45,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 15:12:45,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 15:12:45,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162930207] [2024-11-14 15:12:45,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 15:12:45,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 15:12:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 15:12:45,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 15:12:45,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 15:12:45,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 15:12:45,750 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 15:12:45,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 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-11-14 15:12:45,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 15:12:45,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 15:12:45,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 15:12:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 15:12:45,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 15:12:45,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 15:12:45,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 15:12:45,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1978122516, now seen corresponding path program 1 times [2024-11-14 15:12:45,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 15:12:45,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585522418] [2024-11-14 15:12:45,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 15:12:45,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 15:12:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 15:12:47,004 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 15:12:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 15:12:48,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-14 15:12:48,095 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-14 15:12:48,095 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 15:12:48,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 15:12:48,105 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-14 15:12:48,106 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was UNSAFE (1/2) [2024-11-14 15:12:48,225 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 15:12:48,227 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 15:12:48,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-14 15:12:48,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:12:48 BasicIcfg [2024-11-14 15:12:48,249 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 15:12:48,249 INFO L158 Benchmark]: Toolchain (without parser) took 8600.38ms. Allocated memory was 100.7MB in the beginning and 448.8MB in the end (delta: 348.1MB). Free memory was 71.5MB in the beginning and 238.9MB in the end (delta: -167.4MB). Peak memory consumption was 356.4MB. Max. memory is 8.0GB. [2024-11-14 15:12:48,250 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 100.7MB. Free memory is still 52.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 15:12:48,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.35ms. Allocated memory is still 100.7MB. Free memory was 71.5MB in the beginning and 46.5MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-11-14 15:12:48,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.72ms. Allocated memory is still 100.7MB. Free memory was 46.5MB in the beginning and 42.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-14 15:12:48,252 INFO L158 Benchmark]: Boogie Preprocessor took 51.25ms. Allocated memory is still 100.7MB. Free memory was 42.0MB in the beginning and 38.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-14 15:12:48,252 INFO L158 Benchmark]: RCFGBuilder took 1184.28ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 38.1MB in the beginning and 86.0MB in the end (delta: -47.9MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. [2024-11-14 15:12:48,252 INFO L158 Benchmark]: TraceAbstraction took 6798.17ms. Allocated memory was 125.8MB in the beginning and 448.8MB in the end (delta: 323.0MB). Free memory was 85.3MB in the beginning and 238.9MB in the end (delta: -153.6MB). Peak memory consumption was 346.6MB. Max. memory is 8.0GB. [2024-11-14 15:12:48,255 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.25ms. Allocated memory is still 100.7MB. Free memory is still 52.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 493.35ms. Allocated memory is still 100.7MB. Free memory was 71.5MB in the beginning and 46.5MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.72ms. Allocated memory is still 100.7MB. Free memory was 46.5MB in the beginning and 42.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.25ms. Allocated memory is still 100.7MB. Free memory was 42.0MB in the beginning and 38.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1184.28ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 38.1MB in the beginning and 86.0MB in the end (delta: -47.9MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6798.17ms. Allocated memory was 125.8MB in the beginning and 448.8MB in the end (delta: 323.0MB). Free memory was 85.3MB in the beginning and 238.9MB in the end (delta: -153.6MB). Peak memory consumption was 346.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1972, independent: 1837, independent conditional: 250, independent unconditional: 1587, dependent: 135, dependent conditional: 124, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1848, independent: 1837, independent conditional: 250, independent unconditional: 1587, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1848, independent: 1837, independent conditional: 250, independent unconditional: 1587, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1848, independent: 1837, independent conditional: 250, independent unconditional: 1587, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1848, independent: 1837, independent conditional: 0, independent unconditional: 1837, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1848, independent: 1837, independent conditional: 0, independent unconditional: 1837, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1379, independent: 1368, independent conditional: 0, independent unconditional: 1368, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1379, independent: 1349, independent conditional: 0, independent unconditional: 1349, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 30, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 577, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 1848, independent: 469, independent conditional: 0, independent unconditional: 469, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1379, unknown conditional: 0, unknown unconditional: 1379] , Statistics on independence cache: Total cache size (in pairs): 1379, Positive cache size: 1368, Positive conditional cache size: 0, Positive unconditional cache size: 1368, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 250, Maximal queried relation: 0, Independence queries for same thread: 124, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, Number of persistent set computation: 742, Number of trivial persistent sets: 700, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1598, independent: 1587, independent conditional: 0, independent unconditional: 1587, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1972, independent: 1837, independent conditional: 250, independent unconditional: 1587, dependent: 135, dependent conditional: 124, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1848, independent: 1837, independent conditional: 250, independent unconditional: 1587, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1848, independent: 1837, independent conditional: 250, independent unconditional: 1587, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1848, independent: 1837, independent conditional: 250, independent unconditional: 1587, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1848, independent: 1837, independent conditional: 0, independent unconditional: 1837, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1848, independent: 1837, independent conditional: 0, independent unconditional: 1837, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1379, independent: 1368, independent conditional: 0, independent unconditional: 1368, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1379, independent: 1349, independent conditional: 0, independent unconditional: 1349, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 30, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 577, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 1848, independent: 469, independent conditional: 0, independent unconditional: 469, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1379, unknown conditional: 0, unknown unconditional: 1379] , Statistics on independence cache: Total cache size (in pairs): 1379, Positive cache size: 1368, Positive conditional cache size: 0, Positive unconditional cache size: 1368, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 250, Maximal queried relation: 0, Independence queries for same thread: 124 - CounterExampleResult [Line: 763]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L716] 0 int memory[(2*320+1)]; [L717] 0 int next_alloc_idx = 1; VAL [next_alloc_idx=1] [L718] 0 int m = 0; VAL [m={3:0}, next_alloc_idx=1] [L719] 0 int top; VAL [m={3:0}, next_alloc_idx=1, top={4:0}] [L773] 0 int m2 = 0; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, top={4:0}] [L774] 0 int state = 0; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, top={4:0}] [L792] 0 pthread_t t; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, top={4:0}] [L793] COND TRUE 0 1 VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, top={4:0}] [L793] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, t=-1, top={4:0}] [L777] CALL 1 __VERIFIER_atomic_acquire(&m2) [L693] EXPR 1 \read(*m) [L693] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(*m==0) [L694] 1 *m = 1 [L777] RET 1 __VERIFIER_atomic_acquire(&m2) [L780] 1 case 0: [L781] CALL 1 EBStack_init() [L734] 1 top = 0 VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, top={4:0}] [L781] RET 1 EBStack_init() [L782] 1 state = 1 VAL [\old(arg)={0:0}, arg={0:0}, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L783] 1 case 1: VAL [\old(arg)={0:0}, arg={0:0}, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L784] CALL 1 __VERIFIER_atomic_release(&m2) [L698] EXPR 1 \read(*m) [L698] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L698] RET 1 assume_abort_if_not(*m==1) [L699] 1 *m = 0 [L784] RET 1 __VERIFIER_atomic_release(&m2) [L785] CALL 1 push_loop() [L766] 1 int r = -1; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, r=-1, state=1, top={4:0}] [L767] 1 int arg = __VERIFIER_nondet_int(); VAL [arg=0, m2={5:0}, m={3:0}, next_alloc_idx=1, r=-1, state=1, top={4:0}] [L768] COND TRUE 1 1 [L769] CALL, EXPR 1 push(arg) [L743] 1 int oldTop = -1, newTop = -1, casret = -1; VAL [\old(d)=0, casret={641:0}, d=0, m2={5:0}, m={3:0}, newTop=-1, next_alloc_idx=1, oldTop=-1, state=1, top={4:0}] [L744] CALL, EXPR 1 index_malloc() [L721] 1 int curr_alloc_idx = -1; VAL [curr_alloc_idx=-1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L722] CALL 1 __VERIFIER_atomic_acquire(&m) [L693] EXPR 1 \read(*m) [L693] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(*m==0) [L694] 1 *m = 1 [L722] RET 1 __VERIFIER_atomic_acquire(&m) [L723] COND FALSE 1 !(next_alloc_idx+2-1 > (2*320+1)) VAL [curr_alloc_idx=-1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L727] 1 curr_alloc_idx = next_alloc_idx VAL [curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L728] 1 next_alloc_idx += 2 VAL [curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=3, state=1, top={4:0}] [L729] CALL 1 __VERIFIER_atomic_release(&m) [L698] EXPR 1 \read(*m) [L698] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L698] RET 1 assume_abort_if_not(*m==1) [L699] 1 *m = 0 [L729] RET 1 __VERIFIER_atomic_release(&m) [L731] 1 return curr_alloc_idx; VAL [\result=1, curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=3, state=1, top={4:0}] [L744] RET, EXPR 1 index_malloc() [L744] 1 newTop = index_malloc() VAL [\old(d)=0, casret={641:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L745] COND FALSE 1 !(newTop == 0) VAL [\old(d)=0, casret={641:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L748] 1 memory[newTop+0] = d VAL [\old(d)=0, casret={641:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L793] COND TRUE 0 1 VAL [m2={5:0}, m={3:0}, next_alloc_idx=3, state=1, t=-1, top={4:0}] [L793] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [m2={5:0}, m={3:0}, next_alloc_idx=3, state=1, t=0, top={4:0}] [L749] COND TRUE 1 1 VAL [\old(d)=0, casret={641:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L751] EXPR 1 \read(top) [L751] 1 oldTop = top [L753] 1 memory[newTop+1] = oldTop VAL [\old(d)=0, casret={641:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L754] CALL 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L707] EXPR 1 \read(*v) [L707] COND TRUE 1 *v == e [L709] 1 *v = u [L709] 1 *r = 1 [L754] RET 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L755] EXPR 1 \read(casret) VAL [\old(d)=0, casret={641:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L755] COND TRUE 1 casret==1 VAL [\old(d)=0, casret={641:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L756] 1 return 1; VAL [\old(d)=0, \result=1, casret={641:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L743] 1 int oldTop = -1, newTop = -1, casret = -1; VAL [\old(d)=0, \result=1, casret={641:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L756] 1 return 1; VAL [\old(d)=0, \result=1, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L769] RET, EXPR 1 push(arg) [L769] 1 r = push(arg) VAL [arg=0, m2={5:0}, m={3:0}, next_alloc_idx=3, r=1, state=1, top={4:0}] [L770] CALL 1 __VERIFIER_atomic_assert(r) [L763] EXPR 1 !r || !isEmpty() [L763] CALL, EXPR 1 isEmpty() [L737] EXPR 1 \read(top) [L737] COND FALSE 1 !(top == 0) [L740] 1 return 0; [L763] RET, EXPR 1 isEmpty() [L763] EXPR 1 !r || !isEmpty() [L763] COND TRUE 1 !(!(!r || !isEmpty())) [L763] 1 reach_error() VAL [\old(r)=1, m2={5:0}, m={3:0}, next_alloc_idx=3, r=1, state=1, top={4:0}] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr1Thread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 817 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.2s, 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: 14, 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, 1.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2163 NumberOfCodeBlocks, 2163 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 1431 ConstructedInterpolants, 0 QuantifiedInterpolants, 1647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate proved your program to be incorrect! [2024-11-14 15:12:48,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...