/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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 23:24:04,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 23:24:04,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-14 23:24:04,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 23:24:04,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 23:24:04,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 23:24:04,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 23:24:04,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 23:24:04,619 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 23:24:04,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 23:24:04,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 23:24:04,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 23:24:04,621 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 23:24:04,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 23:24:04,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:24:04,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 23:24:04,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 23:24:04,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 23:24:04,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 23:24:04,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 23:24:04,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 23:24:04,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 23:24:04,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 23:24:04,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 23:24:04,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 23:24:04,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 23:24:04,869 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 23:24:04,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2025-03-14 23:24:06,000 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18cd0b5f0/1919228e0b6142efa9b588bfd74f6a0b/FLAGb44ee9504 [2025-03-14 23:24:06,166 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 23:24:06,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2025-03-14 23:24:06,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18cd0b5f0/1919228e0b6142efa9b588bfd74f6a0b/FLAGb44ee9504 [2025-03-14 23:24:06,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18cd0b5f0/1919228e0b6142efa9b588bfd74f6a0b [2025-03-14 23:24:06,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 23:24:06,194 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 23:24:06,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 23:24:06,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 23:24:06,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 23:24:06,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b40d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06, skipping insertion in model container [2025-03-14 23:24:06,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 23:24:06,360 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-three-array-min.wvr.c[2854,2867] [2025-03-14 23:24:06,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:24:06,379 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 23:24:06,400 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-three-array-min.wvr.c[2854,2867] [2025-03-14 23:24:06,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:24:06,416 INFO L204 MainTranslator]: Completed translation [2025-03-14 23:24:06,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06 WrapperNode [2025-03-14 23:24:06,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 23:24:06,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 23:24:06,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 23:24:06,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 23:24:06,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,457 INFO L138 Inliner]: procedures = 25, calls = 42, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 210 [2025-03-14 23:24:06,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 23:24:06,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 23:24:06,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 23:24:06,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 23:24:06,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 23:24:06,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 23:24:06,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 23:24:06,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 23:24:06,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (1/1) ... [2025-03-14 23:24:06,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:24:06,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:06,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-14 23:24:06,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-14 23:24:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 23:24:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 23:24:06,547 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 23:24:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 23:24:06,547 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 23:24:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 23:24:06,547 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 23:24:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 23:24:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 23:24:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 23:24:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 23:24:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 23:24:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 23:24:06,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 23:24:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 23:24:06,548 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 23:24:06,634 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 23:24:06,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 23:24:06,975 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 23:24:06,975 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 23:24:07,048 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 23:24:07,049 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 23:24:07,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:24:07 BoogieIcfgContainer [2025-03-14 23:24:07,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 23:24:07,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 23:24:07,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 23:24:07,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 23:24:07,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 11:24:06" (1/3) ... [2025-03-14 23:24:07,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a0479b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:24:07, skipping insertion in model container [2025-03-14 23:24:07,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:24:06" (2/3) ... [2025-03-14 23:24:07,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a0479b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:24:07, skipping insertion in model container [2025-03-14 23:24:07,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:24:07" (3/3) ... [2025-03-14 23:24:07,057 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-03-14 23:24:07,068 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 23:24:07,070 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 286 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-14 23:24:07,070 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 23:24:07,154 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 23:24:07,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 23:24:07,208 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@2e1fb19d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 23:24:07,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 23:24:07,310 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 23:24:07,310 INFO L124 PetriNetUnfolderBase]: 21/297 cut-off events. [2025-03-14 23:24:07,311 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 23:24:07,312 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:07,312 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:07,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:07,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:07,318 INFO L85 PathProgramCache]: Analyzing trace with hash 223878685, now seen corresponding path program 1 times [2025-03-14 23:24:07,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:07,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480964660] [2025-03-14 23:24:07,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:24:08,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:08,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480964660] [2025-03-14 23:24:08,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480964660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:24:08,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:24:08,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 23:24:08,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559078572] [2025-03-14 23:24:08,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:08,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 23:24:08,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:08,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 23:24:08,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-14 23:24:08,087 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 306 [2025-03-14 23:24:08,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 306 transitions, 633 flow. Second operand has 8 states, 8 states have (on average 167.75) internal successors, (1342), 8 states have internal predecessors, (1342), 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-03-14 23:24:08,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:08,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 306 [2025-03-14 23:24:08,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:08,426 INFO L124 PetriNetUnfolderBase]: 202/812 cut-off events. [2025-03-14 23:24:08,426 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-14 23:24:08,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 812 events. 202/812 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3400 event pairs, 103 based on Foata normal form. 13/678 useless extension candidates. Maximal degree in co-relation 822. Up to 304 conditions per place. [2025-03-14 23:24:08,442 INFO L140 encePairwiseOnDemand]: 269/306 looper letters, 118 selfloop transitions, 21 changer transitions 12/298 dead transitions. [2025-03-14 23:24:08,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 298 transitions, 916 flow [2025-03-14 23:24:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 23:24:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 23:24:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1399 transitions. [2025-03-14 23:24:08,460 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5714869281045751 [2025-03-14 23:24:08,463 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, -1 predicate places. [2025-03-14 23:24:08,463 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 298 transitions, 916 flow [2025-03-14 23:24:08,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.75) internal successors, (1342), 8 states have internal predecessors, (1342), 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-03-14 23:24:08,464 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:08,464 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:08,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 23:24:08,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:08,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash -20481215, now seen corresponding path program 1 times [2025-03-14 23:24:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:08,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978428439] [2025-03-14 23:24:08,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:08,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 23:24:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:09,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978428439] [2025-03-14 23:24:09,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978428439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:24:09,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:24:09,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-14 23:24:09,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691385682] [2025-03-14 23:24:09,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:09,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-14 23:24:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:09,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-14 23:24:09,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2025-03-14 23:24:09,323 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 306 [2025-03-14 23:24:09,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 298 transitions, 916 flow. Second operand has 21 states, 21 states have (on average 149.9047619047619) internal successors, (3148), 21 states have internal predecessors, (3148), 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-03-14 23:24:09,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:09,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 306 [2025-03-14 23:24:09,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:10,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][201], [201#L61-5true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:24:10,544 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,545 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,545 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,545 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][202], [201#L61-5true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:24:10,545 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,545 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,545 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,545 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][201], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true]) [2025-03-14 23:24:10,546 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,546 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,546 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,546 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][202], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 149#L48-5true]) [2025-03-14 23:24:10,546 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,546 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,546 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,546 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][201], [101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:24:10,547 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,548 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,548 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,548 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][202], [101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:24:10,548 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,548 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,548 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,548 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][201], [thread2Thread1of1ForFork2InUse, 194#L62true, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true]) [2025-03-14 23:24:10,549 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,549 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,549 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,549 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][202], [thread2Thread1of1ForFork2InUse, 194#L62true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 149#L48-5true]) [2025-03-14 23:24:10,550 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,550 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,550 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:10,550 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:10,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([825] L62-->L65: Formula: (let ((.cse0 (* |v_thread2Thread1of1ForFork2_~i~1#1_9| 4))) (let ((.cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int_66| v_~A~0.base_22) (+ .cse0 v_~A~0.offset_22))) (.cse3 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483648)))) (and (= |v_#memory_int_65| (store |v_#memory_int_66| v_~C~0.base_24 (store (select |v_#memory_int_66| v_~C~0.base_24) (+ v_~C~0.offset_24 .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| (+ .cse1 (select (select |v_#memory_int_66| v_~B~0.base_20) (+ v_~B~0.offset_20 .cse0)))) .cse2 (not (= (ite (or .cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse1)) 1 0) 0)) .cse3 (not (= (ite (or (<= .cse1 |v_thread2Thread1of1ForFork2_plus_#res#1_1|) .cse3) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_9| 1) v_~p~0_11)))) InVars {~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, ~C~0.base=v_~C~0.base_24, #memory_int=|v_#memory_int_66|, ~C~0.offset=v_~C~0.offset_24, ~B~0.offset=v_~B~0.offset_20} OutVars{~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, #memory_int=|v_#memory_int_65|, ~C~0.offset=v_~C~0.offset_24, ~p~0=v_~p~0_11, ~B~0.offset=v_~B~0.offset_20, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][277], [60#L65true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 230#L53-2true]) [2025-03-14 23:24:10,803 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-03-14 23:24:10,803 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:24:10,804 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:10,804 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:10,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([825] L62-->L65: Formula: (let ((.cse0 (* |v_thread2Thread1of1ForFork2_~i~1#1_9| 4))) (let ((.cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int_66| v_~A~0.base_22) (+ .cse0 v_~A~0.offset_22))) (.cse3 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483648)))) (and (= |v_#memory_int_65| (store |v_#memory_int_66| v_~C~0.base_24 (store (select |v_#memory_int_66| v_~C~0.base_24) (+ v_~C~0.offset_24 .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| (+ .cse1 (select (select |v_#memory_int_66| v_~B~0.base_20) (+ v_~B~0.offset_20 .cse0)))) .cse2 (not (= (ite (or .cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse1)) 1 0) 0)) .cse3 (not (= (ite (or (<= .cse1 |v_thread2Thread1of1ForFork2_plus_#res#1_1|) .cse3) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_9| 1) v_~p~0_11)))) InVars {~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, ~C~0.base=v_~C~0.base_24, #memory_int=|v_#memory_int_66|, ~C~0.offset=v_~C~0.offset_24, ~B~0.offset=v_~B~0.offset_20} OutVars{~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, #memory_int=|v_#memory_int_65|, ~C~0.offset=v_~C~0.offset_24, ~p~0=v_~p~0_11, ~B~0.offset=v_~B~0.offset_20, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][277], [60#L65true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 230#L53-2true]) [2025-03-14 23:24:10,804 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-03-14 23:24:10,804 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:10,804 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:24:10,804 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:10,840 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~minc~0_26 v_~minc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|) (< v_~minc~0_26 .cse0)) (and (= v_~minc~0_25 .cse0) (<= .cse0 v_~minc~0_26)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_26, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_25, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][307], [201#L61-5true, 99#L82true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 230#L53-2true]) [2025-03-14 23:24:10,840 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-14 23:24:10,840 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:24:10,840 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:24:10,840 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-14 23:24:10,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~minc~0_26 v_~minc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|) (< v_~minc~0_26 .cse0)) (and (= v_~minc~0_25 .cse0) (<= .cse0 v_~minc~0_26)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_26, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_25, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][307], [99#L82true, thread2Thread1of1ForFork2InUse, 194#L62true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 230#L53-2true]) [2025-03-14 23:24:10,841 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-14 23:24:10,841 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:24:10,841 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-14 23:24:10,841 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:24:11,770 INFO L124 PetriNetUnfolderBase]: 1820/4821 cut-off events. [2025-03-14 23:24:11,770 INFO L125 PetriNetUnfolderBase]: For 1485/1632 co-relation queries the response was YES. [2025-03-14 23:24:11,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9394 conditions, 4821 events. 1820/4821 cut-off events. For 1485/1632 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 40543 event pairs, 715 based on Foata normal form. 0/3778 useless extension candidates. Maximal degree in co-relation 8091. Up to 2334 conditions per place. [2025-03-14 23:24:11,800 INFO L140 encePairwiseOnDemand]: 261/306 looper letters, 224 selfloop transitions, 53 changer transitions 76/500 dead transitions. [2025-03-14 23:24:11,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 500 transitions, 2302 flow [2025-03-14 23:24:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-14 23:24:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2025-03-14 23:24:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 10288 transitions. [2025-03-14 23:24:11,822 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4872596381547788 [2025-03-14 23:24:11,823 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 67 predicate places. [2025-03-14 23:24:11,823 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 500 transitions, 2302 flow [2025-03-14 23:24:11,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 149.9047619047619) internal successors, (3148), 21 states have internal predecessors, (3148), 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-03-14 23:24:11,825 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:11,825 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:11,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 23:24:11,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:11,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 87914469, now seen corresponding path program 1 times [2025-03-14 23:24:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054107748] [2025-03-14 23:24:11,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:24:12,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:12,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054107748] [2025-03-14 23:24:12,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054107748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:12,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801246831] [2025-03-14 23:24:12,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:12,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:12,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:12,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:24:12,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 23:24:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:12,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:24:12,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:24:12,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:24:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801246831] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:24:12,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:24:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-14 23:24:12,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472500350] [2025-03-14 23:24:12,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:24:12,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 23:24:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:12,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 23:24:12,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-14 23:24:12,726 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 306 [2025-03-14 23:24:12,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 500 transitions, 2302 flow. Second operand has 19 states, 19 states have (on average 228.73684210526315) internal successors, (4346), 19 states have internal predecessors, (4346), 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-03-14 23:24:12,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:12,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 306 [2025-03-14 23:24:12,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:13,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true]) [2025-03-14 23:24:13,357 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,357 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,357 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,357 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true]) [2025-03-14 23:24:13,358 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,358 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,358 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,358 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true]) [2025-03-14 23:24:13,359 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,359 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,359 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,359 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true]) [2025-03-14 23:24:13,359 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,359 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,359 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,359 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,361 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true]) [2025-03-14 23:24:13,362 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,362 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,362 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,362 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,362 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,362 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true]) [2025-03-14 23:24:13,362 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,362 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,362 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,362 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,362 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([825] L62-->L65: Formula: (let ((.cse0 (* |v_thread2Thread1of1ForFork2_~i~1#1_9| 4))) (let ((.cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int_66| v_~A~0.base_22) (+ .cse0 v_~A~0.offset_22))) (.cse3 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483648)))) (and (= |v_#memory_int_65| (store |v_#memory_int_66| v_~C~0.base_24 (store (select |v_#memory_int_66| v_~C~0.base_24) (+ v_~C~0.offset_24 .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| (+ .cse1 (select (select |v_#memory_int_66| v_~B~0.base_20) (+ v_~B~0.offset_20 .cse0)))) .cse2 (not (= (ite (or .cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse1)) 1 0) 0)) .cse3 (not (= (ite (or (<= .cse1 |v_thread2Thread1of1ForFork2_plus_#res#1_1|) .cse3) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_9| 1) v_~p~0_11)))) InVars {~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, ~C~0.base=v_~C~0.base_24, #memory_int=|v_#memory_int_66|, ~C~0.offset=v_~C~0.offset_24, ~B~0.offset=v_~B~0.offset_20} OutVars{~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, #memory_int=|v_#memory_int_65|, ~C~0.offset=v_~C~0.offset_24, ~p~0=v_~p~0_11, ~B~0.offset=v_~B~0.offset_20, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][368], [60#L65true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true, 230#L53-2true]) [2025-03-14 23:24:13,363 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true]) [2025-03-14 23:24:13,363 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true]) [2025-03-14 23:24:13,363 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:24:13,363 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:24:13,375 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,375 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,375 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,375 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:24:13,375 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,375 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,375 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,375 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:24:13,375 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,375 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,376 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,376 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:24:13,376 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,376 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,376 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,376 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,377 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 201#L61-5true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:24:13,377 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,378 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,378 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,378 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,378 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,378 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:24:13,378 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,379 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,379 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,379 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,379 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([825] L62-->L65: Formula: (let ((.cse0 (* |v_thread2Thread1of1ForFork2_~i~1#1_9| 4))) (let ((.cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int_66| v_~A~0.base_22) (+ .cse0 v_~A~0.offset_22))) (.cse3 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483648)))) (and (= |v_#memory_int_65| (store |v_#memory_int_66| v_~C~0.base_24 (store (select |v_#memory_int_66| v_~C~0.base_24) (+ v_~C~0.offset_24 .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| (+ .cse1 (select (select |v_#memory_int_66| v_~B~0.base_20) (+ v_~B~0.offset_20 .cse0)))) .cse2 (not (= (ite (or .cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse1)) 1 0) 0)) .cse3 (not (= (ite (or (<= .cse1 |v_thread2Thread1of1ForFork2_plus_#res#1_1|) .cse3) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_9| 1) v_~p~0_11)))) InVars {~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, ~C~0.base=v_~C~0.base_24, #memory_int=|v_#memory_int_66|, ~C~0.offset=v_~C~0.offset_24, ~B~0.offset=v_~B~0.offset_20} OutVars{~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, #memory_int=|v_#memory_int_65|, ~C~0.offset=v_~C~0.offset_24, ~p~0=v_~p~0_11, ~B~0.offset=v_~B~0.offset_20, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][368], [60#L65true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 230#L53-2true]) [2025-03-14 23:24:13,379 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-03-14 23:24:13,379 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:24:13,379 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,379 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:24:13,379 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:24:13,380 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,380 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,380 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,380 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,380 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,380 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:24:13,380 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,380 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,380 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,380 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:24:13,380 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:24:13,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true, 453#true]) [2025-03-14 23:24:13,973 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:24:13,973 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:24:13,973 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:24:13,973 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:24:13,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true, 453#true]) [2025-03-14 23:24:13,973 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:24:13,973 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:24:13,974 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:24:13,974 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:24:13,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true, 453#true]) [2025-03-14 23:24:13,974 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:24:13,974 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:24:13,974 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:24:13,974 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:24:13,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true, 453#true]) [2025-03-14 23:24:13,974 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:24:13,974 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:24:13,974 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:24:13,974 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:24:14,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][411], [1375#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 201#L61-5true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:24:14,010 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,010 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,010 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,010 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][412], [1375#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 201#L61-5true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:24:14,010 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,010 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,010 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,010 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 453#true]) [2025-03-14 23:24:14,011 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 149#L48-5true, 453#true]) [2025-03-14 23:24:14,011 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][411], [1375#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:24:14,011 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,011 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][412], [1375#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:24:14,012 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 453#true]) [2025-03-14 23:24:14,012 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 129#L74true, 453#true]) [2025-03-14 23:24:14,012 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:24:14,012 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:24:14,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 16#L76true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 453#true]) [2025-03-14 23:24:14,046 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-03-14 23:24:14,046 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:14,046 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:14,046 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:24:14,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 16#L76true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 453#true]) [2025-03-14 23:24:14,046 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-03-14 23:24:14,046 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:14,046 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:14,046 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:24:14,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 16#L76true, 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 453#true]) [2025-03-14 23:24:14,047 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-03-14 23:24:14,047 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:24:14,047 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:14,047 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:14,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 16#L76true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 453#true]) [2025-03-14 23:24:14,047 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-03-14 23:24:14,047 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:14,047 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:24:14,047 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:14,253 INFO L124 PetriNetUnfolderBase]: 3788/9065 cut-off events. [2025-03-14 23:24:14,254 INFO L125 PetriNetUnfolderBase]: For 7315/12215 co-relation queries the response was YES. [2025-03-14 23:24:14,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22746 conditions, 9065 events. 3788/9065 cut-off events. For 7315/12215 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 77266 event pairs, 1346 based on Foata normal form. 37/7125 useless extension candidates. Maximal degree in co-relation 14635. Up to 4455 conditions per place. [2025-03-14 23:24:14,308 INFO L140 encePairwiseOnDemand]: 268/306 looper letters, 171 selfloop transitions, 67 changer transitions 90/643 dead transitions. [2025-03-14 23:24:14,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 643 transitions, 3620 flow [2025-03-14 23:24:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 23:24:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 23:24:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4440 transitions. [2025-03-14 23:24:14,314 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7636738906088751 [2025-03-14 23:24:14,315 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 85 predicate places. [2025-03-14 23:24:14,315 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 643 transitions, 3620 flow [2025-03-14 23:24:14,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 228.73684210526315) internal successors, (4346), 19 states have internal predecessors, (4346), 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-03-14 23:24:14,317 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:14,317 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:14,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 23:24:14,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:14,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:14,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:14,519 INFO L85 PathProgramCache]: Analyzing trace with hash 715091524, now seen corresponding path program 1 times [2025-03-14 23:24:14,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:14,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653525557] [2025-03-14 23:24:14,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:14,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:24:14,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:14,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653525557] [2025-03-14 23:24:14,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653525557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:14,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083096134] [2025-03-14 23:24:14,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:14,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:14,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:14,766 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-03-14 23:24:14,767 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-03-14 23:24:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:14,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:24:14,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:24:15,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:24:15,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083096134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:24:15,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:24:15,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-14 23:24:15,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940949570] [2025-03-14 23:24:15,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:24:15,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 23:24:15,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:15,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 23:24:15,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-14 23:24:15,366 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 306 [2025-03-14 23:24:15,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 643 transitions, 3620 flow. Second operand has 19 states, 19 states have (on average 224.8421052631579) internal successors, (4272), 19 states have internal predecessors, (4272), 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-03-14 23:24:15,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:15,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 306 [2025-03-14 23:24:15,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:17,094 INFO L124 PetriNetUnfolderBase]: 3944/8752 cut-off events. [2025-03-14 23:24:17,094 INFO L125 PetriNetUnfolderBase]: For 11237/12236 co-relation queries the response was YES. [2025-03-14 23:24:17,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26029 conditions, 8752 events. 3944/8752 cut-off events. For 11237/12236 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 73660 event pairs, 1666 based on Foata normal form. 5/6951 useless extension candidates. Maximal degree in co-relation 22146. Up to 4066 conditions per place. [2025-03-14 23:24:17,155 INFO L140 encePairwiseOnDemand]: 267/306 looper letters, 157 selfloop transitions, 38 changer transitions 182/668 dead transitions. [2025-03-14 23:24:17,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 668 transitions, 4382 flow [2025-03-14 23:24:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 23:24:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 23:24:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4368 transitions. [2025-03-14 23:24:17,160 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7512899896800825 [2025-03-14 23:24:17,161 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 103 predicate places. [2025-03-14 23:24:17,161 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 668 transitions, 4382 flow [2025-03-14 23:24:17,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 224.8421052631579) internal successors, (4272), 19 states have internal predecessors, (4272), 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-03-14 23:24:17,163 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:17,163 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:17,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 23:24:17,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-14 23:24:17,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:17,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash 704667343, now seen corresponding path program 2 times [2025-03-14 23:24:17,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:17,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827281770] [2025-03-14 23:24:17,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:24:17,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:17,389 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 23:24:17,389 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:17,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:17,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827281770] [2025-03-14 23:24:17,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827281770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:24:17,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:24:17,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 23:24:17,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919801715] [2025-03-14 23:24:17,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:17,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 23:24:17,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:17,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 23:24:17,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 23:24:17,478 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 306 [2025-03-14 23:24:17,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 668 transitions, 4382 flow. Second operand has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 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-03-14 23:24:17,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:17,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 306 [2025-03-14 23:24:17,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:20,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L73-1-->L87: Formula: (<= v_~N~0_6 v_thread3Thread1of1ForFork0_~i~2_3) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][466], [1375#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 70#L61-3true, 1980#true, 312#true, 169#L50-1true, 98#L108-4true, 3537#true]) [2025-03-14 23:24:20,274 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-14 23:24:20,274 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:20,274 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:20,274 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:20,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([834] L73-1-->L74: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][467], [thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 70#L61-3true, 312#true, 1980#true, 169#L50-1true, 98#L108-4true, 3537#true, 129#L74true, 453#true]) [2025-03-14 23:24:20,274 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-14 23:24:20,274 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:20,274 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:20,274 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:20,426 INFO L124 PetriNetUnfolderBase]: 11309/22859 cut-off events. [2025-03-14 23:24:20,427 INFO L125 PetriNetUnfolderBase]: For 40483/44583 co-relation queries the response was YES. [2025-03-14 23:24:20,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76958 conditions, 22859 events. 11309/22859 cut-off events. For 40483/44583 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 213886 event pairs, 3219 based on Foata normal form. 131/19022 useless extension candidates. Maximal degree in co-relation 70013. Up to 9667 conditions per place. [2025-03-14 23:24:20,639 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 253 selfloop transitions, 15 changer transitions 250/901 dead transitions. [2025-03-14 23:24:20,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 901 transitions, 7366 flow [2025-03-14 23:24:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 23:24:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 23:24:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2025-03-14 23:24:20,642 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9161220043572985 [2025-03-14 23:24:20,644 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 108 predicate places. [2025-03-14 23:24:20,644 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 901 transitions, 7366 flow [2025-03-14 23:24:20,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 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-03-14 23:24:20,644 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:20,645 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:20,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 23:24:20,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:20,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:20,647 INFO L85 PathProgramCache]: Analyzing trace with hash 622678003, now seen corresponding path program 3 times [2025-03-14 23:24:20,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:20,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728970991] [2025-03-14 23:24:20,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:24:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:20,675 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 23:24:20,676 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:20,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:20,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728970991] [2025-03-14 23:24:20,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728970991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:24:20,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:24:20,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 23:24:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217262597] [2025-03-14 23:24:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:20,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 23:24:20,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:20,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 23:24:20,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 23:24:20,769 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 306 [2025-03-14 23:24:20,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 901 transitions, 7366 flow. Second operand has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 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-03-14 23:24:20,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:20,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 306 [2025-03-14 23:24:20,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:23,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~minc~0_26 v_~minc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|) (< v_~minc~0_26 .cse0)) (and (= v_~minc~0_25 .cse0) (<= .cse0 v_~minc~0_26)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_26, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_25, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][699], [thread2Thread1of1ForFork2InUse, 99#L82true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 138#L68true, 1980#true, 98#L108-4true, 3546#(= thread3Thread1of1ForFork0_~i~2 1), 230#L53-2true, 453#true]) [2025-03-14 23:24:23,151 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:24:23,151 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:23,151 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:23,151 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:24,725 INFO L124 PetriNetUnfolderBase]: 14837/29787 cut-off events. [2025-03-14 23:24:24,725 INFO L125 PetriNetUnfolderBase]: For 69356/78080 co-relation queries the response was YES. [2025-03-14 23:24:24,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118082 conditions, 29787 events. 14837/29787 cut-off events. For 69356/78080 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 282800 event pairs, 3357 based on Foata normal form. 694/25213 useless extension candidates. Maximal degree in co-relation 100322. Up to 12517 conditions per place. [2025-03-14 23:24:25,196 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 384 selfloop transitions, 26 changer transitions 277/1070 dead transitions. [2025-03-14 23:24:25,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1070 transitions, 10353 flow [2025-03-14 23:24:25,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 23:24:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 23:24:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2025-03-14 23:24:25,200 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9161220043572985 [2025-03-14 23:24:25,201 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 113 predicate places. [2025-03-14 23:24:25,201 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 1070 transitions, 10353 flow [2025-03-14 23:24:25,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 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-03-14 23:24:25,201 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:25,202 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:25,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 23:24:25,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:25,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1982652177, now seen corresponding path program 4 times [2025-03-14 23:24:25,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:25,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494491747] [2025-03-14 23:24:25,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:24:25,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:25,257 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:24:25,257 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 23:24:25,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:25,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494491747] [2025-03-14 23:24:25,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494491747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:25,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549034046] [2025-03-14 23:24:25,646 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:24:25,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:25,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:25,648 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-03-14 23:24:25,650 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-03-14 23:24:25,749 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:24:25,750 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:25,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:24:25,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 23:24:25,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 23:24:26,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549034046] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:26,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:24:26,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 22 [2025-03-14 23:24:26,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743482981] [2025-03-14 23:24:26,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:26,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:24:26,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:26,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:24:26,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-03-14 23:24:26,278 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 306 [2025-03-14 23:24:26,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 1070 transitions, 10353 flow. Second operand has 9 states, 9 states have (on average 227.66666666666666) internal successors, (2049), 9 states have internal predecessors, (2049), 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-03-14 23:24:26,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:26,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 306 [2025-03-14 23:24:26,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:30,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L73-1-->L87: Formula: (<= v_~N~0_6 v_thread3Thread1of1ForFork0_~i~2_3) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][841], [1375#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3539#(= |thread2Thread1of1ForFork2_~i~1#1| 1), 3544#true, 171#L61-4true, 101#L87true, 169#L50-1true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0))]) [2025-03-14 23:24:30,527 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2025-03-14 23:24:30,527 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-14 23:24:30,527 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 23:24:30,527 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-14 23:24:30,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([834] L73-1-->L74: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][842], [thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3539#(= |thread2Thread1of1ForFork2_~i~1#1| 1), 3544#true, 171#L61-4true, 169#L50-1true, 1980#true, 98#L108-4true, 129#L74true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 453#true]) [2025-03-14 23:24:30,527 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2025-03-14 23:24:30,527 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-14 23:24:30,527 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 23:24:30,527 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-14 23:24:30,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L73-1-->L87: Formula: (<= v_~N~0_6 v_thread3Thread1of1ForFork0_~i~2_3) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][841], [1375#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3539#(= |thread2Thread1of1ForFork2_~i~1#1| 1), 3544#true, 101#L87true, 169#L50-1true, 1980#true, 98#L108-4true, 22#L61-2true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0))]) [2025-03-14 23:24:30,568 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 23:24:30,568 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 23:24:30,568 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 23:24:30,568 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 23:24:30,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([834] L73-1-->L74: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][842], [thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3539#(= |thread2Thread1of1ForFork2_~i~1#1| 1), 3544#true, 169#L50-1true, 1980#true, 98#L108-4true, 22#L61-2true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 129#L74true, 453#true]) [2025-03-14 23:24:30,568 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 23:24:30,568 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 23:24:30,568 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 23:24:30,568 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 23:24:30,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L73-1-->L87: Formula: (<= v_~N~0_6 v_thread3Thread1of1ForFork0_~i~2_3) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][806], [1375#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 70#L61-3true, 312#true, 3537#true, 3544#true, 101#L87true, 169#L50-1true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0))]) [2025-03-14 23:24:30,779 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-14 23:24:30,779 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 23:24:30,779 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 23:24:30,779 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 23:24:30,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([834] L73-1-->L74: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][807], [thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 70#L61-3true, 312#true, 3537#true, 3544#true, 169#L50-1true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 129#L74true, 453#true]) [2025-03-14 23:24:30,779 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-14 23:24:30,779 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 23:24:30,779 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 23:24:30,779 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 23:24:30,906 INFO L124 PetriNetUnfolderBase]: 15273/30708 cut-off events. [2025-03-14 23:24:30,906 INFO L125 PetriNetUnfolderBase]: For 90800/101682 co-relation queries the response was YES. [2025-03-14 23:24:31,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135923 conditions, 30708 events. 15273/30708 cut-off events. For 90800/101682 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 289384 event pairs, 2757 based on Foata normal form. 349/25992 useless extension candidates. Maximal degree in co-relation 121354. Up to 12624 conditions per place. [2025-03-14 23:24:31,152 INFO L140 encePairwiseOnDemand]: 272/306 looper letters, 552 selfloop transitions, 24 changer transitions 373/1291 dead transitions. [2025-03-14 23:24:31,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1291 transitions, 14947 flow [2025-03-14 23:24:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 23:24:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 23:24:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2340 transitions. [2025-03-14 23:24:31,155 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2025-03-14 23:24:31,155 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 122 predicate places. [2025-03-14 23:24:31,155 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 1291 transitions, 14947 flow [2025-03-14 23:24:31,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 227.66666666666666) internal successors, (2049), 9 states have internal predecessors, (2049), 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-03-14 23:24:31,156 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:31,156 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:31,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 23:24:31,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:31,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:31,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1553312306, now seen corresponding path program 2 times [2025-03-14 23:24:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624423022] [2025-03-14 23:24:31,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:24:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:31,375 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 23:24:31,375 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:31,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:31,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624423022] [2025-03-14 23:24:31,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624423022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:24:31,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:24:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 23:24:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468754420] [2025-03-14 23:24:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:31,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 23:24:31,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:31,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 23:24:31,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-14 23:24:31,453 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 306 [2025-03-14 23:24:31,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1291 transitions, 14947 flow. Second operand has 6 states, 6 states have (on average 265.1666666666667) internal successors, (1591), 6 states have internal predecessors, (1591), 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-03-14 23:24:31,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:31,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 306 [2025-03-14 23:24:31,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:34,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~minc~0_26 v_~minc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|) (< v_~minc~0_26 .cse0)) (and (= v_~minc~0_25 .cse0) (<= .cse0 v_~minc~0_26)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_26, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_25, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][968], [189#L50-2true, thread2Thread1of1ForFork2InUse, 99#L82true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5214#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 3546#(= thread3Thread1of1ForFork0_~i~2 1), 453#true]) [2025-03-14 23:24:34,396 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-14 23:24:34,396 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-14 23:24:34,396 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:34,396 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-14 23:24:35,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~minc~0_26 v_~minc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|) (< v_~minc~0_26 .cse0)) (and (= v_~minc~0_25 .cse0) (<= .cse0 v_~minc~0_26)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_26, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_25, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][968], [99#L82true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5214#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 3546#(= thread3Thread1of1ForFork0_~i~2 1), 230#L53-2true, 453#true]) [2025-03-14 23:24:35,710 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:24:35,710 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:24:35,710 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:35,710 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:40,861 INFO L124 PetriNetUnfolderBase]: 29824/56938 cut-off events. [2025-03-14 23:24:40,861 INFO L125 PetriNetUnfolderBase]: For 220743/239329 co-relation queries the response was YES. [2025-03-14 23:24:41,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284387 conditions, 56938 events. 29824/56938 cut-off events. For 220743/239329 co-relation queries the response was YES. Maximal size of possible extension queue 2085. Compared 566746 event pairs, 4024 based on Foata normal form. 635/49024 useless extension candidates. Maximal degree in co-relation 255890. Up to 25228 conditions per place. [2025-03-14 23:24:41,451 INFO L140 encePairwiseOnDemand]: 299/306 looper letters, 1053 selfloop transitions, 31 changer transitions 379/1847 dead transitions. [2025-03-14 23:24:41,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 1847 transitions, 25059 flow [2025-03-14 23:24:41,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 23:24:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 23:24:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1665 transitions. [2025-03-14 23:24:41,453 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9068627450980392 [2025-03-14 23:24:41,453 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 127 predicate places. [2025-03-14 23:24:41,453 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 1847 transitions, 25059 flow [2025-03-14 23:24:41,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 265.1666666666667) internal successors, (1591), 6 states have internal predecessors, (1591), 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-03-14 23:24:41,454 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:41,454 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:41,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 23:24:41,454 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:41,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash -838916692, now seen corresponding path program 3 times [2025-03-14 23:24:41,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:41,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581633772] [2025-03-14 23:24:41,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:24:41,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:41,517 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:24:41,517 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:41,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:41,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581633772] [2025-03-14 23:24:41,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581633772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:41,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80758246] [2025-03-14 23:24:41,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:24:41,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:41,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:41,593 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-03-14 23:24:41,593 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-03-14 23:24:41,686 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:24:41,686 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:41,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 23:24:41,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:41,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:41,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80758246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:24:41,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:24:41,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-14 23:24:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138953310] [2025-03-14 23:24:41,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:24:41,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:24:41,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:41,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:24:41,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-14 23:24:41,777 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 306 [2025-03-14 23:24:41,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 1847 transitions, 25059 flow. Second operand has 9 states, 9 states have (on average 265.3333333333333) internal successors, (2388), 9 states have internal predecessors, (2388), 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-03-14 23:24:41,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:41,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 306 [2025-03-14 23:24:41,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:45,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~minc~0_26 v_~minc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|) (< v_~minc~0_26 .cse0)) (and (= v_~minc~0_25 .cse0) (<= .cse0 v_~minc~0_26)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_26, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_25, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][1109], [189#L50-2true, 99#L82true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5214#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 3546#(= thread3Thread1of1ForFork0_~i~2 1), 5220#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 453#true]) [2025-03-14 23:24:45,776 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-14 23:24:45,776 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:45,776 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:45,776 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-14 23:24:47,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~minc~0_26 v_~minc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|) (< v_~minc~0_26 .cse0)) (and (= v_~minc~0_25 .cse0) (<= .cse0 v_~minc~0_26)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_26, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_25, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][1109], [thread2Thread1of1ForFork2InUse, 99#L82true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5214#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 3546#(= thread3Thread1of1ForFork0_~i~2 1), 230#L53-2true, 5220#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 453#true]) [2025-03-14 23:24:47,467 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:24:47,467 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:24:47,467 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:24:47,467 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:51,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~minc~0_26 v_~minc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|) (< v_~minc~0_26 .cse0)) (and (= v_~minc~0_25 .cse0) (<= .cse0 v_~minc~0_26)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_26, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_25, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][1887], [189#L50-2true, thread2Thread1of1ForFork2InUse, 99#L82true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5221#(<= 2 ~N~0), 5211#true, 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 3546#(= thread3Thread1of1ForFork0_~i~2 1), 453#true]) [2025-03-14 23:24:51,813 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-14 23:24:51,813 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:24:51,813 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-14 23:24:51,813 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:24:53,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~minc~0_26 v_~minc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|) (< v_~minc~0_26 .cse0)) (and (= v_~minc~0_25 .cse0) (<= .cse0 v_~minc~0_26)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_26, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_25, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][1887], [thread2Thread1of1ForFork2InUse, 99#L82true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5221#(<= 2 ~N~0), 5211#true, 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 230#L53-2true, 3546#(= thread3Thread1of1ForFork0_~i~2 1), 453#true]) [2025-03-14 23:24:53,514 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-03-14 23:24:53,514 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 23:24:53,514 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 23:24:53,514 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 23:24:55,265 INFO L124 PetriNetUnfolderBase]: 36530/67637 cut-off events. [2025-03-14 23:24:55,266 INFO L125 PetriNetUnfolderBase]: For 330672/353662 co-relation queries the response was YES. [2025-03-14 23:24:55,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391086 conditions, 67637 events. 36530/67637 cut-off events. For 330672/353662 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 672582 event pairs, 2811 based on Foata normal form. 1812/58849 useless extension candidates. Maximal degree in co-relation 376595. Up to 31383 conditions per place. [2025-03-14 23:24:56,099 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 1497 selfloop transitions, 205 changer transitions 431/2517 dead transitions. [2025-03-14 23:24:56,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 2517 transitions, 39514 flow [2025-03-14 23:24:56,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 23:24:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 23:24:56,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3829 transitions. [2025-03-14 23:24:56,102 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8937908496732027 [2025-03-14 23:24:56,103 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 140 predicate places. [2025-03-14 23:24:56,103 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 2517 transitions, 39514 flow [2025-03-14 23:24:56,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 265.3333333333333) internal successors, (2388), 9 states have internal predecessors, (2388), 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-03-14 23:24:56,103 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:56,104 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:56,110 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-03-14 23:24:56,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:56,305 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:56,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:56,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1683638261, now seen corresponding path program 1 times [2025-03-14 23:24:56,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:56,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271622437] [2025-03-14 23:24:56,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:56,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 23:24:56,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:56,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271622437] [2025-03-14 23:24:56,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271622437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:56,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738419338] [2025-03-14 23:24:56,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:56,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:56,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:56,653 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:24:56,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 23:24:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:56,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:24:56,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 23:24:56,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 23:24:57,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738419338] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:57,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:24:57,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2025-03-14 23:24:57,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215641246] [2025-03-14 23:24:57,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:57,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:24:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:57,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:24:57,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-14 23:24:57,153 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 306 [2025-03-14 23:24:57,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 2517 transitions, 39514 flow. Second operand has 9 states, 9 states have (on average 231.55555555555554) internal successors, (2084), 9 states have internal predecessors, (2084), 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-03-14 23:24:57,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:57,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 306 [2025-03-14 23:24:57,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:25:10,429 INFO L124 PetriNetUnfolderBase]: 31458/57870 cut-off events. [2025-03-14 23:25:10,433 INFO L125 PetriNetUnfolderBase]: For 363208/380142 co-relation queries the response was YES. [2025-03-14 23:25:11,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367609 conditions, 57870 events. 31458/57870 cut-off events. For 363208/380142 co-relation queries the response was YES. Maximal size of possible extension queue 2203. Compared 560570 event pairs, 2505 based on Foata normal form. 714/50129 useless extension candidates. Maximal degree in co-relation 332409. Up to 27092 conditions per place. [2025-03-14 23:25:11,566 INFO L140 encePairwiseOnDemand]: 272/306 looper letters, 1272 selfloop transitions, 119 changer transitions 483/2286 dead transitions. [2025-03-14 23:25:11,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 2286 transitions, 39272 flow [2025-03-14 23:25:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 23:25:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 23:25:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2605 transitions. [2025-03-14 23:25:11,568 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7739156268568034 [2025-03-14 23:25:11,570 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 135 predicate places. [2025-03-14 23:25:11,570 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 2286 transitions, 39272 flow [2025-03-14 23:25:11,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 231.55555555555554) internal successors, (2084), 9 states have internal predecessors, (2084), 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-03-14 23:25:11,570 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:25:11,571 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:25:11,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 23:25:11,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-14 23:25:11,772 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:25:11,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:25:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1631214453, now seen corresponding path program 1 times [2025-03-14 23:25:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:25:11,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27859882] [2025-03-14 23:25:11,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:25:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:25:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:25:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 23:25:11,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:25:11,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27859882] [2025-03-14 23:25:11,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27859882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:25:11,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163247778] [2025-03-14 23:25:11,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:25:11,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:25:11,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:25:11,993 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:25:11,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 23:25:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:25:12,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:25:12,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:25:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 23:25:12,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:25:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 23:25:12,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163247778] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:25:12,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:25:12,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2025-03-14 23:25:12,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856611144] [2025-03-14 23:25:12,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:25:12,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:25:12,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:25:12,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:25:12,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-14 23:25:12,658 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 306 [2025-03-14 23:25:12,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 2286 transitions, 39272 flow. Second operand has 9 states, 9 states have (on average 231.66666666666666) internal successors, (2085), 9 states have internal predecessors, (2085), 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-03-14 23:25:12,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:25:12,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 306 [2025-03-14 23:25:12,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:25:25,197 INFO L124 PetriNetUnfolderBase]: 28180/51863 cut-off events. [2025-03-14 23:25:25,197 INFO L125 PetriNetUnfolderBase]: For 448071/466087 co-relation queries the response was YES. [2025-03-14 23:25:25,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357175 conditions, 51863 events. 28180/51863 cut-off events. For 448071/466087 co-relation queries the response was YES. Maximal size of possible extension queue 1868. Compared 493509 event pairs, 2181 based on Foata normal form. 1110/46643 useless extension candidates. Maximal degree in co-relation 344072. Up to 24232 conditions per place. [2025-03-14 23:25:25,890 INFO L140 encePairwiseOnDemand]: 272/306 looper letters, 1137 selfloop transitions, 45 changer transitions 404/2081 dead transitions. [2025-03-14 23:25:25,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 2081 transitions, 38421 flow [2025-03-14 23:25:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 23:25:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 23:25:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2374 transitions. [2025-03-14 23:25:25,892 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7758169934640523 [2025-03-14 23:25:25,892 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 144 predicate places. [2025-03-14 23:25:25,892 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 2081 transitions, 38421 flow [2025-03-14 23:25:25,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 231.66666666666666) internal successors, (2085), 9 states have internal predecessors, (2085), 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-03-14 23:25:25,893 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:25:25,893 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:25:25,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 23:25:26,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:25:26,097 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:25:26,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:25:26,098 INFO L85 PathProgramCache]: Analyzing trace with hash -744202921, now seen corresponding path program 1 times [2025-03-14 23:25:26,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:25:26,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896018654] [2025-03-14 23:25:26,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:25:26,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:25:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:25:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:25:31,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:25:31,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896018654] [2025-03-14 23:25:31,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896018654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:25:31,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037283947] [2025-03-14 23:25:31,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:25:31,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:25:31,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:25:31,817 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:25:31,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 23:25:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:25:32,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-14 23:25:32,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:25:32,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 23:25:32,239 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 23:25:32,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-14 23:25:32,545 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-14 23:25:32,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-14 23:25:33,868 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2025-03-14 23:25:33,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 55 [2025-03-14 23:25:35,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:25:35,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 99 [2025-03-14 23:25:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:25:35,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 23:25:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037283947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:25:35,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 23:25:35,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [74] total 109 [2025-03-14 23:25:35,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175165591] [2025-03-14 23:25:35,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:25:35,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-14 23:25:35,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:25:35,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-14 23:25:35,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=11339, Unknown=0, NotChecked=0, Total=11772 [2025-03-14 23:25:35,437 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 306 [2025-03-14 23:25:35,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 2081 transitions, 38421 flow. Second operand has 45 states, 45 states have (on average 94.04444444444445) internal successors, (4232), 45 states have internal predecessors, (4232), 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-03-14 23:25:35,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:25:35,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 306 [2025-03-14 23:25:35,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:25:45,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 23:25:51,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 23:25:53,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 23:25:57,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 23:25:59,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 23:26:27,865 INFO L124 PetriNetUnfolderBase]: 58633/98642 cut-off events. [2025-03-14 23:26:27,866 INFO L125 PetriNetUnfolderBase]: For 934466/946952 co-relation queries the response was YES. [2025-03-14 23:26:28,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691632 conditions, 98642 events. 58633/98642 cut-off events. For 934466/946952 co-relation queries the response was YES. Maximal size of possible extension queue 2711. Compared 892690 event pairs, 7699 based on Foata normal form. 238/89255 useless extension candidates. Maximal degree in co-relation 642225. Up to 40914 conditions per place. [2025-03-14 23:26:29,295 INFO L140 encePairwiseOnDemand]: 219/306 looper letters, 3092 selfloop transitions, 355 changer transitions 592/4144 dead transitions. [2025-03-14 23:26:29,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 4144 transitions, 81211 flow [2025-03-14 23:26:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-03-14 23:26:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2025-03-14 23:26:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 10865 transitions. [2025-03-14 23:26:29,323 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.3198787022316434 [2025-03-14 23:26:29,327 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 254 predicate places. [2025-03-14 23:26:29,327 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 4144 transitions, 81211 flow [2025-03-14 23:26:29,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 94.04444444444445) internal successors, (4232), 45 states have internal predecessors, (4232), 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-03-14 23:26:29,329 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:26:29,330 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:26:29,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 23:26:29,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:26:29,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:26:29,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:26:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash 863056769, now seen corresponding path program 2 times [2025-03-14 23:26:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:26:29,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494066455] [2025-03-14 23:26:29,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:26:29,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:26:29,638 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:26:29,639 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:26:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 23:26:34,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:26:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494066455] [2025-03-14 23:26:34,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494066455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:26:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085687027] [2025-03-14 23:26:34,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:26:34,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:26:34,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:26:34,876 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:26:34,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 23:26:34,985 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:26:34,985 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:26:34,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-14 23:26:34,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:26:35,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 23:26:35,130 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 23:26:35,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-14 23:26:35,421 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-14 23:26:35,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-14 23:26:37,600 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-03-14 23:26:37,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 49 [2025-03-14 23:26:39,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:26:39,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 63 [2025-03-14 23:26:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 23:26:39,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:26:44,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:26:44,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 208 treesize of output 184 [2025-03-14 23:26:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:26:47,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085687027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:26:47,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:26:47,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 47, 45] total 112 [2025-03-14 23:26:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078037250] [2025-03-14 23:26:47,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:26:47,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2025-03-14 23:26:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:26:47,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2025-03-14 23:26:47,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=11862, Unknown=0, NotChecked=0, Total=12432 [2025-03-14 23:26:47,177 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 306 [2025-03-14 23:26:47,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 4144 transitions, 81211 flow. Second operand has 112 states, 112 states have (on average 72.76785714285714) internal successors, (8150), 112 states have internal predecessors, (8150), 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-03-14 23:26:47,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:26:47,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 306 [2025-03-14 23:26:47,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:28:38,985 INFO L124 PetriNetUnfolderBase]: 85796/146466 cut-off events. [2025-03-14 23:28:38,985 INFO L125 PetriNetUnfolderBase]: For 1504221/1519845 co-relation queries the response was YES. [2025-03-14 23:28:39,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120506 conditions, 146466 events. 85796/146466 cut-off events. For 1504221/1519845 co-relation queries the response was YES. Maximal size of possible extension queue 3990. Compared 1426720 event pairs, 6613 based on Foata normal form. 293/131528 useless extension candidates. Maximal degree in co-relation 1051559. Up to 57851 conditions per place. [2025-03-14 23:28:41,209 INFO L140 encePairwiseOnDemand]: 207/306 looper letters, 6497 selfloop transitions, 1516 changer transitions 817/8893 dead transitions. [2025-03-14 23:28:41,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 796 places, 8893 transitions, 188461 flow [2025-03-14 23:28:41,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2025-03-14 23:28:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2025-03-14 23:28:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 19018 transitions. [2025-03-14 23:28:41,229 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.25060615644107104 [2025-03-14 23:28:41,230 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 501 predicate places. [2025-03-14 23:28:41,230 INFO L471 AbstractCegarLoop]: Abstraction has has 796 places, 8893 transitions, 188461 flow [2025-03-14 23:28:41,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 72.76785714285714) internal successors, (8150), 112 states have internal predecessors, (8150), 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-03-14 23:28:41,233 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:28:41,233 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:28:41,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-14 23:28:41,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-14 23:28:41,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:28:41,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:28:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1700554355, now seen corresponding path program 3 times [2025-03-14 23:28:41,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:28:41,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739860675] [2025-03-14 23:28:41,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:28:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:28:41,492 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:28:41,492 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:28:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:28:45,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:28:45,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739860675] [2025-03-14 23:28:45,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739860675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:28:45,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634744595] [2025-03-14 23:28:45,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:28:45,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:28:45,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:28:45,817 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:28:45,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-14 23:28:45,916 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:28:45,916 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:28:45,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-14 23:28:45,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:28:45,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 23:28:46,254 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 23:28:46,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-14 23:28:46,790 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-14 23:28:46,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-14 23:28:49,255 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-03-14 23:28:49,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 49 [2025-03-14 23:28:50,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:28:50,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 63 [2025-03-14 23:28:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:28:50,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:28:56,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:28:56,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 115 [2025-03-14 23:28:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:28:58,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634744595] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:28:58,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:28:58,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 45, 45] total 122 [2025-03-14 23:28:58,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722445358] [2025-03-14 23:28:58,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:28:58,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2025-03-14 23:28:58,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:28:58,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2025-03-14 23:28:58,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=625, Invalid=14137, Unknown=0, NotChecked=0, Total=14762 [2025-03-14 23:28:58,939 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 306 [2025-03-14 23:28:58,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 796 places, 8893 transitions, 188461 flow. Second operand has 122 states, 122 states have (on average 88.56557377049181) internal successors, (10805), 122 states have internal predecessors, (10805), 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-03-14 23:28:58,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:28:58,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 306 [2025-03-14 23:28:58,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:33:28,199 INFO L124 PetriNetUnfolderBase]: 117951/201803 cut-off events. [2025-03-14 23:33:28,199 INFO L125 PetriNetUnfolderBase]: For 2254903/2278522 co-relation queries the response was YES. [2025-03-14 23:33:29,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712922 conditions, 201803 events. 117951/201803 cut-off events. For 2254903/2278522 co-relation queries the response was YES. Maximal size of possible extension queue 5209. Compared 2030597 event pairs, 3764 based on Foata normal form. 1357/181193 useless extension candidates. Maximal degree in co-relation 1608752. Up to 78525 conditions per place. [2025-03-14 23:33:31,387 INFO L140 encePairwiseOnDemand]: 211/306 looper letters, 10987 selfloop transitions, 2440 changer transitions 1222/14749 dead transitions. [2025-03-14 23:33:31,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1070 places, 14749 transitions, 339581 flow [2025-03-14 23:33:31,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 275 states. [2025-03-14 23:33:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2025-03-14 23:33:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 25655 transitions. [2025-03-14 23:33:31,411 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.3048722519310755 [2025-03-14 23:33:31,411 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 775 predicate places. [2025-03-14 23:33:31,411 INFO L471 AbstractCegarLoop]: Abstraction has has 1070 places, 14749 transitions, 339581 flow [2025-03-14 23:33:31,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 88.56557377049181) internal successors, (10805), 122 states have internal predecessors, (10805), 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-03-14 23:33:31,414 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:33:31,414 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:33:31,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-14 23:33:31,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-14 23:33:31,615 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:33:31,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:33:31,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1342498313, now seen corresponding path program 4 times [2025-03-14 23:33:31,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:33:31,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560381022] [2025-03-14 23:33:31,616 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:33:31,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:33:31,647 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:33:31,647 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:33:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 23:33:34,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:33:34,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560381022] [2025-03-14 23:33:34,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560381022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:33:34,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780629858] [2025-03-14 23:33:34,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:33:34,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:33:34,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:33:34,253 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:33:34,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-14 23:33:34,354 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:33:34,354 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:33:34,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-14 23:33:34,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:33:37,147 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2025-03-14 23:33:37,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 75 [2025-03-14 23:33:40,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:33:40,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 1 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 290 treesize of output 594 [2025-03-14 23:35:48,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2025-03-14 23:35:48,597 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-14 23:35:48,598 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-14 23:35:48,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-14 23:35:48,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 23:35:48,801 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:518) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:404) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 67 more [2025-03-14 23:35:48,806 INFO L158 Benchmark]: Toolchain (without parser) took 702612.22ms. Allocated memory was 71.3MB in the beginning and 5.3GB in the end (delta: 5.3GB). Free memory was 44.4MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 5.9GB. Max. memory is 8.0GB. [2025-03-14 23:35:48,806 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 71.3MB. Free memory is still 33.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:35:48,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.86ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 31.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 23:35:48,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.12ms. Allocated memory is still 71.3MB. Free memory was 31.7MB in the beginning and 29.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 23:35:48,807 INFO L158 Benchmark]: Boogie Preprocessor took 40.44ms. Allocated memory is still 71.3MB. Free memory was 29.5MB in the beginning and 27.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:35:48,807 INFO L158 Benchmark]: RCFGBuilder took 549.68ms. Allocated memory is still 71.3MB. Free memory was 27.9MB in the beginning and 21.4MB in the end (delta: 6.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2025-03-14 23:35:48,807 INFO L158 Benchmark]: TraceAbstraction took 701753.44ms. Allocated memory was 71.3MB in the beginning and 5.3GB in the end (delta: 5.3GB). Free memory was 20.1MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 5.9GB. Max. memory is 8.0GB. [2025-03-14 23:35:48,808 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.31ms. Allocated memory is still 71.3MB. Free memory is still 33.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.86ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 31.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.12ms. Allocated memory is still 71.3MB. Free memory was 31.7MB in the beginning and 29.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.44ms. Allocated memory is still 71.3MB. Free memory was 29.5MB in the beginning and 27.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 549.68ms. Allocated memory is still 71.3MB. Free memory was 27.9MB in the beginning and 21.4MB in the end (delta: 6.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 701753.44ms. Allocated memory was 71.3MB in the beginning and 5.3GB in the end (delta: 5.3GB). Free memory was 20.1MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 5.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...