/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 10:36:35,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 10:36:35,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 10:36:35,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 10:36:35,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 10:36:35,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 10:36:35,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 10:36:35,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 10:36:35,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 10:36:35,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 10:36:35,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 10:36:35,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 10:36:35,726 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 10:36:35,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 10:36:35,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 10:36:35,726 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 10:36:35,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 10:36:35,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 10:36:35,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 10:36:35,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 10:36:35,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 10:36:35,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:36:35,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 10:36:35,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 10:36:35,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:36:35,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 10:36:35,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 10:36:35,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 10:36:35,730 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 10:36:35,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 10:36:35,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 10:36:35,730 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 10:36:35,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 10:36:35,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 10:36:35,730 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 10:36:35,730 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 10:36:35,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 10:36:35,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 10:36:35,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 10:36:35,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 10:36:35,978 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 10:36:35,978 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 10:36:35,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i [2025-04-14 10:36:37,238 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b3882e0/4196d37c2d634614a66283fcbdbcb81c/FLAGc76425c34 [2025-04-14 10:36:37,425 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 10:36:37,425 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i [2025-04-14 10:36:37,437 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b3882e0/4196d37c2d634614a66283fcbdbcb81c/FLAGc76425c34 [2025-04-14 10:36:38,238 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b3882e0/4196d37c2d634614a66283fcbdbcb81c [2025-04-14 10:36:38,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 10:36:38,241 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 10:36:38,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 10:36:38,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 10:36:38,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 10:36:38,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272237bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38, skipping insertion in model container [2025-04-14 10:36:38,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 10:36:38,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i[30243,30256] [2025-04-14 10:36:38,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 10:36:38,479 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 10:36:38,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i[30243,30256] [2025-04-14 10:36:38,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 10:36:38,532 INFO L204 MainTranslator]: Completed translation [2025-04-14 10:36:38,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38 WrapperNode [2025-04-14 10:36:38,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 10:36:38,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 10:36:38,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 10:36:38,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 10:36:38,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,557 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-14 10:36:38,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 10:36:38,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 10:36:38,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 10:36:38,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 10:36:38,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 10:36:38,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 10:36:38,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 10:36:38,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 10:36:38,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:36:38,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:38,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 10:36:38,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 10:36:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-14 10:36:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-14 10:36:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-14 10:36:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-14 10:36:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 10:36:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 10:36:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 10:36:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 10:36:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 10:36:38,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 10:36:38,635 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 10:36:38,712 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 10:36:38,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 10:36:38,821 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 10:36:38,821 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 10:36:38,883 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 10:36:38,883 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 10:36:38,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:36:38 BoogieIcfgContainer [2025-04-14 10:36:38,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 10:36:38,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 10:36:38,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 10:36:38,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 10:36:38,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 10:36:38" (1/3) ... [2025-04-14 10:36:38,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dded69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:36:38, skipping insertion in model container [2025-04-14 10:36:38,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (2/3) ... [2025-04-14 10:36:38,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dded69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:36:38, skipping insertion in model container [2025-04-14 10:36:38,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:36:38" (3/3) ... [2025-04-14 10:36:38,891 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2025-04-14 10:36:38,899 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 10:36:38,901 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-5.i that has 3 procedures, 26 locations, 27 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 10:36:38,901 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 10:36:38,934 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 10:36:38,966 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:36:38,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 10:36:38,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:38,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 10:36:38,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 10:36:39,029 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 10:36:39,042 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 10:36:39,048 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e3e4351, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:36:39,048 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 10:36:39,304 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:39,305 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:39,305 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #1 [2025-04-14 10:36:39,305 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:36:39,305 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:39,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash -585029914, now seen corresponding path program 1 times [2025-04-14 10:36:39,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:39,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849692303] [2025-04-14 10:36:39,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:39,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:39,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 10:36:39,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 10:36:39,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:39,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:39,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:39,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849692303] [2025-04-14 10:36:39,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849692303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:36:39,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:36:39,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 10:36:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002858308] [2025-04-14 10:36:39,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:36:39,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 10:36:39,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:39,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 10:36:39,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 10:36:39,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:39,521 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:39,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:36:39,523 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:39,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:39,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 10:36:39,576 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:39,577 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:39,577 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #2 [2025-04-14 10:36:39,577 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:36:39,577 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:36:39,577 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:39,577 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 10:36:39,577 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:39,578 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 10:36:39,591 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:39,591 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 10:36:39,591 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:39,591 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 10:36:39,591 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:39,591 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-14 10:36:39,591 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:39,591 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:36:39,591 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:39,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1099917870, now seen corresponding path program 1 times [2025-04-14 10:36:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:39,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677134093] [2025-04-14 10:36:39,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:39,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 10:36:39,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 10:36:39,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:39,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:39,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:39,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677134093] [2025-04-14 10:36:39,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677134093] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:36:39,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814208462] [2025-04-14 10:36:39,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:39,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:39,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:39,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 10:36:39,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 10:36:39,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 10:36:39,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 10:36:39,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:39,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:39,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 10:36:39,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:36:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:39,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 10:36:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:39,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814208462] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 10:36:39,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 10:36:39,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-14 10:36:39,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864961329] [2025-04-14 10:36:39,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 10:36:39,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 10:36:39,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:39,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 10:36:39,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 10:36:39,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:39,862 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:39,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:36:39,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:39,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:39,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:39,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:39,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 10:36:40,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-14 10:36:40,139 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:40,140 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:40,140 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #3 [2025-04-14 10:36:40,140 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:36:40,140 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:36:40,140 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,140 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 10:36:40,140 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,140 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 10:36:40,140 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:40,140 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 10:36:40,140 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:40,140 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 45 [2025-04-14 10:36:40,140 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,140 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 47 [2025-04-14 10:36:40,140 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,140 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:36:40,140 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:40,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1414699802, now seen corresponding path program 2 times [2025-04-14 10:36:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:40,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575155341] [2025-04-14 10:36:40,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:36:40,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:40,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-14 10:36:40,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-14 10:36:40,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 10:36:40,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:40,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:40,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575155341] [2025-04-14 10:36:40,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575155341] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:36:40,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122907405] [2025-04-14 10:36:40,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:36:40,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:40,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:40,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 10:36:40,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 10:36:40,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-14 10:36:40,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-14 10:36:40,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 10:36:40,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:40,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 10:36:40,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:36:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:40,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 10:36:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122907405] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 10:36:40,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 10:36:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-14 10:36:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724943150] [2025-04-14 10:36:40,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 10:36:40,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 10:36:40,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:40,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 10:36:40,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-14 10:36:40,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:40,529 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:40,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:36:40,530 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:40,530 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:40,530 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:40,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:40,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:40,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:40,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 10:36:40,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:40,843 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:40,843 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:40,843 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #4 [2025-04-14 10:36:40,843 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:36:40,843 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:36:40,843 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,843 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 10:36:40,843 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,843 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 10:36:40,843 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:40,843 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 10:36:40,843 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:40,843 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 87 [2025-04-14 10:36:40,843 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,843 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 89 [2025-04-14 10:36:40,844 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,844 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:36:40,844 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:40,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash 286974438, now seen corresponding path program 3 times [2025-04-14 10:36:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:40,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107364934] [2025-04-14 10:36:40,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 10:36:40,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:40,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-04-14 10:36:40,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-04-14 10:36:40,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-14 10:36:40,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 303 proven. 16 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-04-14 10:36:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:41,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107364934] [2025-04-14 10:36:41,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107364934] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:36:41,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340956756] [2025-04-14 10:36:41,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 10:36:41,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:41,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 10:36:41,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 10:36:41,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-04-14 10:36:41,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-04-14 10:36:41,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-14 10:36:41,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:41,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 10:36:41,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:36:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:41,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 10:36:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340956756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:36:41,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 10:36:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 14 [2025-04-14 10:36:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037494282] [2025-04-14 10:36:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:36:41,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 10:36:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:41,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 10:36:41,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2025-04-14 10:36:41,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:41,315 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:41,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:36:41,315 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:41,315 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:41,315 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:41,315 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:41,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:41,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:41,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:41,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:36:41,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 10:36:41,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:41,631 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:41,631 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:41,631 INFO L139 ounterexampleChecker]: Examining path program with hash 864461326, occurence #1 [2025-04-14 10:36:41,631 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:36:41,631 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:41,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:41,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1355305105, now seen corresponding path program 1 times [2025-04-14 10:36:41,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:41,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858030322] [2025-04-14 10:36:41,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:41,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:41,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-14 10:36:41,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-14 10:36:41,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:41,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:41,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:41,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858030322] [2025-04-14 10:36:41,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858030322] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:36:41,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919869484] [2025-04-14 10:36:41,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:41,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:41,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:41,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 10:36:41,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 10:36:41,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-14 10:36:41,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-14 10:36:41,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:41,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:41,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 10:36:41,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:36:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-14 10:36:41,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 10:36:41,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919869484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:36:41,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 10:36:41,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2025-04-14 10:36:41,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483498089] [2025-04-14 10:36:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:36:41,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 10:36:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:41,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 10:36:41,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2025-04-14 10:36:41,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:41,993 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:41,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:36:41,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:41,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:41,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:41,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:36:41,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:42,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:42,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:42,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:42,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:36:42,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:36:42,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 10:36:42,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:42,267 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:42,267 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:42,267 INFO L139 ounterexampleChecker]: Examining path program with hash -855742649, occurence #1 [2025-04-14 10:36:42,267 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:36:42,267 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:42,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1545096107, now seen corresponding path program 1 times [2025-04-14 10:36:42,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:42,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369597408] [2025-04-14 10:36:42,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:42,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-14 10:36:42,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-14 10:36:42,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:42,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:42,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:42,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369597408] [2025-04-14 10:36:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369597408] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:36:42,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237878369] [2025-04-14 10:36:42,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:42,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:42,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:42,441 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 10:36:42,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 10:36:42,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-14 10:36:42,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-14 10:36:42,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:42,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:42,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 10:36:42,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:36:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:42,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 10:36:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:42,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237878369] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 10:36:42,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 10:36:42,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2025-04-14 10:36:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128188867] [2025-04-14 10:36:42,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 10:36:42,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 10:36:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:42,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 10:36:42,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-04-14 10:36:42,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:42,654 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:42,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 10:36:42,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:42,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:42,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:42,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:36:42,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:36:42,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:42,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:42,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:42,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:42,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:36:42,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 10:36:42,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 10:36:42,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 10:36:42,914 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:42,915 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:42,915 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:42,915 INFO L139 ounterexampleChecker]: Examining path program with hash -855742649, occurence #2 [2025-04-14 10:36:42,915 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:36:42,915 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:36:42,915 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:42,915 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 10:36:42,915 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:42,915 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 10:36:42,915 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:42,915 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 10:36:42,915 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:42,915 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 53 [2025-04-14 10:36:42,915 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:42,915 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 55 [2025-04-14 10:36:42,915 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:42,915 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 57 [2025-04-14 10:36:42,916 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:42,916 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:36:42,916 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:42,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:42,916 INFO L85 PathProgramCache]: Analyzing trace with hash -733336565, now seen corresponding path program 2 times [2025-04-14 10:36:42,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:42,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175012368] [2025-04-14 10:36:42,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:36:42,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:42,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-04-14 10:36:42,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-04-14 10:36:42,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 10:36:42,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 10:36:42,940 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 10:36:42,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-14 10:36:42,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-14 10:36:42,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:42,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 10:36:42,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 10:36:42,978 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 10:36:42,979 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 10:36:42,980 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 10:36:42,980 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 10:36:42,980 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 10:36:42,985 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-04-14 10:36:43,081 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 10:36:43,081 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 10:36:43,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 10:36:43,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:36:43 BasicIcfg [2025-04-14 10:36:43,096 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 10:36:43,097 INFO L158 Benchmark]: Toolchain (without parser) took 4856.25ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 96.8MB in the beginning and 128.1MB in the end (delta: -31.3MB). Peak memory consumption was 75.0MB. Max. memory is 8.0GB. [2025-04-14 10:36:43,097 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 10:36:43,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.74ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 74.2MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 10:36:43,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.05ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 72.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 10:36:43,098 INFO L158 Benchmark]: Boogie Preprocessor took 26.70ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 71.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 10:36:43,098 INFO L158 Benchmark]: RCFGBuilder took 299.02ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 50.7MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 10:36:43,098 INFO L158 Benchmark]: TraceAbstraction took 4210.62ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 50.0MB in the beginning and 128.1MB in the end (delta: -78.1MB). Peak memory consumption was 28.8MB. Max. memory is 8.0GB. [2025-04-14 10:36:43,099 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.20ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.74ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 74.2MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.05ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 72.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.70ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 71.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 299.02ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 50.7MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4210.62ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 50.0MB in the beginning and 128.1MB in the end (delta: -78.1MB). Peak memory consumption was 28.8MB. 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: 3185, independent: 2449, independent conditional: 2202, independent unconditional: 247, dependent: 736, dependent conditional: 729, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2456, independent: 2449, independent conditional: 2202, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2456, independent: 2449, independent conditional: 2202, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2456, independent: 2449, independent conditional: 2202, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2456, independent: 2449, independent conditional: 0, independent unconditional: 2449, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2456, independent: 2449, independent conditional: 0, independent unconditional: 2449, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 204, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2456, independent: 2217, independent conditional: 0, independent unconditional: 2217, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 239, unknown conditional: 0, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2202, Maximal queried relation: 0, Independence queries for same thread: 729, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 34, Number of trivial persistent sets: 20, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 254, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3185, independent: 2449, independent conditional: 2202, independent unconditional: 247, dependent: 736, dependent conditional: 729, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2456, independent: 2449, independent conditional: 2202, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2456, independent: 2449, independent conditional: 2202, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2456, independent: 2449, independent conditional: 2202, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2456, independent: 2449, independent conditional: 0, independent unconditional: 2449, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2456, independent: 2449, independent conditional: 0, independent unconditional: 2449, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 204, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2456, independent: 2217, independent conditional: 0, independent unconditional: 2217, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 239, unknown conditional: 0, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2202, Maximal queried relation: 0, Independence queries for same thread: 729 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int i, j; [L685] 0 int p, q; [L702] 0 int cur = 1, prev = 0, next = 0; [L703] 0 int x; [L713] 0 pthread_t id1, id2; VAL [\at(argc, Pre)=234, \at(argv, Pre)={235:236}, argc=234, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\at(argc, Pre)=234, \at(argv, Pre)={235:236}, argc=234, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\at(argc, Pre)=234, \at(argv, Pre)={235:236}, argc=234, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(argc, Pre)=234, \at(argv, Pre)={235:236}, argc=234, cur=1, i=1, id1=-2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=234, \at(argv, Pre)={235:236}, arg={0:0}, argc=234, cur=1, i=1, id1=-2, id2=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] CALL, EXPR 0 fib() [L705] 0 x = 0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] COND TRUE 1 p < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L695] COND TRUE 2 q < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] COND TRUE 1 p < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L695] COND TRUE 2 q < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] COND TRUE 1 p < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L695] COND TRUE 2 q < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] COND TRUE 1 p < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L695] COND TRUE 2 q < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] COND TRUE 1 p < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L695] COND TRUE 2 q < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] COND FALSE 1 !(p < 5) [L692] 1 return ((void *)0); [L695] COND FALSE 2 !(q < 5) [L700] 2 return ((void *)0); [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=13, i=89, j=144, next=13, p=5, prev=8, q=5, x=6] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=21, i=89, j=144, next=21, p=5, prev=13, q=5, x=7] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=34, i=89, j=144, next=34, p=5, prev=21, q=5, x=8] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=55, i=89, j=144, next=55, p=5, prev=34, q=5, x=9] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=89, i=89, j=144, next=89, p=5, prev=55, q=5, x=10] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=144, i=89, j=144, next=144, p=5, prev=89, q=5, x=11] [L705] COND TRUE 0 x < 12 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=233, i=89, j=144, next=233, p=5, prev=144, q=5, x=12] [L705] COND FALSE 0 !(x < 12) [L710] 0 return prev; [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=234, \at(argv, Pre)={235:236}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, argc=234, assert_cond=0, correct=144, cur=233, i=89, id1=-2, id2=-1, j=144, next=233, p=5, prev=144, q=5, x=12] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=233, expression=0, i=89, j=144, next=233, p=5, prev=144, q=5, x=12] [L681] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=233, expression=0, i=89, j=144, next=233, p=5, prev=144, q=5, x=12] - UnprovableResult [Line: 720]: 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: 721]: 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 5 procedures, 38 locations, 41 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.7s, 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: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 678 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 1745 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1165 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 889/1541 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 13, ConditionCalculationTime [ms]: 0, ConditionCalculations: 17, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 10:36:43,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...