/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 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-aee53f6 [2024-11-15 22:13:25,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-15 22:13:25,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-15 22:13:25,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-15 22:13:25,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-15 22:13:25,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-15 22:13:25,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-15 22:13:25,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-15 22:13:25,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-15 22:13:25,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-15 22:13:25,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-15 22:13:25,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-15 22:13:25,147 INFO L153 SettingsManager]: * Use SBE=true [2024-11-15 22:13:25,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-15 22:13:25,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-15 22:13:25,147 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-15 22:13:25,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-15 22:13:25,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-15 22:13:25,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-15 22:13:25,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-15 22:13:25,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-15 22:13:25,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-15 22:13:25,148 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-15 22:13:25,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-15 22:13:25,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-15 22:13:25,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-15 22:13:25,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-15 22:13:25,148 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-15 22:13:25,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-15 22:13:25,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 22:13:25,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-15 22:13:25,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-15 22:13:25,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-15 22:13:25,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-15 22:13:25,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-15 22:13:25,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-15 22:13:25,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-15 22:13:25,149 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-15 22:13:25,149 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-15 22:13:25,149 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 [2024-11-15 22:13:25,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-15 22:13:25,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-15 22:13:25,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-15 22:13:25,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-15 22:13:25,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-15 22:13:25,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2024-11-15 22:13:26,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-15 22:13:27,209 INFO L384 CDTParser]: Found 1 translation units. [2024-11-15 22:13:27,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2024-11-15 22:13:27,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/da8b228dc/3893b20840da444b8de70c9b431a2e26/FLAGf2227d343 [2024-11-15 22:13:27,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/da8b228dc/3893b20840da444b8de70c9b431a2e26 [2024-11-15 22:13:27,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-15 22:13:27,282 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-15 22:13:27,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-15 22:13:27,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-15 22:13:27,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-15 22:13:27,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fa0716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27, skipping insertion in model container [2024-11-15 22:13:27,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-15 22:13:27,682 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/ldv-races/race-2_5-container_of.i[186287,186300] [2024-11-15 22:13:27,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 22:13:27,748 INFO L200 MainTranslator]: Completed pre-run [2024-11-15 22:13:27,810 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/ldv-races/race-2_5-container_of.i[186287,186300] [2024-11-15 22:13:27,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 22:13:27,881 INFO L204 MainTranslator]: Completed translation [2024-11-15 22:13:27,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27 WrapperNode [2024-11-15 22:13:27,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-15 22:13:27,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-15 22:13:27,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-15 22:13:27,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-15 22:13:27,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,942 INFO L138 Inliner]: procedures = 248, calls = 55, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136 [2024-11-15 22:13:27,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-15 22:13:27,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-15 22:13:27,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-15 22:13:27,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-15 22:13:27,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-15 22:13:27,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-15 22:13:27,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-15 22:13:27,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-15 22:13:27,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (1/1) ... [2024-11-15 22:13:27,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 22:13:27,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 22:13:28,012 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-15 22:13:28,015 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-15 22:13:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-15 22:13:28,032 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-15 22:13:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-15 22:13:28,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-15 22:13:28,034 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-15 22:13:28,278 INFO L238 CfgBuilder]: Building ICFG [2024-11-15 22:13:28,280 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-15 22:13:28,545 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-15 22:13:28,546 INFO L287 CfgBuilder]: Performing block encoding [2024-11-15 22:13:28,616 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-15 22:13:28,616 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-15 22:13:28,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:28 BoogieIcfgContainer [2024-11-15 22:13:28,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-15 22:13:28,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-15 22:13:28,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-15 22:13:28,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-15 22:13:28,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:13:27" (1/3) ... [2024-11-15 22:13:28,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b010388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:13:28, skipping insertion in model container [2024-11-15 22:13:28,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:27" (2/3) ... [2024-11-15 22:13:28,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b010388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:13:28, skipping insertion in model container [2024-11-15 22:13:28,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:28" (3/3) ... [2024-11-15 22:13:28,625 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2024-11-15 22:13:28,639 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-15 22:13:28,640 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_5-container_of.i that has 2 procedures, 147 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2024-11-15 22:13:28,641 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-15 22:13:28,716 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-15 22:13:28,779 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 22:13:28,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-15 22:13:28,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 22:13:28,783 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-15 22:13:28,785 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-15 22:13:28,895 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 22:13:28,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 22:13:28,916 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;@413963be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 22:13:28,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-15 22:13:28,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-15 22:13:28,951 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:28,952 INFO L132 ounterexampleChecker]: Examining path program with hash 2018092214, occurence #1 [2024-11-15 22:13:28,952 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:28,952 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:28,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1590721727, now seen corresponding path program 1 times [2024-11-15 22:13:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:28,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236923858] [2024-11-15 22:13:28,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:28,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 22:13:29,844 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-15 22:13:29,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 22:13:29,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236923858] [2024-11-15 22:13:29,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236923858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 22:13:29,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 22:13:29,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-15 22:13:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383520540] [2024-11-15 22:13:29,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 22:13:29,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-15 22:13:29,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 22:13:29,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-15 22:13:29,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-15 22:13:29,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:29,877 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 22:13:29,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-15 22:13:29,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-15 22:13:30,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-15 22:13:30,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-15 22:13:30,006 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:30,007 INFO L132 ounterexampleChecker]: Examining path program with hash -1344276376, occurence #1 [2024-11-15 22:13:30,007 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:30,007 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:30,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1002579891, now seen corresponding path program 1 times [2024-11-15 22:13:30,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:30,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218880018] [2024-11-15 22:13:30,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:30,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 22:13:30,489 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-15 22:13:30,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 22:13:30,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218880018] [2024-11-15 22:13:30,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218880018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 22:13:30,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 22:13:30,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-15 22:13:30,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701595247] [2024-11-15 22:13:30,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 22:13:30,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-15 22:13:30,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 22:13:30,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-15 22:13:30,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-15 22:13:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:30,495 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 22:13:30,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-15 22:13:30,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-15 22:13:30,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:31,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-15 22:13:31,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:31,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-15 22:13:31,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-15 22:13:31,588 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:31,588 INFO L132 ounterexampleChecker]: Examining path program with hash -817730850, occurence #1 [2024-11-15 22:13:31,588 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:31,588 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:31,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:31,589 INFO L85 PathProgramCache]: Analyzing trace with hash 109531964, now seen corresponding path program 1 times [2024-11-15 22:13:31,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:31,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099220565] [2024-11-15 22:13:31,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:31,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 22:13:31,997 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-15 22:13:31,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 22:13:31,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099220565] [2024-11-15 22:13:31,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099220565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 22:13:31,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 22:13:31,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-15 22:13:31,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995781592] [2024-11-15 22:13:31,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 22:13:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 22:13:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 22:13:32,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 22:13:32,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 22:13:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:32,001 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 22:13:32,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 22:13:32,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-15 22:13:32,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:32,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-15 22:13:32,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:32,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 22:13:32,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-15 22:13:32,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-15 22:13:32,114 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:32,115 INFO L132 ounterexampleChecker]: Examining path program with hash 42045063, occurence #1 [2024-11-15 22:13:32,115 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:32,115 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:32,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:32,115 INFO L85 PathProgramCache]: Analyzing trace with hash -899476009, now seen corresponding path program 1 times [2024-11-15 22:13:32,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:32,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230135007] [2024-11-15 22:13:32,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:32,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 22:13:32,411 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-15 22:13:32,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 22:13:32,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230135007] [2024-11-15 22:13:32,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230135007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 22:13:32,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 22:13:32,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-15 22:13:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3434134] [2024-11-15 22:13:32,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 22:13:32,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 22:13:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 22:13:32,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 22:13:32,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 22:13:32,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:32,413 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 22:13:32,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 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-15 22:13:32,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-15 22:13:32,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:32,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 22:13:32,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-15 22:13:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 22:13:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 22:13:32,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-15 22:13:32,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-15 22:13:32,547 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:32,548 INFO L132 ounterexampleChecker]: Examining path program with hash 831746020, occurence #1 [2024-11-15 22:13:32,548 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:32,548 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:32,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1892939856, now seen corresponding path program 1 times [2024-11-15 22:13:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:32,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719229979] [2024-11-15 22:13:32,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:32,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 22:13:32,621 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-15 22:13:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 22:13:32,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-15 22:13:32,744 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-15 22:13:32,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-11-15 22:13:32,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-11-15 22:13:32,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-11-15 22:13:32,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-11-15 22:13:32,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-11-15 22:13:32,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-11-15 22:13:32,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-15 22:13:32,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-11-15 22:13:32,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-15 22:13:32,752 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-15 22:13:32,855 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-15 22:13:32,855 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-15 22:13:32,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-11-15 22:13:32,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:13:32 BasicIcfg [2024-11-15 22:13:32,878 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-15 22:13:32,879 INFO L158 Benchmark]: Toolchain (without parser) took 5599.58ms. Allocated memory was 100.7MB in the beginning and 163.6MB in the end (delta: 62.9MB). Free memory was 69.1MB in the beginning and 73.2MB in the end (delta: -4.1MB). Peak memory consumption was 59.1MB. Max. memory is 8.0GB. [2024-11-15 22:13:32,879 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-15 22:13:32,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.35ms. Allocated memory is still 100.7MB. Free memory was 69.1MB in the beginning and 37.6MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2024-11-15 22:13:32,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.79ms. Allocated memory is still 100.7MB. Free memory was 37.6MB in the beginning and 35.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-15 22:13:32,880 INFO L158 Benchmark]: Boogie Preprocessor took 34.74ms. Allocated memory is still 100.7MB. Free memory was 35.3MB in the beginning and 32.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-15 22:13:32,880 INFO L158 Benchmark]: RCFGBuilder took 638.52ms. Allocated memory is still 100.7MB. Free memory was 32.8MB in the beginning and 53.1MB in the end (delta: -20.3MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. [2024-11-15 22:13:32,880 INFO L158 Benchmark]: TraceAbstraction took 4259.11ms. Allocated memory was 100.7MB in the beginning and 163.6MB in the end (delta: 62.9MB). Free memory was 52.6MB in the beginning and 73.2MB in the end (delta: -20.6MB). Peak memory consumption was 44.4MB. Max. memory is 8.0GB. [2024-11-15 22:13:32,882 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.23ms. Allocated memory is still 100.7MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 599.35ms. Allocated memory is still 100.7MB. Free memory was 69.1MB in the beginning and 37.6MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.79ms. Allocated memory is still 100.7MB. Free memory was 37.6MB in the beginning and 35.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 34.74ms. Allocated memory is still 100.7MB. Free memory was 35.3MB in the beginning and 32.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 638.52ms. Allocated memory is still 100.7MB. Free memory was 32.8MB in the beginning and 53.1MB in the end (delta: -20.3MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4259.11ms. Allocated memory was 100.7MB in the beginning and 163.6MB in the end (delta: 62.9MB). Free memory was 52.6MB in the beginning and 73.2MB in the end (delta: -20.6MB). Peak memory consumption was 44.4MB. 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: 2340, independent: 2304, independent conditional: 102, independent unconditional: 2202, dependent: 36, dependent conditional: 25, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2315, independent: 2304, independent conditional: 102, independent unconditional: 2202, 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: 2315, independent: 2304, independent conditional: 102, independent unconditional: 2202, 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: 2315, independent: 2304, independent conditional: 102, independent unconditional: 2202, 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: 2315, independent: 2304, independent conditional: 0, independent unconditional: 2304, 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: 2315, independent: 2304, independent conditional: 0, independent unconditional: 2304, 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: 2213, independent: 2202, independent conditional: 0, independent unconditional: 2202, 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: 2213, independent: 2198, independent conditional: 0, independent unconditional: 2198, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 15, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 684, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 548, dependent conditional: 0, dependent unconditional: 548, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 2315, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2213, unknown conditional: 0, unknown unconditional: 2213] , Statistics on independence cache: Total cache size (in pairs): 2213, Positive cache size: 2202, Positive conditional cache size: 0, Positive unconditional cache size: 2202, 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: 102, Maximal queried relation: 0, Independence queries for same thread: 25, Persistent sets #1 benchmarks: Persistent set computation time: 0.8s, Number of persistent set computation: 142, Number of trivial persistent sets: 142, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2213, independent: 2202, independent conditional: 0, independent unconditional: 2202, 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: 2340, independent: 2304, independent conditional: 102, independent unconditional: 2202, dependent: 36, dependent conditional: 25, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2315, independent: 2304, independent conditional: 102, independent unconditional: 2202, 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: 2315, independent: 2304, independent conditional: 102, independent unconditional: 2202, 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: 2315, independent: 2304, independent conditional: 102, independent unconditional: 2202, 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: 2315, independent: 2304, independent conditional: 0, independent unconditional: 2304, 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: 2315, independent: 2304, independent conditional: 0, independent unconditional: 2304, 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: 2213, independent: 2202, independent conditional: 0, independent unconditional: 2202, 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: 2213, independent: 2198, independent conditional: 0, independent unconditional: 2198, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 15, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 684, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 548, dependent conditional: 0, dependent unconditional: 548, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 2315, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2213, unknown conditional: 0, unknown unconditional: 2213] , Statistics on independence cache: Total cache size (in pairs): 2213, Positive cache size: 2202, Positive conditional cache size: 0, Positive unconditional cache size: 2202, 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: 102, Maximal queried relation: 0, Independence queries for same thread: 25 - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; VAL [t1=0, t2=0] [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; VAL [\result=0, t1=0, t2=0] [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); VAL [ret=0, t1=0, t2=0] [L3963] COND TRUE 0 ret==0 VAL [ret=0, t1=0, t2=0] [L3964] 0 int probe_ret; VAL [ret=0, t1=0, t2=0] [L3965] 0 struct my_data data; VAL [data={6:0}, ret=0, t1=0, t2=0] [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; VAL [\old(data)={6:0}, d={6:28}, data={6:0}, t1=0, t2=0] [L3923] 0 data->shared.a = 0 VAL [\old(data)={6:0}, d={6:28}, data={6:0}, t1=0, t2=0] [L3924] 0 data->shared.b = 0 VAL [\old(data)={6:0}, d={6:28}, data={6:0}, t1=0, t2=0] [L3925] 0 int res = __VERIFIER_nondet_int(); VAL [\old(data)={6:0}, d={6:28}, data={6:0}, res=0, t1=0, t2=0] [L3926] COND FALSE 0 !(\read(res)) VAL [\old(data)={6:0}, d={6:28}, data={6:0}, res=0, t1=0, t2=0] [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={6:28}, \old(data)={6:0}, d={6:28}, data={6:0}, res=0, t1=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; VAL [\old(arg)={6:28}, arg={6:28}, dev={6:28}, t1=-1, t2=0] [L3903] 1 struct my_data *data; VAL [\old(arg)={6:28}, arg={6:28}, dev={6:28}, t1=-1, t2=0] [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [\old(arg)={6:28}, __mptr={6:28}, arg={6:28}, dev={6:28}, t1=-1, t2=0] [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} VAL [\old(arg)={6:28}, __mptr={6:28}, arg={6:28}, dev={6:28}, t1=-1, t2=0] [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) VAL [\old(arg)={6:28}, arg={6:28}, data={6:0}, dev={6:28}, t1=-1, t2=0] [L3907] 1 data->shared.a = 1 VAL [\old(arg)={6:28}, arg={6:28}, data={6:0}, dev={6:28}, t1=-1, t2=0] [L3910] EXPR 1 data->shared.b [L3910] 1 int lb = data->shared.b; [L3913] 1 data->shared.b = lb + 1 VAL [\old(arg)={6:28}, arg={6:28}, data={6:0}, dev={6:28}, lb=0, t1=-1, t2=0] [L3916] 1 return 0; VAL [\old(arg)={6:28}, \result={0:0}, arg={6:28}, data={6:0}, dev={6:28}, lb=0, t1=-1, t2=0] [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={6:28}, \old(data)={6:0}, \result={0:0}, arg={6:28}, d={6:28}, data={6:0}, data={6:0}, dev={6:28}, lb=0, res=0, t1=-1, t2=0] [L3902] 2 struct device *dev = (struct device*)arg; VAL [\old(arg)={6:28}, \result={0:0}, arg={6:28}, data={6:0}, dev={6:28}, lb=0, t1=-1, t2=0] [L3903] 2 struct my_data *data; VAL [\old(arg)={6:28}, \result={0:0}, arg={6:28}, data={6:0}, dev={6:28}, lb=0, t1=-1, t2=0] [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [\old(arg)={6:28}, \result={0:0}, __mptr={6:28}, arg={6:28}, data={6:0}, dev={6:28}, lb=0, t1=-1, t2=0] [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} VAL [\old(arg)={6:28}, \result={0:0}, __mptr={6:28}, arg={6:28}, data={6:0}, dev={6:28}, lb=0, t1=-1, t2=0] [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) VAL [\old(arg)={6:28}, \result={0:0}, arg={6:28}, data={6:0}, dev={6:28}, lb=0, t1=-1, t2=0] [L3907] 2 data->shared.a = 1 VAL [\old(arg)={6:28}, \result={0:0}, arg={6:28}, data={6:0}, dev={6:28}, lb=0, t1=-1, t2=0] [L3910] EXPR 2 data->shared.b [L3910] 2 int lb = data->shared.b; [L3913] 2 data->shared.b = lb + 1 VAL [\old(arg)={6:28}, \result={0:0}, arg={6:28}, data={6:0}, dev={6:28}, lb=0, t1=-1, t2=0] [L3916] 2 return 0; VAL [\old(arg)={6:28}, \result={0:0}, arg={6:28}, data={6:0}, dev={6:28}, lb=0, t1=-1, t2=0] [L3931] 0 return 0; VAL [\old(arg)={6:28}, \old(data)={6:0}, \result=0, \result={0:0}, arg={6:28}, d={6:28}, data={6:0}, data={6:0}, dev={6:28}, lb=0, res=0, t1=-1, t2=0] [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) VAL [\old(arg)={6:28}, \result={0:0}, arg={6:28}, data={6:0}, data={6:0}, dev={6:28}, lb=0, probe_ret=0, ret=0, t1=-1, t2=0] [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\old(arg)={6:28}, \old(data)={6:0}, \result={0:0}, arg={6:28}, data={6:0}, data={6:0}, dev={6:28}, lb=0, status={5:0}, t1=-1, t2=0] [L3938] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={6:28}, \old(data)={6:0}, \result={0:0}, arg={6:28}, data={6:0}, data={6:0}, dev={6:28}, lb=0, status={5:0}, t1=-1, t2=0] [L3941] 0 data->shared.a = 3 VAL [\old(arg)={6:28}, \old(data)={6:0}, \result={0:0}, arg={6:28}, data={6:0}, data={6:0}, dev={6:28}, lb=0, status={5:0}, t1=-1, t2=0] [L3944] 0 data->shared.b = 3 VAL [\old(arg)={6:28}, \old(data)={6:0}, \result={0:0}, arg={6:28}, data={6:0}, data={6:0}, dev={6:28}, lb=0, status={5:0}, t1=-1, t2=0] [L3947] EXPR 0 data->shared.a [L3947] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND FALSE 0 !(!expression) [L3947] RET 0 ldv_assert(data->shared.a==3) [L3950] EXPR 0 data->shared.b [L3950] CALL 0 ldv_assert(data->shared.b==3) [L3887] COND FALSE 0 !(!expression) [L3950] RET 0 ldv_assert(data->shared.b==3) [L3952] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={6:28}, \old(data)={6:0}, \result={0:0}, arg={6:28}, data={6:0}, data={6:0}, dev={6:28}, lb=0, status={5:0}, t1=-1, t2=0] [L3968] RET 0 my_drv_disconnect(&data) [L3969] EXPR 0 data.shared.a VAL [\old(arg)={6:28}, \result={0:0}, arg={6:28}, data={6:0}, data={6:0}, dev={6:28}, lb=0, probe_ret=0, ret=0, t1=-1, t2=0] [L3969] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND TRUE 0 !expression VAL [\old(arg)={6:28}, \old(expression)=0, \result={0:0}, arg={6:28}, data={6:0}, dev={6:28}, expression=0, lb=0, t1=-1, t2=0] [L3887] 0 reach_error() VAL [\old(arg)={6:28}, \old(expression)=0, \result={0:0}, arg={6:28}, data={6:0}, dev={6:28}, expression=0, lb=0, t1=-1, t2=0] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 4 procedures, 185 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 21, 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.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 297 ConstructedInterpolants, 0 QuantifiedInterpolants, 465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-15 22:13:32,914 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...