/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 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 14:07:23,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 14:07:23,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 14:07:23,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 14:07:23,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 14:07:23,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 14:07:23,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 14:07:23,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 14:07:23,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 14:07:23,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 14:07:23,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 14:07:23,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 14:07:23,189 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 14:07:23,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 14:07:23,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 14:07:23,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:07:23,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:07:23,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 14:07:23,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 14:07:23,192 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 14:07:23,193 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 14:07:23,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 14:07:23,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 14:07:23,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 14:07:23,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 14:07:23,445 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 14:07:23,445 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 14:07:23,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2025-04-14 14:07:24,784 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0929587ad/a0151365bbf74a19a18f0bc62ff753b0/FLAGcd7389a68 [2025-04-14 14:07:25,016 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 14:07:25,016 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2025-04-14 14:07:25,026 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0929587ad/a0151365bbf74a19a18f0bc62ff753b0/FLAGcd7389a68 [2025-04-14 14:07:25,784 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0929587ad/a0151365bbf74a19a18f0bc62ff753b0 [2025-04-14 14:07:25,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 14:07:25,787 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 14:07:25,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 14:07:25,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 14:07:25,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 14:07:25,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:07:25" (1/1) ... [2025-04-14 14:07:25,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381148b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:25, skipping insertion in model container [2025-04-14 14:07:25,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:07:25" (1/1) ... [2025-04-14 14:07:25,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 14:07:26,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] [2025-04-14 14:07:26,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 14:07:26,171 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 14:07:26,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] [2025-04-14 14:07:26,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 14:07:26,286 INFO L204 MainTranslator]: Completed translation [2025-04-14 14:07:26,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26 WrapperNode [2025-04-14 14:07:26,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 14:07:26,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 14:07:26,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 14:07:26,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 14:07:26,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (1/1) ... [2025-04-14 14:07:26,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (1/1) ... [2025-04-14 14:07:26,322 INFO L138 Inliner]: procedures = 172, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2025-04-14 14:07:26,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 14:07:26,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 14:07:26,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 14:07:26,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 14:07:26,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (1/1) ... [2025-04-14 14:07:26,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (1/1) ... [2025-04-14 14:07:26,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (1/1) ... [2025-04-14 14:07:26,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (1/1) ... [2025-04-14 14:07:26,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (1/1) ... [2025-04-14 14:07:26,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (1/1) ... [2025-04-14 14:07:26,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (1/1) ... [2025-04-14 14:07:26,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (1/1) ... [2025-04-14 14:07:26,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 14:07:26,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 14:07:26,347 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 14:07:26,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 14:07:26,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (1/1) ... [2025-04-14 14:07:26,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:07:26,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:07:26,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 14:07:26,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 14:07:26,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 14:07:26,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 14:07:26,412 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-04-14 14:07:26,413 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-04-14 14:07:26,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 14:07:26,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 14:07:26,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 14:07:26,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 14:07:26,413 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-04-14 14:07:26,413 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-04-14 14:07:26,414 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 14:07:26,507 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 14:07:26,508 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 14:07:26,630 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 14:07:26,630 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 14:07:26,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 14:07:26,702 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 14:07:26,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 02:07:26 BoogieIcfgContainer [2025-04-14 14:07:26,703 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 14:07:26,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 14:07:26,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 14:07:26,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 14:07:26,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:07:25" (1/3) ... [2025-04-14 14:07:26,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbd26db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:07:26, skipping insertion in model container [2025-04-14 14:07:26,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:07:26" (2/3) ... [2025-04-14 14:07:26,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbd26db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:07:26, skipping insertion in model container [2025-04-14 14:07:26,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 02:07:26" (3/3) ... [2025-04-14 14:07:26,713 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2025-04-14 14:07:26,726 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 14:07:26,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG read_write_lock-2.i that has 3 procedures, 34 locations, 32 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 14:07:26,728 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 14:07:26,778 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 14:07:26,815 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:07:26,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 14:07:26,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:07:26,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 14:07:26,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 14:07:26,882 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 14:07:26,896 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == readerThread1of1ForFork0 ======== [2025-04-14 14:07:26,901 INFO L340 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;@2ccb9d35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:07:26,902 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 14:07:27,187 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:07:27,188 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:07:27,188 INFO L139 ounterexampleChecker]: Examining path program with hash -1453102548, occurence #1 [2025-04-14 14:07:27,188 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:07:27,188 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:07:27,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:07:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1209255971, now seen corresponding path program 1 times [2025-04-14 14:07:27,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:07:27,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948477957] [2025-04-14 14:07:27,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:07:27,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:07:27,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 14:07:27,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 14:07:27,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:07:27,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:07:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:07:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:07:27,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948477957] [2025-04-14 14:07:27,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948477957] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:07:27,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:07:27,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 14:07:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853325277] [2025-04-14 14:07:27,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:07:27,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 14:07:27,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:07:27,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 14:07:27,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 14:07:27,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:27,446 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:07:27,448 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-04-14 14:07:27,448 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:27,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:07:27,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 14:07:27,657 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:07:27,657 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:07:27,657 INFO L139 ounterexampleChecker]: Examining path program with hash 819835700, occurence #1 [2025-04-14 14:07:27,657 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:07:27,657 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:07:27,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:07:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1211861085, now seen corresponding path program 1 times [2025-04-14 14:07:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:07:27,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704115791] [2025-04-14 14:07:27,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:07:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:07:27,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 14:07:27,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 14:07:27,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:07:27,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:07:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:07:27,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:07:27,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704115791] [2025-04-14 14:07:27,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704115791] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:07:27,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:07:27,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 14:07:27,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963666094] [2025-04-14 14:07:27,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:07:27,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:07:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:07:27,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:07:27,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:07:27,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:27,789 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:07:27,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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) [2025-04-14 14:07:27,789 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:07:27,789 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:28,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:07:28,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:07:28,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 14:07:28,030 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:07:28,030 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:07:28,030 INFO L139 ounterexampleChecker]: Examining path program with hash 612568975, occurence #1 [2025-04-14 14:07:28,030 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:07:28,030 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:07:28,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:07:28,030 INFO L85 PathProgramCache]: Analyzing trace with hash 214900465, now seen corresponding path program 1 times [2025-04-14 14:07:28,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:07:28,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130889162] [2025-04-14 14:07:28,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:07:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:07:28,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 14:07:28,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 14:07:28,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:07:28,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:07:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:07:28,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:07:28,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130889162] [2025-04-14 14:07:28,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130889162] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:07:28,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:07:28,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 14:07:28,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3387634] [2025-04-14 14:07:28,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:07:28,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 14:07:28,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:07:28,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 14:07:28,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 14:07:28,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:28,196 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:07:28,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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) [2025-04-14 14:07:28,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:07:28,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:07:28,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:28,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:07:28,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:07:28,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:07:28,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 14:07:28,354 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:07:28,354 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:07:28,354 INFO L139 ounterexampleChecker]: Examining path program with hash -1999943418, occurence #1 [2025-04-14 14:07:28,354 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:07:28,354 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:07:28,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:07:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1836215767, now seen corresponding path program 1 times [2025-04-14 14:07:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:07:28,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184543454] [2025-04-14 14:07:28,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:07:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:07:28,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 14:07:28,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 14:07:28,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:07:28,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:07:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:07:28,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:07:28,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184543454] [2025-04-14 14:07:28,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184543454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:07:28,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:07:28,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 14:07:28,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31112192] [2025-04-14 14:07:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:07:28,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 14:07:28,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:07:28,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 14:07:28,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 14:07:28,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:28,460 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:07:28,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2025-04-14 14:07:28,461 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:07:28,461 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:07:28,461 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:07:28,461 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:29,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:07:29,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:07:29,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:07:29,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:07:29,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 14:07:29,080 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:07:29,080 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:07:29,080 INFO L139 ounterexampleChecker]: Examining path program with hash 542106276, occurence #1 [2025-04-14 14:07:29,080 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:07:29,080 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:07:29,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:07:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1778405175, now seen corresponding path program 2 times [2025-04-14 14:07:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:07:29,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903340288] [2025-04-14 14:07:29,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:07:29,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:07:29,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-04-14 14:07:29,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 14:07:29,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 14:07:29,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:07:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:07:29,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:07:29,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903340288] [2025-04-14 14:07:29,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903340288] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:07:29,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:07:29,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 14:07:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775278770] [2025-04-14 14:07:29,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:07:29,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 14:07:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:07:29,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 14:07:29,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 14:07:29,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:29,154 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:07:29,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2025-04-14 14:07:29,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:07:29,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:07:29,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:07:29,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:07:29,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:29,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:07:29,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:07:29,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:07:29,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:07:29,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:07:29,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 14:07:29,281 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:07:29,281 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:07:29,281 INFO L139 ounterexampleChecker]: Examining path program with hash 1195751136, occurence #1 [2025-04-14 14:07:29,281 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:07:29,281 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:07:29,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:07:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1032255187, now seen corresponding path program 3 times [2025-04-14 14:07:29,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:07:29,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205868116] [2025-04-14 14:07:29,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 14:07:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:07:29,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-04-14 14:07:29,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 14:07:29,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 14:07:29,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:07:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:07:29,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:07:29,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205868116] [2025-04-14 14:07:29,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205868116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:07:29,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:07:29,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 14:07:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485821540] [2025-04-14 14:07:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:07:29,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 14:07:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:07:29,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 14:07:29,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-14 14:07:29,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:29,393 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:07:29,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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) [2025-04-14 14:07:29,393 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:07:29,393 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:07:29,393 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:07:29,393 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:07:29,393 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:07:29,393 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:07:30,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:07:30,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:07:30,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:07:30,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:07:30,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:07:30,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:07:30,056 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 14:07:30,056 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:07:30,056 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:07:30,056 INFO L139 ounterexampleChecker]: Examining path program with hash -1714915562, occurence #1 [2025-04-14 14:07:30,056 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:07:30,056 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:07:30,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:07:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash 730861135, now seen corresponding path program 1 times [2025-04-14 14:07:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:07:30,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015411060] [2025-04-14 14:07:30,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:07:30,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:07:30,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 14:07:30,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 14:07:30,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:07:30,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:07:30,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 14:07:30,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 14:07:30,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 14:07:30,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:07:30,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:07:30,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 14:07:30,103 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 14:07:30,104 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 14:07:30,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 14:07:30,113 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-04-14 14:07:30,114 INFO L320 ceAbstractionStarter]: Result for error location readerThread1of1ForFork0 was UNSAFE (1/3) [2025-04-14 14:07:30,192 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 14:07:30,192 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 14:07:30,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-14 14:07:30,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 02:07:30 BasicIcfg [2025-04-14 14:07:30,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 14:07:30,204 INFO L158 Benchmark]: Toolchain (without parser) took 4417.02ms. Allocated memory was 155.2MB in the beginning and 360.7MB in the end (delta: 205.5MB). Free memory was 106.7MB in the beginning and 316.5MB in the end (delta: -209.8MB). Peak memory consumption was 82.2MB. Max. memory is 8.0GB. [2025-04-14 14:07:30,205 INFO L158 Benchmark]: CDTParser took 1.21ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 14:07:30,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.58ms. Allocated memory is still 155.2MB. Free memory was 106.7MB in the beginning and 84.2MB in the end (delta: 22.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 14:07:30,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.17ms. Allocated memory is still 155.2MB. Free memory was 84.2MB in the beginning and 81.9MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 14:07:30,205 INFO L158 Benchmark]: Boogie Preprocessor took 24.17ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 14:07:30,205 INFO L158 Benchmark]: IcfgBuilder took 355.58ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 60.9MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 14:07:30,205 INFO L158 Benchmark]: TraceAbstraction took 3499.34ms. Allocated memory was 155.2MB in the beginning and 360.7MB in the end (delta: 205.5MB). Free memory was 60.3MB in the beginning and 316.5MB in the end (delta: -256.2MB). Peak memory consumption was 40.2MB. Max. memory is 8.0GB. [2025-04-14 14:07:30,206 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 498.58ms. Allocated memory is still 155.2MB. Free memory was 106.7MB in the beginning and 84.2MB in the end (delta: 22.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.17ms. Allocated memory is still 155.2MB. Free memory was 84.2MB in the beginning and 81.9MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.17ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 355.58ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 60.9MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3499.34ms. Allocated memory was 155.2MB in the beginning and 360.7MB in the end (delta: 205.5MB). Free memory was 60.3MB in the beginning and 316.5MB in the end (delta: -256.2MB). Peak memory consumption was 40.2MB. 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: 10654, independent: 10310, independent conditional: 8691, independent unconditional: 1619, dependent: 344, dependent conditional: 292, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10529, independent: 10310, independent conditional: 8691, independent unconditional: 1619, dependent: 219, dependent conditional: 167, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10529, independent: 10310, independent conditional: 8691, independent unconditional: 1619, dependent: 219, dependent conditional: 167, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11364, independent: 10310, independent conditional: 8691, independent unconditional: 1619, dependent: 1054, dependent conditional: 1002, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11364, independent: 10310, independent conditional: 107, independent unconditional: 10203, dependent: 1054, dependent conditional: 365, dependent unconditional: 689, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11364, independent: 10310, independent conditional: 107, independent unconditional: 10203, dependent: 1054, dependent conditional: 365, dependent unconditional: 689, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1722, independent: 1633, independent conditional: 14, independent unconditional: 1619, dependent: 89, dependent conditional: 37, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1722, independent: 1602, independent conditional: 0, independent unconditional: 1602, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 120, independent: 31, independent conditional: 14, independent unconditional: 17, dependent: 89, dependent conditional: 37, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 31, independent conditional: 14, independent unconditional: 17, dependent: 89, dependent conditional: 37, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 798, independent: 222, independent conditional: 43, independent unconditional: 179, dependent: 576, dependent conditional: 212, dependent unconditional: 364, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 11364, independent: 8677, independent conditional: 93, independent unconditional: 8584, dependent: 965, dependent conditional: 328, dependent unconditional: 637, unknown: 1722, unknown conditional: 51, unknown unconditional: 1671] , Statistics on independence cache: Total cache size (in pairs): 1722, Positive cache size: 1633, Positive conditional cache size: 14, Positive unconditional cache size: 1619, Negative cache size: 89, Negative conditional cache size: 37, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9221, Maximal queried relation: 5, Independence queries for same thread: 125, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, Number of persistent set computation: 908, Number of trivial persistent sets: 171, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1671, independent: 1619, independent conditional: 0, independent unconditional: 1619, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10654, independent: 10310, independent conditional: 8691, independent unconditional: 1619, dependent: 344, dependent conditional: 292, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10529, independent: 10310, independent conditional: 8691, independent unconditional: 1619, dependent: 219, dependent conditional: 167, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10529, independent: 10310, independent conditional: 8691, independent unconditional: 1619, dependent: 219, dependent conditional: 167, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11364, independent: 10310, independent conditional: 8691, independent unconditional: 1619, dependent: 1054, dependent conditional: 1002, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11364, independent: 10310, independent conditional: 107, independent unconditional: 10203, dependent: 1054, dependent conditional: 365, dependent unconditional: 689, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11364, independent: 10310, independent conditional: 107, independent unconditional: 10203, dependent: 1054, dependent conditional: 365, dependent unconditional: 689, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1722, independent: 1633, independent conditional: 14, independent unconditional: 1619, dependent: 89, dependent conditional: 37, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1722, independent: 1602, independent conditional: 0, independent unconditional: 1602, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 120, independent: 31, independent conditional: 14, independent unconditional: 17, dependent: 89, dependent conditional: 37, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 31, independent conditional: 14, independent unconditional: 17, dependent: 89, dependent conditional: 37, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 798, independent: 222, independent conditional: 43, independent unconditional: 179, dependent: 576, dependent conditional: 212, dependent unconditional: 364, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 11364, independent: 8677, independent conditional: 93, independent unconditional: 8584, dependent: 965, dependent conditional: 328, dependent unconditional: 637, unknown: 1722, unknown conditional: 51, unknown unconditional: 1671] , Statistics on independence cache: Total cache size (in pairs): 1722, Positive cache size: 1633, Positive conditional cache size: 14, Positive unconditional cache size: 1619, Negative cache size: 89, Negative conditional cache size: 37, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9221, Maximal queried relation: 5, Independence queries for same thread: 125 - CounterExampleResult [Line: 738]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-3, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, w=0, x=0, y=0] [L724] 2 int l; VAL [\at(arg, Pre)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, t4=0, w=0, x=0, y=0] [L724] 4 int l; VAL [\at(arg, Pre)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 4 y = l VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 4 int ly = y; VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 4 int lx = x; VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 4 !(!(ly == lx)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 4 l = r-1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L730] 2 y = l VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 4 r = l VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L745] 4 return 0; [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L716] 1 x = 3 VAL [\at(arg, Pre)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 2 int lx = x; VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 2 !(ly == lx) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] 2 reach_error() VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: readerThread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 76 locations, 80 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.3s, 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: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 14:07:30,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...