/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_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-aee53f6 [2024-11-15 22:13:08,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-15 22:13:08,826 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:08,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-15 22:13:08,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-15 22:13:08,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-15 22:13:08,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-15 22:13:08,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-15 22:13:08,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-15 22:13:08,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-15 22:13:08,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-15 22:13:08,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-15 22:13:08,859 INFO L153 SettingsManager]: * Use SBE=true [2024-11-15 22:13:08,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-15 22:13:08,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-15 22:13:08,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-15 22:13:08,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-15 22:13:08,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-15 22:13:08,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-15 22:13:08,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-15 22:13:08,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-15 22:13:08,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-15 22:13:08,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-15 22:13:08,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-15 22:13:08,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-15 22:13:08,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-15 22:13:08,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-15 22:13:08,860 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-15 22:13:08,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-15 22:13:08,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 22:13:08,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-15 22:13:08,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-15 22:13:08,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-15 22:13:08,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-15 22:13:08,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-15 22:13:08,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-15 22:13:08,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-15 22:13:08,864 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-15 22:13:08,864 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-15 22:13:08,864 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:09,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-15 22:13:09,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-15 22:13:09,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-15 22:13:09,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-15 22:13:09,144 INFO L274 PluginConnector]: CDTParser initialized [2024-11-15 22:13:09,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2024-11-15 22:13:10,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-15 22:13:10,940 INFO L384 CDTParser]: Found 1 translation units. [2024-11-15 22:13:10,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2024-11-15 22:13:10,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d47e80c4e/0bac15f2560b4608a30ce2b2b6f2d894/FLAG368a797f4 [2024-11-15 22:13:11,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d47e80c4e/0bac15f2560b4608a30ce2b2b6f2d894 [2024-11-15 22:13:11,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-15 22:13:11,118 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-15 22:13:11,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-15 22:13:11,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-15 22:13:11,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-15 22:13:11,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:11" (1/1) ... [2024-11-15 22:13:11,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26085a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:11, skipping insertion in model container [2024-11-15 22:13:11,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:11" (1/1) ... [2024-11-15 22:13:11,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-15 22:13:11,451 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_2-container_of.i[186287,186300] [2024-11-15 22:13:11,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 22:13:11,511 INFO L200 MainTranslator]: Completed pre-run [2024-11-15 22:13:11,556 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_2-container_of.i[186287,186300] [2024-11-15 22:13:11,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 22:13:11,617 INFO L204 MainTranslator]: Completed translation [2024-11-15 22:13:11,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:11 WrapperNode [2024-11-15 22:13:11,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-15 22:13:11,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-15 22:13:11,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-15 22:13:11,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-15 22:13:11,625 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:11" (1/1) ... [2024-11-15 22:13:11,649 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:11" (1/1) ... [2024-11-15 22:13:11,680 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108 [2024-11-15 22:13:11,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-15 22:13:11,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-15 22:13:11,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-15 22:13:11,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-15 22:13:11,685 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:11" (1/1) ... [2024-11-15 22:13:11,686 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:11" (1/1) ... [2024-11-15 22:13:11,689 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:11" (1/1) ... [2024-11-15 22:13:11,689 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:11" (1/1) ... [2024-11-15 22:13:11,700 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:11" (1/1) ... [2024-11-15 22:13:11,702 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:11" (1/1) ... [2024-11-15 22:13:11,705 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:11" (1/1) ... [2024-11-15 22:13:11,706 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:11" (1/1) ... [2024-11-15 22:13:11,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-15 22:13:11,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-15 22:13:11,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-15 22:13:11,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-15 22:13:11,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:11" (1/1) ... [2024-11-15 22:13:11,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 22:13:11,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 22:13:11,757 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:11,760 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:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-15 22:13:11,783 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-15 22:13:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-15 22:13:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-15 22:13:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-15 22:13:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-15 22:13:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-15 22:13:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-15 22:13:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-15 22:13:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-15 22:13:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-15 22:13:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-15 22:13:11,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-15 22:13:11,785 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:12,004 INFO L238 CfgBuilder]: Building ICFG [2024-11-15 22:13:12,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-15 22:13:12,256 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-15 22:13:12,256 INFO L287 CfgBuilder]: Performing block encoding [2024-11-15 22:13:12,287 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-15 22:13:12,287 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-15 22:13:12,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:12 BoogieIcfgContainer [2024-11-15 22:13:12,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-15 22:13:12,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-15 22:13:12,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-15 22:13:12,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-15 22:13:12,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:13:11" (1/3) ... [2024-11-15 22:13:12,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f02376d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:13:12, skipping insertion in model container [2024-11-15 22:13:12,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:11" (2/3) ... [2024-11-15 22:13:12,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f02376d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:13:12, skipping insertion in model container [2024-11-15 22:13:12,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:12" (3/3) ... [2024-11-15 22:13:12,297 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-11-15 22:13:12,311 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-15 22:13:12,313 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_2-container_of.i that has 2 procedures, 137 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2024-11-15 22:13:12,313 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-15 22:13:12,374 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-15 22:13:12,431 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 22:13:12,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-15 22:13:12,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 22:13:12,436 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:12,437 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:12,536 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 22:13:12,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 22:13:12,555 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;@5eecfd05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 22:13:12,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-15 22:13:12,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-15 22:13:12,581 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:12,582 INFO L132 ounterexampleChecker]: Examining path program with hash -1235512260, occurence #1 [2024-11-15 22:13:12,582 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:12,583 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:12,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:12,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1935001818, now seen corresponding path program 1 times [2024-11-15 22:13:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:12,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692933086] [2024-11-15 22:13:12,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 22:13:13,463 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:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 22:13:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692933086] [2024-11-15 22:13:13,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692933086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 22:13:13,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 22:13:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-15 22:13:13,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730352183] [2024-11-15 22:13:13,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 22:13:13,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-15 22:13:13,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 22:13:13,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-15 22:13:13,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-15 22:13:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:13,490 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 22:13:13,492 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:13,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:13,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-15 22:13:13,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-15 22:13:13,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-15 22:13:13,627 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:13,627 INFO L132 ounterexampleChecker]: Examining path program with hash 325030628, occurence #1 [2024-11-15 22:13:13,627 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:13,627 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:13,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash -357700172, now seen corresponding path program 1 times [2024-11-15 22:13:13,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:13,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769630212] [2024-11-15 22:13:13,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:13,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 22:13:13,915 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:13,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 22:13:13,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769630212] [2024-11-15 22:13:13,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769630212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 22:13:13,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 22:13:13,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-15 22:13:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605856121] [2024-11-15 22:13:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 22:13:13,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-15 22:13:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 22:13:13,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-15 22:13:13,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-15 22:13:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:13,919 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 22:13:13,920 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:13,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-15 22:13:13,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-15 22:13:14,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-15 22:13:14,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-15 22:13:14,826 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:14,826 INFO L132 ounterexampleChecker]: Examining path program with hash -1228193520, occurence #1 [2024-11-15 22:13:14,826 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:14,827 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:14,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:14,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2132662848, now seen corresponding path program 1 times [2024-11-15 22:13:14,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:14,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122543077] [2024-11-15 22:13:14,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:14,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 22:13:16,964 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:16,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 22:13:16,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122543077] [2024-11-15 22:13:16,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122543077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 22:13:16,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 22:13:16,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-15 22:13:16,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740761235] [2024-11-15 22:13:16,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 22:13:16,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-15 22:13:16,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 22:13:16,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-15 22:13:16,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-15 22:13:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:16,968 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 22:13:16,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 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:16,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:16,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-15 22:13:16,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-15 22:13:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-15 22:13:18,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-15 22:13:18,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-15 22:13:18,194 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:18,194 INFO L132 ounterexampleChecker]: Examining path program with hash 750607612, occurence #1 [2024-11-15 22:13:18,194 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:18,194 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:18,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2018153891, now seen corresponding path program 1 times [2024-11-15 22:13:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:18,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102509655] [2024-11-15 22:13:18,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:18,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 22:13:21,512 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:21,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 22:13:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102509655] [2024-11-15 22:13:21,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102509655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 22:13:21,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 22:13:21,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-11-15 22:13:21,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555041480] [2024-11-15 22:13:21,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 22:13:21,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-15 22:13:21,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 22:13:21,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-15 22:13:21,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2024-11-15 22:13:21,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:21,517 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 22:13:21,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6551724137931036) internal successors, (106), 29 states have internal predecessors, (106), 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:21,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:21,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-15 22:13:21,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-15 22:13:21,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-15 22:13:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-15 22:13:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-15 22:13:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-15 22:13:24,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-15 22:13:24,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-15 22:13:24,930 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:24,930 INFO L132 ounterexampleChecker]: Examining path program with hash 1333090967, occurence #1 [2024-11-15 22:13:24,930 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:24,930 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:24,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:24,930 INFO L85 PathProgramCache]: Analyzing trace with hash -462194130, now seen corresponding path program 1 times [2024-11-15 22:13:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:24,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053994942] [2024-11-15 22:13:24,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:24,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 22:13:25,026 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:25,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 22:13:25,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053994942] [2024-11-15 22:13:25,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053994942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 22:13:25,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 22:13:25,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-15 22:13:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067905309] [2024-11-15 22:13:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 22:13:25,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-15 22:13:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 22:13:25,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-15 22:13:25,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-15 22:13:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:25,028 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 22:13:25,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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:25,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-15 22:13:25,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-15 22:13:25,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-15 22:13:25,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-11-15 22:13:25,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-15 22:13:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-15 22:13:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-15 22:13:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-15 22:13:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:25,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-15 22:13:25,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-15 22:13:25,683 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:25,683 INFO L132 ounterexampleChecker]: Examining path program with hash -319089262, occurence #1 [2024-11-15 22:13:25,683 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:25,683 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:25,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1038762546, now seen corresponding path program 2 times [2024-11-15 22:13:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:25,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108685652] [2024-11-15 22:13:25,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:25,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 22:13:26,871 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:26,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 22:13:26,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108685652] [2024-11-15 22:13:26,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108685652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 22:13:26,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 22:13:26,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-15 22:13:26,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683637647] [2024-11-15 22:13:26,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 22:13:26,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-15 22:13:26,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 22:13:26,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-15 22:13:26,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-11-15 22:13:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:26,873 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 22:13:26,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 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:26,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-15 22:13:26,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-15 22:13:26,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-15 22:13:26,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-11-15 22:13:26,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:26,874 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 8 states. [2024-11-15 22:13:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-15 22:13:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-15 22:13:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-15 22:13:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-15 22:13:30,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-15 22:13:30,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-15 22:13:30,008 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:30,008 INFO L132 ounterexampleChecker]: Examining path program with hash -805317694, occurence #1 [2024-11-15 22:13:30,008 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:30,008 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:30,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash 323215356, now seen corresponding path program 3 times [2024-11-15 22:13:30,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:30,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903337726] [2024-11-15 22:13:30,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:30,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 22:13:31,634 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,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 22:13:31,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903337726] [2024-11-15 22:13:31,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903337726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 22:13:31,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 22:13:31,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-11-15 22:13:31,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509020542] [2024-11-15 22:13:31,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 22:13:31,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-15 22:13:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 22:13:31,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-15 22:13:31,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2024-11-15 22:13:31,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:31,636 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 22:13:31,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.6296296296296298) internal successors, (98), 27 states have internal predecessors, (98), 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:31,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-15 22:13:31,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-15 22:13:31,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-11-15 22:13:31,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-11-15 22:13:31,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:31,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-11-15 22:13:31,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 22:13:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-15 22:13:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-15 22:13:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-15 22:13:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-15 22:13:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-15 22:13:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-15 22:13:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-15 22:13:34,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-15 22:13:34,347 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-15 22:13:34,347 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 22:13:34,347 INFO L132 ounterexampleChecker]: Examining path program with hash 1173483438, occurence #1 [2024-11-15 22:13:34,347 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 22:13:34,347 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 22:13:34,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 22:13:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1580783463, now seen corresponding path program 2 times [2024-11-15 22:13:34,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 22:13:34,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963993372] [2024-11-15 22:13:34,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 22:13:34,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 22:13:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 22:13:34,374 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-15 22:13:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 22:13:34,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-15 22:13:34,446 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-15 22:13:34,447 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-15 22:13:34,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-15 22:13:34,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-11-15 22:13:34,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-15 22:13:34,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-15 22:13:34,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-11-15 22:13:34,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-15 22:13:34,455 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2024-11-15 22:13:34,555 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-15 22:13:34,556 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-15 22:13:34,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-15 22:13:34,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:13:34 BasicIcfg [2024-11-15 22:13:34,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-15 22:13:34,579 INFO L158 Benchmark]: Toolchain (without parser) took 23460.72ms. Allocated memory was 100.7MB in the beginning and 570.4MB in the end (delta: 469.8MB). Free memory was 70.5MB in the beginning and 437.8MB in the end (delta: -367.4MB). Peak memory consumption was 102.8MB. Max. memory is 8.0GB. [2024-11-15 22:13:34,579 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 100.7MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-15 22:13:34,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.79ms. Allocated memory is still 100.7MB. Free memory was 70.1MB in the beginning and 39.4MB in the end (delta: 30.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-11-15 22:13:34,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.73ms. Allocated memory is still 100.7MB. Free memory was 39.4MB in the beginning and 37.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-15 22:13:34,580 INFO L158 Benchmark]: Boogie Preprocessor took 29.46ms. Allocated memory is still 100.7MB. Free memory was 37.0MB in the beginning and 35.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-15 22:13:34,580 INFO L158 Benchmark]: RCFGBuilder took 576.71ms. Allocated memory is still 100.7MB. Free memory was 34.7MB in the beginning and 59.7MB in the end (delta: -25.0MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. [2024-11-15 22:13:34,580 INFO L158 Benchmark]: TraceAbstraction took 22287.36ms. Allocated memory was 100.7MB in the beginning and 570.4MB in the end (delta: 469.8MB). Free memory was 59.2MB in the beginning and 437.8MB in the end (delta: -378.7MB). Peak memory consumption was 91.9MB. Max. memory is 8.0GB. [2024-11-15 22:13:34,583 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.27ms. Allocated memory is still 100.7MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 498.79ms. Allocated memory is still 100.7MB. Free memory was 70.1MB in the beginning and 39.4MB in the end (delta: 30.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.73ms. Allocated memory is still 100.7MB. Free memory was 39.4MB in the beginning and 37.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.46ms. Allocated memory is still 100.7MB. Free memory was 37.0MB in the beginning and 35.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 576.71ms. Allocated memory is still 100.7MB. Free memory was 34.7MB in the beginning and 59.7MB in the end (delta: -25.0MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. * TraceAbstraction took 22287.36ms. Allocated memory was 100.7MB in the beginning and 570.4MB in the end (delta: 469.8MB). Free memory was 59.2MB in the beginning and 437.8MB in the end (delta: -378.7MB). Peak memory consumption was 91.9MB. 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: 4273, independent: 4176, independent conditional: 2026, independent unconditional: 2150, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4216, independent: 4176, independent conditional: 2026, independent unconditional: 2150, dependent: 40, dependent conditional: 6, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4216, independent: 4176, independent conditional: 2026, independent unconditional: 2150, dependent: 40, dependent conditional: 6, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4256, independent: 4176, independent conditional: 2026, independent unconditional: 2150, dependent: 80, dependent conditional: 46, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4256, independent: 4176, independent conditional: 13, independent unconditional: 4163, dependent: 80, dependent conditional: 24, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4256, independent: 4176, independent conditional: 13, independent unconditional: 4163, dependent: 80, dependent conditional: 24, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2212, independent: 2161, independent conditional: 11, independent unconditional: 2150, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2212, independent: 2145, independent conditional: 0, independent unconditional: 2145, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 16, independent conditional: 11, independent unconditional: 5, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 16, independent conditional: 11, independent unconditional: 5, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2433, independent: 572, independent conditional: 388, independent unconditional: 184, dependent: 1861, dependent conditional: 660, dependent unconditional: 1201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 4256, independent: 2015, independent conditional: 2, independent unconditional: 2013, dependent: 29, dependent conditional: 7, dependent unconditional: 22, unknown: 2212, unknown conditional: 28, unknown unconditional: 2184] , Statistics on independence cache: Total cache size (in pairs): 2212, Positive cache size: 2161, Positive conditional cache size: 11, Positive unconditional cache size: 2150, Negative cache size: 51, Negative conditional cache size: 17, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2035, Maximal queried relation: 4, Independence queries for same thread: 57, Persistent sets #1 benchmarks: Persistent set computation time: 1.5s, Number of persistent set computation: 723, Number of trivial persistent sets: 684, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2184, independent: 2150, independent conditional: 0, independent unconditional: 2150, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4273, independent: 4176, independent conditional: 2026, independent unconditional: 2150, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4216, independent: 4176, independent conditional: 2026, independent unconditional: 2150, dependent: 40, dependent conditional: 6, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4216, independent: 4176, independent conditional: 2026, independent unconditional: 2150, dependent: 40, dependent conditional: 6, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4256, independent: 4176, independent conditional: 2026, independent unconditional: 2150, dependent: 80, dependent conditional: 46, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4256, independent: 4176, independent conditional: 13, independent unconditional: 4163, dependent: 80, dependent conditional: 24, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4256, independent: 4176, independent conditional: 13, independent unconditional: 4163, dependent: 80, dependent conditional: 24, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2212, independent: 2161, independent conditional: 11, independent unconditional: 2150, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2212, independent: 2145, independent conditional: 0, independent unconditional: 2145, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 16, independent conditional: 11, independent unconditional: 5, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 16, independent conditional: 11, independent unconditional: 5, dependent: 51, dependent conditional: 17, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2433, independent: 572, independent conditional: 388, independent unconditional: 184, dependent: 1861, dependent conditional: 660, dependent unconditional: 1201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 4256, independent: 2015, independent conditional: 2, independent unconditional: 2013, dependent: 29, dependent conditional: 7, dependent unconditional: 22, unknown: 2212, unknown conditional: 28, unknown unconditional: 2184] , Statistics on independence cache: Total cache size (in pairs): 2212, Positive cache size: 2161, Positive conditional cache size: 11, Positive unconditional cache size: 2150, Negative cache size: 51, Negative conditional cache size: 17, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2035, Maximal queried relation: 4, Independence queries for same thread: 57 - 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] [L3950] CALL, EXPR 0 my_drv_init() [L3944] 0 return 0; VAL [\result=0, t1=0, t2=0] [L3950] RET, EXPR 0 my_drv_init() [L3950] 0 int ret = my_drv_init(); VAL [ret=0, t1=0, t2=0] [L3951] COND TRUE 0 ret==0 VAL [ret=0, t1=0, t2=0] [L3952] 0 int probe_ret; VAL [ret=0, t1=0, t2=0] [L3953] 0 struct my_data data; VAL [data={5:0}, ret=0, t1=0, t2=0] [L3954] CALL, EXPR 0 my_drv_probe(&data) [L3920] 0 struct device *d = &data->dev; VAL [\old(data)={5:0}, d={5:28}, data={5:0}, t1=0, t2=0] [L3924] 0 data->shared.a = 0 VAL [\old(data)={5:0}, d={5:28}, data={5:0}, t1=0, t2=0] [L3925] 0 data->shared.b = 0 VAL [\old(data)={5:0}, d={5:28}, data={5:0}, t1=0, t2=0] [L3926] 0 int res = __VERIFIER_nondet_int(); VAL [\old(data)={5:0}, d={5:28}, data={5:0}, res=0, t1=0, t2=0] [L3927] COND FALSE 0 !(\read(res)) VAL [\old(data)={5:0}, d={5:28}, data={5:0}, res=0, t1=0, t2=0] [L3930] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:28}, \old(data)={5:0}, d={5:28}, data={5:0}, res=0, t1=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; VAL [\old(arg)={5:28}, arg={5:28}, dev={5:28}, t1=-1, t2=0] [L3903] 1 struct my_data *data; VAL [\old(arg)={5:28}, arg={5:28}, dev={5:28}, t1=-1, t2=0] [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [\old(arg)={5:28}, __mptr={5:28}, arg={5:28}, dev={5: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)={5:28}, __mptr={5:28}, arg={5:28}, dev={5: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)={5:28}, arg={5:28}, data={5:0}, dev={5:28}, t1=-1, t2=0] [L3908] 1 data->shared.a = 1 VAL [\old(arg)={5:28}, arg={5:28}, data={5:0}, dev={5:28}, t1=-1, t2=0] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3931] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:28}, \old(data)={5:0}, arg={5:28}, d={5:28}, data={5:0}, data={5:0}, dev={5:28}, lb=0, res=0, t1=-1, t2=0] [L3902] 2 struct device *dev = (struct device*)arg; VAL [\old(arg)={5:28}, arg={5:28}, data={5:0}, dev={5:28}, lb=0, t1=-1, t2=0] [L3903] 2 struct my_data *data; VAL [\old(arg)={5:28}, arg={5:28}, data={5:0}, dev={5:28}, lb=0, t1=-1, t2=0] [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [\old(arg)={5:28}, __mptr={5:28}, arg={5:28}, data={5:0}, dev={5: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)={5:28}, __mptr={5:28}, arg={5:28}, data={5:0}, dev={5: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)={5:28}, arg={5:28}, data={5:0}, dev={5:28}, lb=0, t1=-1, t2=0] [L3908] 2 data->shared.a = 1 VAL [\old(arg)={5:28}, arg={5:28}, data={5:0}, dev={5:28}, lb=0, t1=-1, t2=0] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={5:28}, arg={5:28}, data={5:0}, dev={5:28}, lb=0, t1=-1, t2=0] [L3917] 2 return 0; VAL [\old(arg)={5:28}, \result={0:0}, arg={5:28}, data={5:0}, dev={5:28}, lb=0, t1=-1, t2=0] [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={5:28}, \result={0:0}, arg={5:28}, data={5:0}, dev={5:28}, lb=0, t1=-1, t2=0] [L3917] 1 return 0; VAL [\old(arg)={5:28}, \result={0:0}, arg={5:28}, data={5:0}, dev={5:28}, lb=0, t1=-1, t2=0] [L3932] 0 return 0; VAL [\old(arg)={5:28}, \old(data)={5:0}, \result=0, \result={0:0}, arg={5:28}, d={5:28}, data={5:0}, data={5:0}, dev={5:28}, lb=0, res=0, t1=-1, t2=0] [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) VAL [\old(arg)={5:28}, \result={0:0}, arg={5:28}, data={5:0}, data={5:0}, dev={5:28}, lb=0, probe_ret=0, ret=0, t1=-1, t2=0] [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; VAL [\old(arg)={5:28}, \old(data)={5:0}, \result={0:0}, arg={5:28}, data={5:0}, data={5:0}, dev={5:28}, lb=0, status={3:0}, t1=-1, t2=0] [L3939] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={5:28}, \old(data)={5:0}, \result={0:0}, arg={5:28}, data={5:0}, data={5:0}, dev={5:28}, lb=0, status={3:0}, t1=-1, t2=0] [L3940] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={5:28}, \old(data)={5:0}, \result={0:0}, arg={5:28}, data={5:0}, data={5:0}, dev={5:28}, lb=0, status={3:0}, t1=-1, t2=0] [L3956] RET 0 my_drv_disconnect(&data) [L3957] EXPR 0 data.shared.a VAL [\old(arg)={5:28}, \result={0:0}, arg={5:28}, data={5:0}, data={5:0}, dev={5:28}, lb=0, probe_ret=0, ret=0, t1=-1, t2=0] [L3957] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={5:28}, \old(expression)=1, \result={0:0}, arg={5:28}, data={5:0}, dev={5:28}, expression=1, lb=0, t1=-1, t2=0] [L3957] RET 0 ldv_assert(data.shared.a==1) [L3958] EXPR 0 data.shared.b VAL [\old(arg)={5:28}, \result={0:0}, arg={5:28}, data={5:0}, data={5:0}, dev={5:28}, lb=0, probe_ret=0, ret=0, t1=-1, t2=0] [L3958] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={5:28}, \old(expression)=0, \result={0:0}, arg={5:28}, data={5:0}, dev={5:28}, expression=0, lb=0, t1=-1, t2=0] [L3887] 0 reach_error() VAL [\old(arg)={5:28}, \old(expression)=0, \result={0:0}, arg={5:28}, data={5:0}, dev={5: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: 3931]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 4 procedures, 167 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 12.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 211, 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, 9.0s InterpolantComputationTime, 702 NumberOfCodeBlocks, 702 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 5621 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:34,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...