/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 13:52:56,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 13:52:56,204 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 13:52:56,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 13:52:56,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 13:52:56,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 13:52:56,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 13:52:56,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 13:52:56,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 13:52:56,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 13:52:56,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 13:52:56,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 13:52:56,232 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 13:52:56,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 13:52:56,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 13:52:56,232 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 13:52:56,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 13:52:56,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 13:52:56,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 13:52:56,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 13:52:56,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 13:52:56,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:52:56,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:52:56,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:52:56,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 13:52:56,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 13:52:56,234 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 13:52:56,234 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 13:52:56,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 13:52:56,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 13:52:56,234 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 13:52:56,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 13:52:56,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 13:52:56,234 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 13:52:56,234 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 13:52:56,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 13:52:56,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 13:52:56,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 13:52:56,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 13:52:56,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 13:52:56,467 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 13:52:56,468 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 13:52:57,755 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f6e0c3b/8a4b56474a0b4ca08142ae41c2530fb0/FLAGa729ceda6 [2025-04-14 13:52:57,935 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 13:52:57,936 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i [2025-04-14 13:52:57,945 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f6e0c3b/8a4b56474a0b4ca08142ae41c2530fb0/FLAGa729ceda6 [2025-04-14 13:52:58,756 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f6e0c3b/8a4b56474a0b4ca08142ae41c2530fb0 [2025-04-14 13:52:58,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 13:52:58,758 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 13:52:58,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 13:52:58,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 13:52:58,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 13:52:58,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:52:58" (1/1) ... [2025-04-14 13:52:58,763 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 01:52:58, skipping insertion in model container [2025-04-14 13:52:58,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:52:58" (1/1) ... [2025-04-14 13:52:58,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 13:52:59,051 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 13:52:59,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:52:59,080 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 13:52:59,135 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 13:52:59,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:52:59,168 INFO L204 MainTranslator]: Completed translation [2025-04-14 13:52:59,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59 WrapperNode [2025-04-14 13:52:59,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 13:52:59,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 13:52:59,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 13:52:59,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 13:52:59,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (1/1) ... [2025-04-14 13:52:59,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (1/1) ... [2025-04-14 13:52:59,203 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-14 13:52:59,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 13:52:59,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 13:52:59,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 13:52:59,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 13:52:59,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (1/1) ... [2025-04-14 13:52:59,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (1/1) ... [2025-04-14 13:52:59,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (1/1) ... [2025-04-14 13:52:59,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (1/1) ... [2025-04-14 13:52:59,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (1/1) ... [2025-04-14 13:52:59,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (1/1) ... [2025-04-14 13:52:59,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (1/1) ... [2025-04-14 13:52:59,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (1/1) ... [2025-04-14 13:52:59,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 13:52:59,229 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 13:52:59,229 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 13:52:59,229 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 13:52:59,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (1/1) ... [2025-04-14 13:52:59,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:52:59,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:52:59,254 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 13:52:59,256 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 13:52:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-14 13:52:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-14 13:52:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-14 13:52:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-14 13:52:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 13:52:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 13:52:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 13:52:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 13:52:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 13:52:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 13:52:59,276 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 13:52:59,362 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 13:52:59,364 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 13:52:59,477 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 13:52:59,477 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 13:52:59,539 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 13:52:59,539 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 13:52:59,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:52:59 BoogieIcfgContainer [2025-04-14 13:52:59,539 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 13:52:59,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 13:52:59,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 13:52:59,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 13:52:59,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:52:58" (1/3) ... [2025-04-14 13:52:59,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47118877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:52:59, skipping insertion in model container [2025-04-14 13:52:59,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:52:59" (2/3) ... [2025-04-14 13:52:59,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47118877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:52:59, skipping insertion in model container [2025-04-14 13:52:59,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:52:59" (3/3) ... [2025-04-14 13:52:59,549 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2025-04-14 13:52:59,560 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 13:52:59,561 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 13:52:59,561 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 13:52:59,599 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:52:59,630 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:52:59,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 13:52:59,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:52:59,633 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 13:52:59,634 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 13:52:59,698 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:52:59,714 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:52:59,720 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;@3f54c9ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:52:59,720 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 13:53:00,002 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 13:53:00,002 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:53:00,002 INFO L139 ounterexampleChecker]: Examining path program with hash 1468766102, occurence #1 [2025-04-14 13:53:00,002 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:53:00,002 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:53:00,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:53:00,007 INFO L85 PathProgramCache]: Analyzing trace with hash 230937727, now seen corresponding path program 1 times [2025-04-14 13:53:00,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:53:00,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630985438] [2025-04-14 13:53:00,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:53:00,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:53:00,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 13:53:00,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 13:53:00,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:53:00,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:53:00,189 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 13:53:00,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:53:00,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630985438] [2025-04-14 13:53:00,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630985438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:53:00,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:53:00,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:53:00,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246948054] [2025-04-14 13:53:00,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:53:00,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 13:53:00,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:53:00,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 13:53:00,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 13:53:00,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:00,208 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:53:00,209 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 13:53:00,209 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:00,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:53:00,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 13:53:00,270 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 13:53:00,270 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:53:00,271 INFO L139 ounterexampleChecker]: Examining path program with hash 1468766102, occurence #2 [2025-04-14 13:53:00,271 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:53:00,271 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:53:00,271 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:53:00,271 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:53:00,291 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:53:00,291 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 13:53:00,291 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:53:00,291 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 13:53:00,291 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:53:00,292 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:53:00,292 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:53:00,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:53:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash 430155292, now seen corresponding path program 1 times [2025-04-14 13:53:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:53:00,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205673714] [2025-04-14 13:53:00,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:53:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:53:00,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 13:53:00,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 13:53:00,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:53:00,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:53:00,452 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 13:53:00,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:53:00,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205673714] [2025-04-14 13:53:00,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205673714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:53:00,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018505820] [2025-04-14 13:53:00,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:53:00,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:53:00,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:53:00,456 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 13:53:00,457 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 13:53:00,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 13:53:00,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 13:53:00,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:53:00,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:53:00,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 13:53:00,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:53:00,575 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 13:53:00,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:53:00,607 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 13:53:00,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018505820] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:53:00,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:53:00,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-14 13:53:00,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810460738] [2025-04-14 13:53:00,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:53:00,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 13:53:00,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:53:00,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 13:53:00,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:53:00,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:00,609 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:53:00,609 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 13:53:00,609 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:53:00,609 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:00,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:53:00,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:53:00,700 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 13:53:00,894 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 13:53:00,894 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 13:53:00,895 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:53:00,895 INFO L139 ounterexampleChecker]: Examining path program with hash 1468766102, occurence #3 [2025-04-14 13:53:00,895 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:53:00,895 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:53:00,895 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:53:00,895 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:53:00,895 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:53:00,895 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 13:53:00,895 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:53:00,895 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 45 [2025-04-14 13:53:00,895 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:53:00,895 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:53:00,895 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:53:00,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:53:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash -110250177, now seen corresponding path program 2 times [2025-04-14 13:53:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:53:00,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694053596] [2025-04-14 13:53:00,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:53:00,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:53:00,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-14 13:53:00,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-14 13:53:00,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:53:00,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:53:01,090 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 13:53:01,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:53:01,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694053596] [2025-04-14 13:53:01,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694053596] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:53:01,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553880499] [2025-04-14 13:53:01,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:53:01,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:53:01,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:53:01,092 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 13:53:01,093 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 13:53:01,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-14 13:53:01,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-14 13:53:01,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:53:01,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:53:01,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 13:53:01,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:53:01,211 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 13:53:01,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:53:01,285 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 13:53:01,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553880499] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:53:01,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:53:01,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-14 13:53:01,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403172668] [2025-04-14 13:53:01,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:53:01,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 13:53:01,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:53:01,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 13:53:01,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-14 13:53:01,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:01,287 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:53:01,287 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 13:53:01,287 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:53:01,287 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:53:01,287 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:01,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:53:01,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:53:01,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 13:53:01,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 13:53:01,630 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 13:53:01,630 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 13:53:01,630 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:53:01,631 INFO L139 ounterexampleChecker]: Examining path program with hash 1468766102, occurence #4 [2025-04-14 13:53:01,631 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:53:01,631 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:53:01,631 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:53:01,631 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:53:01,631 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:53:01,631 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 13:53:01,631 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:53:01,633 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 87 [2025-04-14 13:53:01,634 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:53:01,634 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:53:01,634 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:53:01,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:53:01,634 INFO L85 PathProgramCache]: Analyzing trace with hash 891797343, now seen corresponding path program 3 times [2025-04-14 13:53:01,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:53:01,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66748244] [2025-04-14 13:53:01,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 13:53:01,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:53:01,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-04-14 13:53:01,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-04-14 13:53:01,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-14 13:53:01,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:53:01,896 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 13:53:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:53:01,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66748244] [2025-04-14 13:53:01,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66748244] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:53:01,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509680028] [2025-04-14 13:53:01,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 13:53:01,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:53:01,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:53:01,900 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 13:53:01,901 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 13:53:01,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-04-14 13:53:01,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-04-14 13:53:01,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-14 13:53:01,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:53:01,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 13:53:01,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:53:02,127 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 13:53:02,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:53:02,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509680028] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:53:02,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:53:02,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 14 [2025-04-14 13:53:02,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472805904] [2025-04-14 13:53:02,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:53:02,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 13:53:02,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:53:02,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 13:53:02,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2025-04-14 13:53:02,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:02,129 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:53:02,129 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 13:53:02,129 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:53:02,129 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:53:02,129 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 13:53:02,129 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:02,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:53:02,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:53:02,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 13:53:02,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:53:02,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 13:53:02,464 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 13:53:02,464 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 13:53:02,464 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:53:02,464 INFO L139 ounterexampleChecker]: Examining path program with hash 1145036676, occurence #1 [2025-04-14 13:53:02,465 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:53:02,465 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:53:02,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:53:02,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1362775157, now seen corresponding path program 1 times [2025-04-14 13:53:02,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:53:02,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186875645] [2025-04-14 13:53:02,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:53:02,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:53:02,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-14 13:53:02,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-14 13:53:02,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:53:02,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:53:02,707 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 13:53:02,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:53:02,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186875645] [2025-04-14 13:53:02,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186875645] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:53:02,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942852140] [2025-04-14 13:53:02,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:53:02,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:53:02,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:53:02,710 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 13:53:02,712 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 13:53:02,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-14 13:53:02,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-14 13:53:02,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:53:02,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:53:02,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 13:53:02,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:53:02,864 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 13:53:02,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:53:02,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942852140] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:53:02,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:53:02,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2025-04-14 13:53:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714525169] [2025-04-14 13:53:02,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:53:02,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 13:53:02,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:53:02,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 13:53:02,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2025-04-14 13:53:02,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:02,865 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:53:02,865 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 13:53:02,865 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:53:02,865 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:53:02,865 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 13:53:02,865 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:53:02,865 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:02,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:53:02,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:53:02,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 13:53:02,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:53:02,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:53:02,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 13:53:03,155 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 13:53:03,156 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 13:53:03,156 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:53:03,156 INFO L139 ounterexampleChecker]: Examining path program with hash -1550894952, occurence #1 [2025-04-14 13:53:03,156 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:53:03,156 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:53:03,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:53:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1416746748, now seen corresponding path program 1 times [2025-04-14 13:53:03,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:53:03,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909923939] [2025-04-14 13:53:03,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:53:03,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:53:03,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-14 13:53:03,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-14 13:53:03,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:53:03,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:53:03,332 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 13:53:03,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:53:03,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909923939] [2025-04-14 13:53:03,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909923939] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:53:03,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939616576] [2025-04-14 13:53:03,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:53:03,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:53:03,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:53:03,335 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 13:53:03,338 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 13:53:03,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-14 13:53:03,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-14 13:53:03,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:53:03,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:53:03,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 13:53:03,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:53:03,460 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 13:53:03,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:53:03,574 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 13:53:03,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939616576] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:53:03,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:53:03,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2025-04-14 13:53:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497855437] [2025-04-14 13:53:03,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:53:03,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 13:53:03,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:53:03,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 13:53:03,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-04-14 13:53:03,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:03,576 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:53:03,576 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 13:53:03,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:53:03,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:53:03,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 13:53:03,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:53:03,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:53:03,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:53:03,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:53:03,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:53:03,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 13:53:03,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:53:03,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:53:03,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 13:53:03,663 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 13:53:03,857 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 13:53:03,857 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 13:53:03,857 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:53:03,858 INFO L139 ounterexampleChecker]: Examining path program with hash -1550894952, occurence #2 [2025-04-14 13:53:03,858 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:53:03,858 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:53:03,858 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:53:03,858 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:53:03,858 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:53:03,858 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 13:53:03,858 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:53:03,858 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 53 [2025-04-14 13:53:03,858 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:53:03,858 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 55 [2025-04-14 13:53:03,858 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:53:03,858 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:53:03,858 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:53:03,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:53:03,858 INFO L85 PathProgramCache]: Analyzing trace with hash 387518468, now seen corresponding path program 2 times [2025-04-14 13:53:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:53:03,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313993857] [2025-04-14 13:53:03,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:53:03,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:53:03,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-04-14 13:53:03,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-04-14 13:53:03,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:53:03,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:53:03,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:53:03,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-14 13:53:03,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-14 13:53:03,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:53:03,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:53:03,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:53:03,917 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:53:03,918 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 13:53:03,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 13:53:03,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 13:53:03,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 13:53:03,926 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-04-14 13:53:04,025 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 13:53:04,025 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 13:53:04,036 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 13:53:04,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:53:04 BasicIcfg [2025-04-14 13:53:04,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 13:53:04,037 INFO L158 Benchmark]: Toolchain (without parser) took 5278.73ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 85.1MB in the beginning and 118.7MB in the end (delta: -33.6MB). Peak memory consumption was 70.9MB. Max. memory is 8.0GB. [2025-04-14 13:53:04,037 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:53:04,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.77ms. Allocated memory is still 125.8MB. Free memory was 84.6MB in the beginning and 62.5MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 13:53:04,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.46ms. Allocated memory is still 125.8MB. Free memory was 62.5MB in the beginning and 60.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 13:53:04,038 INFO L158 Benchmark]: Boogie Preprocessor took 24.68ms. Allocated memory is still 125.8MB. Free memory was 60.3MB in the beginning and 59.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:53:04,038 INFO L158 Benchmark]: IcfgBuilder took 310.03ms. Allocated memory is still 125.8MB. Free memory was 59.3MB in the beginning and 38.3MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 13:53:04,038 INFO L158 Benchmark]: TraceAbstraction took 4495.90ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 37.8MB in the beginning and 118.7MB in the end (delta: -80.9MB). Peak memory consumption was 28.9MB. Max. memory is 8.0GB. [2025-04-14 13:53:04,039 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.22ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 409.77ms. Allocated memory is still 125.8MB. Free memory was 84.6MB in the beginning and 62.5MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.46ms. Allocated memory is still 125.8MB. Free memory was 62.5MB in the beginning and 60.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.68ms. Allocated memory is still 125.8MB. Free memory was 60.3MB in the beginning and 59.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 310.03ms. Allocated memory is still 125.8MB. Free memory was 59.3MB in the beginning and 38.3MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4495.90ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 37.8MB in the beginning and 118.7MB in the end (delta: -80.9MB). Peak memory consumption was 28.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3179, independent: 2451, independent conditional: 2204, independent unconditional: 247, dependent: 728, dependent conditional: 721, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2458, independent: 2451, independent conditional: 2204, 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: 2458, independent: 2451, independent conditional: 2204, 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: 2458, independent: 2451, independent conditional: 2204, 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: 2458, independent: 2451, independent conditional: 0, independent unconditional: 2451, 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: 2458, independent: 2451, independent conditional: 0, independent unconditional: 2451, 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: 254, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2458, independent: 2219, independent conditional: 0, independent unconditional: 2219, 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: 2204, Maximal queried relation: 0, Independence queries for same thread: 721, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, 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: 3179, independent: 2451, independent conditional: 2204, independent unconditional: 247, dependent: 728, dependent conditional: 721, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2458, independent: 2451, independent conditional: 2204, 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: 2458, independent: 2451, independent conditional: 2204, 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: 2458, independent: 2451, independent conditional: 2204, 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: 2458, independent: 2451, independent conditional: 0, independent unconditional: 2451, 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: 2458, independent: 2451, independent conditional: 0, independent unconditional: 2451, 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: 254, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2458, independent: 2219, independent conditional: 0, independent unconditional: 2219, 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: 2204, Maximal queried relation: 0, Independence queries for same thread: 721 - 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=-1, 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:236}, \at(argc, Pre)=234, arg={0:0}, argc=234, cur=1, i=1, id1=-1, id2=0, 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:236}, \at(argc, Pre)=234, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, argc=234, assert_cond=0, correct=144, cur=233, i=89, id1=-1, id2=0, 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: 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. - 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. - 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.2s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.9s, 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.6s 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]: 20, ConditionCalculationTime [ms]: 0, ConditionCalculations: 9, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 13:53:04,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...