/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/weaver/popl20-more-nonblocking-counter-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 16:32:11,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 16:32:11,411 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 16:32:11,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 16:32:11,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 16:32:11,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 16:32:11,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 16:32:11,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 16:32:11,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 16:32:11,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 16:32:11,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 16:32:11,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 16:32:11,437 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 16:32:11,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 16:32:11,438 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 16:32:11,439 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:32:11,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:32:11,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 16:32:11,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 16:32:11,440 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 16:32:11,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 16:32:11,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 16:32:11,440 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 16:32:11,440 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 16:32:11,440 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 16:32:11,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 16:32:11,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 16:32:11,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 16:32:11,671 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 16:32:11,671 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 16:32:11,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2025-04-14 16:32:12,996 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199376fef/8bf2966ccad344848bb38d6881b1e0a6/FLAG1dcfe1f45 [2025-04-14 16:32:13,215 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 16:32:13,216 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2025-04-14 16:32:13,228 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199376fef/8bf2966ccad344848bb38d6881b1e0a6/FLAG1dcfe1f45 [2025-04-14 16:32:14,046 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199376fef/8bf2966ccad344848bb38d6881b1e0a6 [2025-04-14 16:32:14,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 16:32:14,049 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 16:32:14,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 16:32:14,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 16:32:14,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 16:32:14,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f0bdd10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14, skipping insertion in model container [2025-04-14 16:32:14,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 16:32:14,227 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2173,2186] [2025-04-14 16:32:14,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:32:14,241 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 16:32:14,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2173,2186] [2025-04-14 16:32:14,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:32:14,283 INFO L204 MainTranslator]: Completed translation [2025-04-14 16:32:14,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14 WrapperNode [2025-04-14 16:32:14,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 16:32:14,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 16:32:14,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 16:32:14,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 16:32:14,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,309 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2025-04-14 16:32:14,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 16:32:14,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 16:32:14,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 16:32:14,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 16:32:14,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 16:32:14,328 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 16:32:14,328 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 16:32:14,328 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 16:32:14,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (1/1) ... [2025-04-14 16:32:14,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:32:14,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:32:14,355 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 16:32:14,358 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 16:32:14,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 16:32:14,372 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 16:32:14,372 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 16:32:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 16:32:14,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 16:32:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 16:32:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 16:32:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 16:32:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 16:32:14,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 16:32:14,374 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 16:32:14,427 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 16:32:14,428 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 16:32:14,525 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 16:32:14,526 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 16:32:14,599 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 16:32:14,599 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 16:32:14,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:32:14 BoogieIcfgContainer [2025-04-14 16:32:14,600 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 16:32:14,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 16:32:14,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 16:32:14,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 16:32:14,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:32:14" (1/3) ... [2025-04-14 16:32:14,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94a60e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:32:14, skipping insertion in model container [2025-04-14 16:32:14,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:32:14" (2/3) ... [2025-04-14 16:32:14,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94a60e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:32:14, skipping insertion in model container [2025-04-14 16:32:14,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:32:14" (3/3) ... [2025-04-14 16:32:14,606 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2025-04-14 16:32:14,616 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 16:32:14,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-nonblocking-counter-alt2.wvr.c that has 3 procedures, 20 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 16:32:14,618 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 16:32:14,660 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 16:32:14,690 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:32:14,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 16:32:14,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:32:14,694 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 16:32:14,695 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 16:32:14,748 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:32:14,761 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 16:32:14,766 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;@66fc8b78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:32:14,766 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 16:32:14,948 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 16:32:14,948 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:32:14,949 INFO L139 ounterexampleChecker]: Examining path program with hash -712919622, occurence #1 [2025-04-14 16:32:14,949 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:32:14,949 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:32:14,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:32:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash -365191133, now seen corresponding path program 1 times [2025-04-14 16:32:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:32:14,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731235005] [2025-04-14 16:32:14,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:32:14,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:32:15,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 16:32:15,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 16:32:15,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:32:15,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:32:15,214 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 16:32:15,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:32:15,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731235005] [2025-04-14 16:32:15,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731235005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:32:15,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:32:15,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:32:15,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379561968] [2025-04-14 16:32:15,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:32:15,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:32:15,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:32:15,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:32:15,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:32:15,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:32:15,232 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:32:15,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16:32:15,232 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:32:15,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:32:15,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 16:32:15,287 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 16:32:15,287 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:32:15,288 INFO L139 ounterexampleChecker]: Examining path program with hash -1825291028, occurence #1 [2025-04-14 16:32:15,288 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:32:15,288 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:32:15,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:32:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash 667688201, now seen corresponding path program 1 times [2025-04-14 16:32:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:32:15,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877901219] [2025-04-14 16:32:15,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:32:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:32:15,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 16:32:15,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 16:32:15,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:32:15,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:32:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:32:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:32:15,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877901219] [2025-04-14 16:32:15,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877901219] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:32:15,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189216808] [2025-04-14 16:32:15,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:32:15,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:32:15,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:32:15,631 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 16:32:15,632 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 16:32:15,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 16:32:15,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 16:32:15,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:32:15,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:32:15,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 16:32:15,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:32:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:32:15,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:32:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:32:16,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189216808] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:32:16,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:32:16,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2025-04-14 16:32:16,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124718283] [2025-04-14 16:32:16,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:32:16,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 16:32:16,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:32:16,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 16:32:16,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-14 16:32:16,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:32:16,167 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:32:16,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 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 16:32:16,167 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:32:16,167 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:32:21,801 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 23 DAG size of output: 20 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:32:22,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:32:22,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 16:32:22,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 16:32:22,254 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 16:32:22,254 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 16:32:22,254 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:32:22,254 INFO L139 ounterexampleChecker]: Examining path program with hash -1825291028, occurence #2 [2025-04-14 16:32:22,254 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:32:22,254 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 16:32:22,271 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:32:22,271 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 16:32:22,271 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:32:22,271 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-14 16:32:22,271 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:32:22,271 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-04-14 16:32:22,272 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:32:22,272 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:32:22,272 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:32:22,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:32:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash 457299273, now seen corresponding path program 2 times [2025-04-14 16:32:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:32:22,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481939593] [2025-04-14 16:32:22,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 16:32:22,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:32:22,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 16:32:22,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 16:32:22,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 16:32:22,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:32:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:32:23,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:32:23,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481939593] [2025-04-14 16:32:23,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481939593] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:32:23,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391460999] [2025-04-14 16:32:23,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 16:32:23,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:32:23,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:32:23,175 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 16:32:23,177 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 16:32:23,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 16:32:23,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 16:32:23,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 16:32:23,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:32:23,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-14 16:32:23,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:32:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:32:23,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:32:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:32:31,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391460999] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:32:31,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:32:31,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 36 [2025-04-14 16:32:31,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427889287] [2025-04-14 16:32:31,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:32:31,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 16:32:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:32:31,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 16:32:31,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=990, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 16:32:31,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:32:31,063 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:32:31,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 36 states have internal predecessors, (80), 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 16:32:31,063 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:32:31,063 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-14 16:32:31,063 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:32:36,434 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 52 DAG size of output: 49 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:33:20,304 WARN L286 SmtUtils]: Spent 40.38s on a formula simplification. DAG size of input: 60 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:35:42,098 WARN L286 SmtUtils]: Spent 2.35m on a formula simplification. DAG size of input: 66 DAG size of output: 39 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:36:06,876 WARN L286 SmtUtils]: Spent 22.70s on a formula simplification. DAG size of input: 68 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:36:10,924 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 16:36:14,930 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 16:36:25,781 WARN L286 SmtUtils]: Spent 10.37s on a formula simplification. DAG size of input: 53 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:36:27,523 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 16:36:43,450 WARN L286 SmtUtils]: Spent 15.66s on a formula simplification. DAG size of input: 69 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:36:57,084 WARN L286 SmtUtils]: Spent 9.29s on a formula simplification. DAG size of input: 62 DAG size of output: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:37:07,599 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 16:37:11,602 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 16:37:15,932 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 16:37:19,939 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 16:37:20,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:37:20,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 16:37:20,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-14 16:37:20,432 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 16:37:20,627 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 16:37:20,627 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 16:37:20,628 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:37:20,628 INFO L139 ounterexampleChecker]: Examining path program with hash 2070569026, occurence #1 [2025-04-14 16:37:20,628 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:37:20,628 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:37:20,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:37:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1327947301, now seen corresponding path program 3 times [2025-04-14 16:37:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:37:20,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400487887] [2025-04-14 16:37:20,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 16:37:20,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:37:20,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 7 equivalence classes. [2025-04-14 16:37:20,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 16:37:20,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-04-14 16:37:20,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:37:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:37:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:37:26,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400487887] [2025-04-14 16:37:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400487887] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:37:26,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716087033] [2025-04-14 16:37:26,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 16:37:26,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:37:26,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:37:26,313 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 16:37:26,314 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 16:37:26,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 7 equivalence classes. [2025-04-14 16:37:26,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 16:37:26,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-04-14 16:37:26,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:37:26,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-14 16:37:26,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:37:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:37:28,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:38:20,926 WARN L286 SmtUtils]: Spent 10.75s on a formula simplification. DAG size of input: 37 DAG size of output: 34 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2025-04-14 16:38:30,108 WARN L286 SmtUtils]: Spent 5.97s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:38:54,681 WARN L286 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:42:20,924 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 16:42:57,345 WARN L286 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:46:24,944 WARN L286 SmtUtils]: Spent 12.67s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:46:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 82 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:46:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716087033] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:46:34,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:46:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 29] total 76 [2025-04-14 16:46:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49305515] [2025-04-14 16:46:34,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:46:34,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-04-14 16:46:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:46:34,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-04-14 16:46:34,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1158, Invalid=4454, Unknown=88, NotChecked=0, Total=5700 [2025-04-14 16:46:34,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:46:34,860 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:46:34,860 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.605263157894737) internal successors, (122), 76 states have internal predecessors, (122), 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 16:46:34,860 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:46:34,860 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-14 16:46:34,860 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2025-04-14 16:46:34,860 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:46:39,412 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse35 (+ c_thread2Thread1of1ForFork1_~i~1 4)) (.cse33 (+ 5 c_thread2Thread1of1ForFork1_~i~1)) (.cse38 (+ c_thread2Thread1of1ForFork1_~i~1 1))) (let ((.cse42 (mod .cse38 4294967296)) (.cse19 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse13 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse12 (mod .cse33 4294967296)) (.cse36 (+ c_thread2Thread1of1ForFork1_~i~1 3)) (.cse73 (* c_~C~0 4294967295)) (.cse50 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse25 (mod .cse35 4294967296)) (.cse74 (* c_thread2Thread1of1ForFork1_~i~1 4294967295)) (.cse52 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296))) (let ((.cse47 (< 3 .cse52)) (.cse48 (mod (+ .cse74 4294967289) 4294967296)) (.cse53 (+ 4294967292 .cse52)) (.cse55 (+ .cse25 2)) (.cse67 (+ .cse50 1)) (.cse58 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse70 (mod .cse73 4294967296)) (.cse64 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse15 (+ 2 (mod .cse36 4294967296))) (.cse17 (+ 4294967292 .cse12)) (.cse56 (+ .cse13 1)) (.cse21 (< 3 .cse12)) (.cse20 (mod (+ 4294967290 .cse74) 4294967296)) (.cse27 (+ 2 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (.cse71 (mod c_~counter~0 4294967296)) (.cse16 (+ .cse19 1)) (.cse72 (mod (+ c_~counter~0 .cse73) 4294967296)) (.cse22 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse45 (+ .cse42 1)) (.cse46 (* 4294967295 c_~M~0)) (.cse39 (mod c_~M~0 4294967296)) (.cse49 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (let ((.cse1 (< .cse39 (+ .cse49 1))) (.cse2 (< .cse19 .cse39)) (.cse9 (< 4294967295 (+ .cse39 (mod (+ .cse46 c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)))) (.cse11 (and (<= .cse39 .cse45) (not (= (mod (+ .cse74 4294967294) 4294967296) 0)))) (.cse28 (+ .cse22 1)) (.cse40 (< .cse49 .cse39)) (.cse0 (= .cse72 0)) (.cse43 (< .cse39 .cse16)) (.cse24 (= .cse71 0)) (.cse44 (< .cse13 .cse39)) (.cse5 (< 4294967295 (+ .cse39 (mod (+ .cse46 c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)))) (.cse6 (< .cse39 .cse27)) (.cse30 (and (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse76 (* v_y_57 4294967296))) (let ((.cse75 (+ .cse76 (* v_z_57 4294967295)))) (or (< .cse50 .cse75) (< (+ v_z_57 .cse12) 4294967296) (< .cse75 .cse15) (< .cse17 (+ .cse76 (* v_z_57 4294967296))) (< .cse75 .cse56))))) (or (< 4294967294 (+ .cse13 .cse20)) .cse21 (< 4294967294 (+ .cse20 .cse49))))) (.cse3 (< .cse71 1)) (.cse61 (+ 4294967292 .cse64)) (.cse63 (+ .cse12 2)) (.cse59 (< 3 .cse64)) (.cse57 (mod (+ 4294967288 .cse74) 4294967296)) (.cse23 (< 4294967294 (mod (+ 4294967295 c_~counter~0 .cse73) 4294967296))) (.cse4 (= (+ .cse72 .cse70) 4294967296)) (.cse7 (= 4294967296 (+ .cse70 .cse71))) (.cse8 (< 4294967294 (mod (+ 4294967295 c_~counter~0) 4294967296))) (.cse41 (and (or .cse47 (< 4294967294 (+ .cse19 .cse48)) (< 4294967294 (+ .cse48 .cse50))) (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse68 (* v_y_57 4294967296))) (let ((.cse69 (+ .cse68 (* v_z_57 4294967295)))) (or (< (+ v_z_57 .cse52) 4294967296) (< .cse53 (+ .cse68 (* v_z_57 4294967296))) (< .cse69 .cse55) (< .cse69 .cse67) (< .cse58 .cse69))))))) (.cse10 (< (mod (+ c_~C~0 c_~counter~0) 4294967296) 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse1 .cse10 .cse2 .cse11) (or (and (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse18 (* v_y_57 4294967296))) (let ((.cse14 (+ .cse18 (* v_z_57 4294967295)))) (or (< (+ v_z_57 .cse12) 4294967296) (< .cse13 .cse14) (< .cse14 .cse15) (< .cse14 .cse16) (< .cse17 (+ .cse18 (* v_z_57 4294967296))))))) (or (< 4294967294 (+ .cse19 .cse20)) .cse21 (< 4294967294 (+ .cse20 .cse22)))) .cse3 .cse23 .cse4) (or .cse7 .cse24 .cse10 (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse29 (* v_y_57 4294967296))) (let ((.cse26 (+ .cse29 (* v_z_57 4294967295)))) (or (< (+ v_z_57 .cse25) 4294967296) (< .cse13 .cse26) (< .cse26 .cse27) (< .cse26 .cse28) (< .cse26 .cse16) (< 8589934591 (+ .cse29 .cse25 (* v_z_57 4294967296)))))))) (or .cse30 .cse3 .cse23 .cse4) (let ((.cse31 (+ 2 c_thread2Thread1of1ForFork1_~i~1 .cse22)) (.cse32 (+ .cse39 c_thread1Thread1of1ForFork0_~i~0))) (let ((.cse34 (<= .cse31 .cse32))) (or (and (<= 5 c_thread1Thread1of1ForFork0_~i~0) (or (< .cse31 .cse32) (= .cse32 .cse31)) (<= c_thread1Thread1of1ForFork0_~i~0 .cse33)) (and .cse34 (= .cse35 c_thread1Thread1of1ForFork0_~i~0)) (and .cse34 (<= c_thread1Thread1of1ForFork0_~i~0 .cse36)) (let ((.cse37 (= c_~C~0 0))) (and (or .cse37 (= c_~C~0 c_~counter~0)) (or (and (<= c_thread1Thread1of1ForFork0_~i~0 .cse38) (<= (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 4294967293) .cse39)) (not .cse37) (= c_~counter~0 0))))))) (or .cse9 .cse1 .cse2 .cse3 .cse11 .cse23 .cse4) (or .cse40 .cse9 .cse3 .cse11 .cse23 .cse4 (< .cse39 .cse28)) (or .cse41 .cse3 .cse23 .cse4) (or .cse0 (< .cse42 .cse39) .cse3 (< .cse22 .cse39)) (or .cse43 .cse0 .cse3 .cse44 .cse4 .cse5 .cse6) (or .cse40 .cse0 (< .cse39 .cse45) .cse3 (< 4294967295 (+ .cse39 (mod (+ .cse46 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)))) (or .cse7 .cse43 .cse24 .cse10 .cse44 .cse5 .cse6) (or .cse3 .cse23 .cse4 (and (or .cse47 (< 4294967294 (+ .cse48 .cse49)) (< 4294967294 (+ .cse13 .cse48))) (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse54 (* v_y_57 4294967296))) (let ((.cse51 (+ .cse54 (* v_z_57 4294967295)))) (or (< .cse50 .cse51) (< (+ v_z_57 .cse52) 4294967296) (< .cse53 (+ .cse54 (* v_z_57 4294967296))) (< .cse51 .cse55) (< .cse51 .cse56))))))) (or .cse7 .cse30 .cse8 .cse10) (or (and (or (< 4294967294 (+ .cse13 .cse57)) (< 4294967294 (+ .cse58 .cse57)) .cse59) (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse62 (* v_y_57 4294967296))) (let ((.cse60 (+ .cse62 (* v_z_57 4294967295)))) (or (< (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse60) (< .cse61 (+ .cse62 (* v_z_57 4294967296))) (< .cse60 .cse63) (< (+ v_z_57 .cse64) 4294967296) (< .cse60 (+ .cse58 1))))))) .cse3 .cse23 .cse4) (or .cse3 (and (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse65 (* v_y_57 4294967296))) (let ((.cse66 (+ .cse65 (* v_z_57 4294967295)))) (or (< .cse61 (+ .cse65 (* v_z_57 4294967296))) (< .cse66 .cse63) (< (+ v_z_57 .cse64) 4294967296) (< .cse66 .cse67) (< .cse58 .cse66))))) (or .cse59 (< 4294967294 (+ .cse19 .cse57)) (< 4294967294 (+ .cse50 .cse57)))) .cse23 .cse4) (or .cse7 .cse8 .cse41 .cse10)))))) is different from false [2025-04-14 16:46:43,703 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse44 (+ c_thread2Thread1of1ForFork1_~i~1 4)) (.cse43 (+ 5 c_thread2Thread1of1ForFork1_~i~1))) (let ((.cse4 (mod c_~M~0 4294967296)) (.cse32 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse46 (+ c_thread2Thread1of1ForFork1_~i~1 1)) (.cse29 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse23 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse22 (mod .cse43 4294967296)) (.cse45 (+ c_thread2Thread1of1ForFork1_~i~1 3)) (.cse79 (* c_~C~0 4294967295)) (.cse56 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse35 (mod .cse44 4294967296)) (.cse80 (* c_thread2Thread1of1ForFork1_~i~1 4294967295)) (.cse58 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296))) (let ((.cse53 (< 3 .cse58)) (.cse54 (mod (+ .cse80 4294967289) 4294967296)) (.cse59 (+ 4294967292 .cse58)) (.cse61 (+ .cse35 2)) (.cse73 (+ .cse56 1)) (.cse64 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse76 (mod .cse79 4294967296)) (.cse70 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse25 (+ 2 (mod .cse45 4294967296))) (.cse27 (+ 4294967292 .cse22)) (.cse62 (+ .cse23 1)) (.cse31 (< 3 .cse22)) (.cse30 (mod (+ 4294967290 .cse80) 4294967296)) (.cse37 (+ 2 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (.cse77 (mod c_~counter~0 4294967296)) (.cse26 (+ .cse29 1)) (.cse78 (mod (+ c_~counter~0 .cse79) 4294967296)) (.cse51 (+ (mod .cse46 4294967296) 1)) (.cse52 (* 4294967295 c_~M~0)) (.cse55 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse9 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse83 (= c_~C~0 0)) (.cse41 (+ 2 c_thread2Thread1of1ForFork1_~i~1 .cse32)) (.cse42 (+ .cse4 c_thread1Thread1of1ForFork0_~i~0))) (let ((.cse0 (<= .cse41 .cse42)) (.cse8 (or .cse83 (= c_~C~0 c_~counter~0))) (.cse5 (<= (+ .cse9 4294967293) .cse4)) (.cse6 (not .cse83)) (.cse7 (= c_~counter~0 0)) (.cse11 (< .cse4 (+ .cse55 1))) (.cse12 (< .cse29 .cse4)) (.cse19 (< 4294967295 (+ .cse4 (mod (+ .cse52 c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)))) (.cse21 (and (<= .cse4 .cse51) (not (= (mod (+ .cse80 4294967294) 4294967296) 0)))) (.cse38 (+ .cse32 1)) (.cse47 (< .cse55 .cse4)) (.cse10 (= .cse78 0)) (.cse49 (< .cse4 .cse26)) (.cse34 (= .cse77 0)) (.cse50 (< .cse23 .cse4)) (.cse15 (< 4294967295 (+ .cse4 (mod (+ .cse52 c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)))) (.cse16 (< .cse4 .cse37)) (.cse40 (and (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse82 (* v_y_57 4294967296))) (let ((.cse81 (+ .cse82 (* v_z_57 4294967295)))) (or (< .cse56 .cse81) (< (+ v_z_57 .cse22) 4294967296) (< .cse81 .cse25) (< .cse27 (+ .cse82 (* v_z_57 4294967296))) (< .cse81 .cse62))))) (or (< 4294967294 (+ .cse23 .cse30)) .cse31 (< 4294967294 (+ .cse30 .cse55))))) (.cse13 (< .cse77 1)) (.cse67 (+ 4294967292 .cse70)) (.cse69 (+ .cse22 2)) (.cse65 (< 3 .cse70)) (.cse63 (mod (+ 4294967288 .cse80) 4294967296)) (.cse33 (< 4294967294 (mod (+ 4294967295 c_~counter~0 .cse79) 4294967296))) (.cse14 (= (+ .cse78 .cse76) 4294967296)) (.cse17 (= 4294967296 (+ .cse76 .cse77))) (.cse18 (< 4294967294 (mod (+ 4294967295 c_~counter~0) 4294967296))) (.cse48 (and (or .cse53 (< 4294967294 (+ .cse29 .cse54)) (< 4294967294 (+ .cse54 .cse56))) (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse74 (* v_y_57 4294967296))) (let ((.cse75 (+ .cse74 (* v_z_57 4294967295)))) (or (< (+ v_z_57 .cse58) 4294967296) (< .cse59 (+ .cse74 (* v_z_57 4294967296))) (< .cse75 .cse61) (< .cse75 .cse73) (< .cse64 .cse75))))))) (.cse20 (< (mod (+ c_~C~0 c_~counter~0) 4294967296) 1))) (and (let ((.cse2 (div c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse1 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse3 (+ .cse9 c_thread1Thread1of1ForFork0_~i~0))) (or (and .cse0 (<= .cse1 .cse2)) (and (<= .cse3 (+ .cse4 5 c_thread2Thread1of1ForFork1_~i~1)) (<= (+ .cse2 1) .cse1)) (and (or (and (<= .cse3 (+ .cse4 c_thread2Thread1of1ForFork1_~i~1 1)) .cse5) .cse6 .cse7) .cse8))) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse18 .cse19 .cse11 .cse20 .cse12 .cse21) (or (and (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse28 (* v_y_57 4294967296))) (let ((.cse24 (+ .cse28 (* v_z_57 4294967295)))) (or (< (+ v_z_57 .cse22) 4294967296) (< .cse23 .cse24) (< .cse24 .cse25) (< .cse24 .cse26) (< .cse27 (+ .cse28 (* v_z_57 4294967296))))))) (or (< 4294967294 (+ .cse29 .cse30)) .cse31 (< 4294967294 (+ .cse30 .cse32)))) .cse13 .cse33 .cse14) (or .cse17 .cse34 .cse20 (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse39 (* v_y_57 4294967296))) (let ((.cse36 (+ .cse39 (* v_z_57 4294967295)))) (or (< (+ v_z_57 .cse35) 4294967296) (< .cse23 .cse36) (< .cse36 .cse37) (< .cse36 .cse38) (< .cse36 .cse26) (< 8589934591 (+ .cse39 .cse35 (* v_z_57 4294967296)))))))) (or .cse40 .cse13 .cse33 .cse14) (or (and (<= 5 c_thread1Thread1of1ForFork0_~i~0) (or (< .cse41 .cse42) (= .cse42 .cse41)) (<= c_thread1Thread1of1ForFork0_~i~0 .cse43)) (and .cse0 (= .cse44 c_thread1Thread1of1ForFork0_~i~0)) (and .cse0 (<= c_thread1Thread1of1ForFork0_~i~0 .cse45)) (and .cse8 (or (and (<= c_thread1Thread1of1ForFork0_~i~0 .cse46) .cse5) .cse6 .cse7))) (or .cse19 .cse11 .cse12 .cse13 .cse21 .cse33 .cse14) (or .cse47 .cse19 .cse13 .cse21 .cse33 .cse14 (< .cse4 .cse38)) (or .cse48 .cse13 .cse33 .cse14) (<= (+ .cse9 1) .cse4) (or .cse49 .cse10 .cse13 .cse50 .cse14 .cse15 .cse16) (or .cse47 .cse10 (< .cse4 .cse51) .cse13 (< 4294967295 (+ .cse4 (mod (+ .cse52 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)))) (or .cse17 .cse49 .cse34 .cse20 .cse50 .cse15 .cse16) (or .cse13 .cse33 .cse14 (and (or .cse53 (< 4294967294 (+ .cse54 .cse55)) (< 4294967294 (+ .cse23 .cse54))) (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse60 (* v_y_57 4294967296))) (let ((.cse57 (+ .cse60 (* v_z_57 4294967295)))) (or (< .cse56 .cse57) (< (+ v_z_57 .cse58) 4294967296) (< .cse59 (+ .cse60 (* v_z_57 4294967296))) (< .cse57 .cse61) (< .cse57 .cse62))))))) (or .cse17 .cse40 .cse18 .cse20) (or (and (or (< 4294967294 (+ .cse23 .cse63)) (< 4294967294 (+ .cse64 .cse63)) .cse65) (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse68 (* v_y_57 4294967296))) (let ((.cse66 (+ .cse68 (* v_z_57 4294967295)))) (or (< (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse66) (< .cse67 (+ .cse68 (* v_z_57 4294967296))) (< .cse66 .cse69) (< (+ v_z_57 .cse70) 4294967296) (< .cse66 (+ .cse64 1))))))) .cse13 .cse33 .cse14) (or .cse13 (and (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse71 (* v_y_57 4294967296))) (let ((.cse72 (+ .cse71 (* v_z_57 4294967295)))) (or (< .cse67 (+ .cse71 (* v_z_57 4294967296))) (< .cse72 .cse69) (< (+ v_z_57 .cse70) 4294967296) (< .cse72 .cse73) (< .cse64 .cse72))))) (or .cse65 (< 4294967294 (+ .cse29 .cse63)) (< 4294967294 (+ .cse56 .cse63)))) .cse33 .cse14) (or .cse17 .cse18 .cse48 .cse20)))))) is different from false [2025-04-14 16:46:49,207 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse69 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse19 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse13 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse12 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse65 (* c_~C~0 4294967295)) (.cse42 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse25 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse66 (* c_thread2Thread1of1ForFork1_~i~1 4294967295)) (.cse44 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296))) (let ((.cse39 (< 3 .cse44)) (.cse40 (mod (+ .cse66 4294967289) 4294967296)) (.cse45 (+ 4294967292 .cse44)) (.cse47 (+ .cse25 2)) (.cse59 (+ .cse42 1)) (.cse50 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse62 (mod .cse65 4294967296)) (.cse56 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse15 (+ 2 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296))) (.cse17 (+ 4294967292 .cse12)) (.cse48 (+ .cse13 1)) (.cse21 (< 3 .cse12)) (.cse20 (mod (+ 4294967290 .cse66) 4294967296)) (.cse27 (+ 2 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (.cse63 (mod c_~counter~0 4294967296)) (.cse16 (+ .cse19 1)) (.cse64 (mod (+ c_~counter~0 .cse65) 4294967296)) (.cse22 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse37 (+ .cse69 1)) (.cse38 (* 4294967295 c_~M~0)) (.cse32 (mod c_~M~0 4294967296)) (.cse41 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (let ((.cse1 (< .cse32 (+ .cse41 1))) (.cse2 (< .cse19 .cse32)) (.cse9 (< 4294967295 (+ .cse32 (mod (+ .cse38 c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)))) (.cse11 (and (<= .cse32 .cse37) (not (= (mod (+ .cse66 4294967294) 4294967296) 0)))) (.cse28 (+ .cse22 1)) (.cse33 (< .cse69 .cse32)) (.cse31 (< .cse41 .cse32)) (.cse0 (= .cse64 0)) (.cse35 (< .cse32 .cse16)) (.cse24 (= .cse63 0)) (.cse36 (< .cse13 .cse32)) (.cse5 (< 4294967295 (+ .cse32 (mod (+ .cse38 c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)))) (.cse6 (< .cse32 .cse27)) (.cse30 (and (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse68 (* v_y_57 4294967296))) (let ((.cse67 (+ .cse68 (* v_z_57 4294967295)))) (or (< .cse42 .cse67) (< (+ v_z_57 .cse12) 4294967296) (< .cse67 .cse15) (< .cse17 (+ .cse68 (* v_z_57 4294967296))) (< .cse67 .cse48))))) (or (< 4294967294 (+ .cse13 .cse20)) .cse21 (< 4294967294 (+ .cse20 .cse41))))) (.cse3 (< .cse63 1)) (.cse53 (+ 4294967292 .cse56)) (.cse55 (+ .cse12 2)) (.cse51 (< 3 .cse56)) (.cse49 (mod (+ 4294967288 .cse66) 4294967296)) (.cse23 (< 4294967294 (mod (+ 4294967295 c_~counter~0 .cse65) 4294967296))) (.cse4 (= (+ .cse64 .cse62) 4294967296)) (.cse7 (= 4294967296 (+ .cse62 .cse63))) (.cse8 (< 4294967294 (mod (+ 4294967295 c_~counter~0) 4294967296))) (.cse34 (and (or .cse39 (< 4294967294 (+ .cse19 .cse40)) (< 4294967294 (+ .cse40 .cse42))) (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse60 (* v_y_57 4294967296))) (let ((.cse61 (+ .cse60 (* v_z_57 4294967295)))) (or (< (+ v_z_57 .cse44) 4294967296) (< .cse45 (+ .cse60 (* v_z_57 4294967296))) (< .cse61 .cse47) (< .cse61 .cse59) (< .cse50 .cse61))))))) (.cse10 (< (mod (+ c_~C~0 c_~counter~0) 4294967296) 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse1 .cse10 .cse2 .cse11) (or (and (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse18 (* v_y_57 4294967296))) (let ((.cse14 (+ .cse18 (* v_z_57 4294967295)))) (or (< (+ v_z_57 .cse12) 4294967296) (< .cse13 .cse14) (< .cse14 .cse15) (< .cse14 .cse16) (< .cse17 (+ .cse18 (* v_z_57 4294967296))))))) (or (< 4294967294 (+ .cse19 .cse20)) .cse21 (< 4294967294 (+ .cse20 .cse22)))) .cse3 .cse23 .cse4) (or .cse7 .cse24 .cse10 (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse29 (* v_y_57 4294967296))) (let ((.cse26 (+ .cse29 (* v_z_57 4294967295)))) (or (< (+ v_z_57 .cse25) 4294967296) (< .cse13 .cse26) (< .cse26 .cse27) (< .cse26 .cse28) (< .cse26 .cse16) (< 8589934591 (+ .cse29 .cse25 (* v_z_57 4294967296)))))))) (or .cse30 .cse3 .cse23 .cse4) (or .cse9 .cse1 .cse2 .cse3 .cse11 .cse23 .cse4) (or .cse31 .cse9 .cse3 .cse11 .cse23 .cse4 (< .cse32 .cse28)) (or .cse31 (< .cse32 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1)) .cse0 .cse33 .cse3) (or .cse34 .cse3 .cse23 .cse4) (or .cse0 .cse33 .cse3 (< .cse22 .cse32)) (or .cse35 .cse0 .cse3 .cse36 .cse4 .cse5 .cse6) (or .cse31 .cse0 (< .cse32 .cse37) .cse3 (< 4294967295 (+ .cse32 (mod (+ .cse38 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)))) (or .cse7 .cse35 .cse24 .cse10 .cse36 .cse5 .cse6) (or .cse3 .cse23 .cse4 (and (or .cse39 (< 4294967294 (+ .cse40 .cse41)) (< 4294967294 (+ .cse13 .cse40))) (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse46 (* v_y_57 4294967296))) (let ((.cse43 (+ .cse46 (* v_z_57 4294967295)))) (or (< .cse42 .cse43) (< (+ v_z_57 .cse44) 4294967296) (< .cse45 (+ .cse46 (* v_z_57 4294967296))) (< .cse43 .cse47) (< .cse43 .cse48))))))) (or .cse7 .cse30 .cse8 .cse10) (or (and (or (< 4294967294 (+ .cse13 .cse49)) (< 4294967294 (+ .cse50 .cse49)) .cse51) (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse54 (* v_y_57 4294967296))) (let ((.cse52 (+ .cse54 (* v_z_57 4294967295)))) (or (< (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse52) (< .cse53 (+ .cse54 (* v_z_57 4294967296))) (< .cse52 .cse55) (< (+ v_z_57 .cse56) 4294967296) (< .cse52 (+ .cse50 1))))))) .cse3 .cse23 .cse4) (or .cse3 (and (forall ((v_y_57 Int) (v_z_57 Int)) (let ((.cse57 (* v_y_57 4294967296))) (let ((.cse58 (+ .cse57 (* v_z_57 4294967295)))) (or (< .cse53 (+ .cse57 (* v_z_57 4294967296))) (< .cse58 .cse55) (< (+ v_z_57 .cse56) 4294967296) (< .cse58 .cse59) (< .cse50 .cse58))))) (or .cse51 (< 4294967294 (+ .cse19 .cse49)) (< 4294967294 (+ .cse42 .cse49)))) .cse23 .cse4) (or .cse7 .cse8 .cse34 .cse10))))) is different from false Received shutdown request... [2025-04-14 16:46:52,086 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 16:46:52,103 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 16:46:52,112 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 16:46:53,096 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 16:46:53,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-14 16:46:53,312 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 16:46:53,323 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 137 [2025-04-14 16:46:53,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 16:46:53,324 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 16:46:53,326 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 16:46:53,326 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 16:46:53,326 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 16:46:53,329 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-14 16:46:53,331 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 16:46:53,331 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 16:46:53,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 04:46:53 BasicIcfg [2025-04-14 16:46:53,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 16:46:53,335 INFO L158 Benchmark]: Toolchain (without parser) took 879285.42ms. Allocated memory was 155.2MB in the beginning and 616.6MB in the end (delta: 461.4MB). Free memory was 109.5MB in the beginning and 288.8MB in the end (delta: -179.4MB). Peak memory consumption was 280.2MB. Max. memory is 8.0GB. [2025-04-14 16:46:53,335 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:46:53,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.98ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 95.1MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 16:46:53,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.01ms. Allocated memory is still 155.2MB. Free memory was 95.1MB in the beginning and 94.2MB in the end (delta: 962.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:46:53,335 INFO L158 Benchmark]: Boogie Preprocessor took 17.26ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.9MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 16:46:53,335 INFO L158 Benchmark]: IcfgBuilder took 272.01ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 72.6MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 16:46:53,336 INFO L158 Benchmark]: TraceAbstraction took 878733.23ms. Allocated memory was 155.2MB in the beginning and 616.6MB in the end (delta: 461.4MB). Free memory was 71.9MB in the beginning and 288.8MB in the end (delta: -216.9MB). Peak memory consumption was 242.5MB. Max. memory is 8.0GB. [2025-04-14 16:46:53,336 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.14ms. Allocated memory is still 155.2MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.98ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 95.1MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.01ms. Allocated memory is still 155.2MB. Free memory was 95.1MB in the beginning and 94.2MB in the end (delta: 962.7kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.26ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.9MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 272.01ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 72.6MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 878733.23ms. Allocated memory was 155.2MB in the beginning and 616.6MB in the end (delta: 461.4MB). Free memory was 71.9MB in the beginning and 288.8MB in the end (delta: -216.9MB). Peak memory consumption was 242.5MB. 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: 517, independent: 413, independent conditional: 274, independent unconditional: 139, dependent: 104, dependent conditional: 100, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 420, independent: 413, independent conditional: 274, independent unconditional: 139, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 420, independent: 413, independent conditional: 274, independent unconditional: 139, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 424, independent: 413, independent conditional: 274, independent unconditional: 139, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 424, independent: 413, independent conditional: 0, independent unconditional: 413, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 424, independent: 413, independent conditional: 0, independent unconditional: 413, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 135, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 135, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 141, dependent conditional: 24, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 424, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 135, unknown conditional: 2, unknown unconditional: 133] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 279, Maximal queried relation: 3, Independence queries for same thread: 97, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 29, Number of trivial persistent sets: 23, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 143, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 517, independent: 413, independent conditional: 274, independent unconditional: 139, dependent: 104, dependent conditional: 100, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 420, independent: 413, independent conditional: 274, independent unconditional: 139, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 420, independent: 413, independent conditional: 274, independent unconditional: 139, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 424, independent: 413, independent conditional: 274, independent unconditional: 139, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 424, independent: 413, independent conditional: 0, independent unconditional: 413, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 424, independent: 413, independent conditional: 0, independent unconditional: 413, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 135, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 135, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 141, dependent conditional: 24, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 424, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 135, unknown conditional: 2, unknown unconditional: 133] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 279, Maximal queried relation: 3, Independence queries for same thread: 97 - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 31 locations, 34 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 878.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 313.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: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 563.6s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 297 ConstructedInterpolants, 20 QuantifiedInterpolants, 9670 SizeOfPredicates, 30 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 1/354 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]: 16, ConditionCalculationTime [ms]: 0, ConditionCalculations: 1, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown