/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-bad-buffer-mult-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:43:36,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:43:36,641 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 22:43:36,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:43:36,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:43:36,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:43:36,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:43:36,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:43:36,672 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:43:36,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:43:36,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:43:36,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:43:36,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:43:36,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:43:36,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:43:36,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:43:36,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:43:36,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:43:36,674 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 22:43:36,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:43:36,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:43:36,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:43:36,922 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:43:36,922 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:43:36,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-14 22:43:38,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a072dfe56/ab27df8ca6c84ff884f2882bce4cbb10/FLAG1614c3e54 [2025-03-14 22:43:38,251 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:43:38,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-14 22:43:38,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a072dfe56/ab27df8ca6c84ff884f2882bce4cbb10/FLAG1614c3e54 [2025-03-14 22:43:38,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a072dfe56/ab27df8ca6c84ff884f2882bce4cbb10 [2025-03-14 22:43:38,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:43:38,639 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:43:38,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:43:38,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:43:38,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:43:38,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e28fe3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38, skipping insertion in model container [2025-03-14 22:43:38,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:43:38,768 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-bad-buffer-mult-alt.wvr.c[4345,4358] [2025-03-14 22:43:38,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:43:38,782 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:43:38,797 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-bad-buffer-mult-alt.wvr.c[4345,4358] [2025-03-14 22:43:38,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:43:38,810 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:43:38,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38 WrapperNode [2025-03-14 22:43:38,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:43:38,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:43:38,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:43:38,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:43:38,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,852 INFO L138 Inliner]: procedures = 25, calls = 59, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 293 [2025-03-14 22:43:38,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:43:38,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:43:38,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:43:38,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:43:38,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,880 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:43:38,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:43:38,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:43:38,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:43:38,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (1/1) ... [2025-03-14 22:43:38,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:43:38,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:43:38,924 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 22:43:38,929 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 22:43:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:43:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:43:38,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:43:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:43:38,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:43:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 22:43:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 22:43:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-14 22:43:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-14 22:43:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:43:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 22:43:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 22:43:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 22:43:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 22:43:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:43:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:43:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 22:43:38,947 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 22:43:39,021 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:43:39,023 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:43:39,352 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:43:39,352 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:43:39,471 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:43:39,471 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 22:43:39,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:43:39 BoogieIcfgContainer [2025-03-14 22:43:39,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:43:39,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:43:39,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:43:39,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:43:39,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:43:38" (1/3) ... [2025-03-14 22:43:39,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2116b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:43:39, skipping insertion in model container [2025-03-14 22:43:39,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:43:38" (2/3) ... [2025-03-14 22:43:39,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2116b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:43:39, skipping insertion in model container [2025-03-14 22:43:39,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:43:39" (3/3) ... [2025-03-14 22:43:39,482 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-03-14 22:43:39,492 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:43:39,493 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt.wvr.c that has 5 procedures, 226 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-14 22:43:39,493 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:43:39,550 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 22:43:39,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:43:39,603 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;@28ff21d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:43:39,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 22:43:39,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:43:39,672 INFO L124 PetriNetUnfolderBase]: 13/228 cut-off events. [2025-03-14 22:43:39,673 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 22:43:39,674 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:43:39,674 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] [2025-03-14 22:43:39,674 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 2 more)] === [2025-03-14 22:43:39,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:43:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1093903820, now seen corresponding path program 1 times [2025-03-14 22:43:39,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:43:39,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471796660] [2025-03-14 22:43:39,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:43:39,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:43:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:43:40,688 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 22:43:40,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:43:40,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471796660] [2025-03-14 22:43:40,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471796660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:43:40,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:43:40,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:43:40,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296360346] [2025-03-14 22:43:40,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:43:40,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:43:40,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:43:40,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:43:40,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:43:40,720 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 238 [2025-03-14 22:43:40,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 238 transitions, 504 flow. Second operand has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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 22:43:40,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:43:40,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 238 [2025-03-14 22:43:40,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:43:41,363 INFO L124 PetriNetUnfolderBase]: 1171/2303 cut-off events. [2025-03-14 22:43:41,363 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2025-03-14 22:43:41,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 2303 events. 1171/2303 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13582 event pairs, 329 based on Foata normal form. 8/2080 useless extension candidates. Maximal degree in co-relation 3843. Up to 727 conditions per place. [2025-03-14 22:43:41,395 INFO L140 encePairwiseOnDemand]: 216/238 looper letters, 92 selfloop transitions, 8 changer transitions 7/257 dead transitions. [2025-03-14 22:43:41,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 257 transitions, 785 flow [2025-03-14 22:43:41,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:43:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:43:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1697 transitions. [2025-03-14 22:43:41,413 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7130252100840336 [2025-03-14 22:43:41,415 INFO L298 CegarLoopForPetriNet]: 238 programPoint places, 0 predicate places. [2025-03-14 22:43:41,415 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 257 transitions, 785 flow [2025-03-14 22:43:41,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 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 22:43:41,416 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:43:41,416 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] [2025-03-14 22:43:41,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:43:41,417 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 2 more)] === [2025-03-14 22:43:41,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:43:41,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1210289533, now seen corresponding path program 1 times [2025-03-14 22:43:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:43:41,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519147665] [2025-03-14 22:43:41,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:43:41,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:43:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:43:41,666 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 22:43:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:43:41,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519147665] [2025-03-14 22:43:41,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519147665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:43:41,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:43:41,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:43:41,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314830468] [2025-03-14 22:43:41,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:43:41,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:43:41,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:43:41,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:43:41,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:43:41,671 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 238 [2025-03-14 22:43:41,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 257 transitions, 785 flow. Second operand has 6 states, 6 states have (on average 189.66666666666666) internal successors, (1138), 6 states have internal predecessors, (1138), 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 22:43:41,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:43:41,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 238 [2025-03-14 22:43:41,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:43:42,133 INFO L124 PetriNetUnfolderBase]: 1341/2776 cut-off events. [2025-03-14 22:43:42,134 INFO L125 PetriNetUnfolderBase]: For 1489/1744 co-relation queries the response was YES. [2025-03-14 22:43:42,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6559 conditions, 2776 events. 1341/2776 cut-off events. For 1489/1744 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16834 event pairs, 389 based on Foata normal form. 57/2554 useless extension candidates. Maximal degree in co-relation 4925. Up to 1181 conditions per place. [2025-03-14 22:43:42,152 INFO L140 encePairwiseOnDemand]: 226/238 looper letters, 70 selfloop transitions, 8 changer transitions 41/295 dead transitions. [2025-03-14 22:43:42,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 295 transitions, 1146 flow [2025-03-14 22:43:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 22:43:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 22:43:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1736 transitions. [2025-03-14 22:43:42,155 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8104575163398693 [2025-03-14 22:43:42,156 INFO L298 CegarLoopForPetriNet]: 238 programPoint places, 8 predicate places. [2025-03-14 22:43:42,156 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 295 transitions, 1146 flow [2025-03-14 22:43:42,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.66666666666666) internal successors, (1138), 6 states have internal predecessors, (1138), 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 22:43:42,156 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:43:42,156 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] [2025-03-14 22:43:42,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:43:42,157 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 2 more)] === [2025-03-14 22:43:42,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:43:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1661436513, now seen corresponding path program 1 times [2025-03-14 22:43:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:43:42,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732695966] [2025-03-14 22:43:42,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:43:42,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:43:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:43:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:43:42,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:43:42,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732695966] [2025-03-14 22:43:42,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732695966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:43:42,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:43:42,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:43:42,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416334594] [2025-03-14 22:43:42,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:43:42,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:43:42,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:43:42,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:43:42,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:43:42,554 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 238 [2025-03-14 22:43:42,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 295 transitions, 1146 flow. Second operand has 7 states, 7 states have (on average 153.28571428571428) internal successors, (1073), 7 states have internal predecessors, (1073), 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 22:43:42,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:43:42,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 238 [2025-03-14 22:43:42,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:43:43,603 INFO L124 PetriNetUnfolderBase]: 4570/7480 cut-off events. [2025-03-14 22:43:43,604 INFO L125 PetriNetUnfolderBase]: For 5343/6803 co-relation queries the response was YES. [2025-03-14 22:43:43,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22810 conditions, 7480 events. 4570/7480 cut-off events. For 5343/6803 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 47790 event pairs, 382 based on Foata normal form. 68/7189 useless extension candidates. Maximal degree in co-relation 16839. Up to 3505 conditions per place. [2025-03-14 22:43:43,685 INFO L140 encePairwiseOnDemand]: 222/238 looper letters, 211 selfloop transitions, 17 changer transitions 58/425 dead transitions. [2025-03-14 22:43:43,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 425 transitions, 2485 flow [2025-03-14 22:43:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 22:43:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 22:43:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1435 transitions. [2025-03-14 22:43:43,688 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6699346405228758 [2025-03-14 22:43:43,688 INFO L298 CegarLoopForPetriNet]: 238 programPoint places, 16 predicate places. [2025-03-14 22:43:43,689 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 425 transitions, 2485 flow [2025-03-14 22:43:43,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 153.28571428571428) internal successors, (1073), 7 states have internal predecessors, (1073), 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 22:43:43,689 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:43:43,689 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] [2025-03-14 22:43:43,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 22:43:43,690 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 2 more)] === [2025-03-14 22:43:43,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:43:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1947721440, now seen corresponding path program 1 times [2025-03-14 22:43:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:43:43,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311607537] [2025-03-14 22:43:43,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:43:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:43:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:43:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:43:44,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:43:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311607537] [2025-03-14 22:43:44,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311607537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:43:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040753580] [2025-03-14 22:43:44,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:43:44,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:43:44,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:43:44,994 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 22:43:44,996 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 22:43:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:43:45,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-14 22:43:45,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:43:45,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-14 22:43:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:43:45,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:43:45,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:43:45,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-14 22:43:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:43:46,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040753580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:43:46,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:43:46,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 10] total 31 [2025-03-14 22:43:46,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117929350] [2025-03-14 22:43:46,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:43:46,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-14 22:43:46,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:43:46,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-14 22:43:46,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2025-03-14 22:43:46,041 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 238 [2025-03-14 22:43:46,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 425 transitions, 2485 flow. Second operand has 31 states, 31 states have (on average 104.74193548387096) internal successors, (3247), 31 states have internal predecessors, (3247), 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 22:43:46,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:43:46,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 238 [2025-03-14 22:43:46,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:43:49,029 INFO L124 PetriNetUnfolderBase]: 9057/16096 cut-off events. [2025-03-14 22:43:49,029 INFO L125 PetriNetUnfolderBase]: For 21026/28284 co-relation queries the response was YES. [2025-03-14 22:43:49,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58580 conditions, 16096 events. 9057/16096 cut-off events. For 21026/28284 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 129363 event pairs, 679 based on Foata normal form. 133/15126 useless extension candidates. Maximal degree in co-relation 32616. Up to 7291 conditions per place. [2025-03-14 22:43:49,163 INFO L140 encePairwiseOnDemand]: 199/238 looper letters, 544 selfloop transitions, 95 changer transitions 91/828 dead transitions. [2025-03-14 22:43:49,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 828 transitions, 7017 flow [2025-03-14 22:43:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-14 22:43:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-14 22:43:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 4857 transitions. [2025-03-14 22:43:49,172 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4342034686214912 [2025-03-14 22:43:49,174 INFO L298 CegarLoopForPetriNet]: 238 programPoint places, 62 predicate places. [2025-03-14 22:43:49,174 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 828 transitions, 7017 flow [2025-03-14 22:43:49,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 104.74193548387096) internal successors, (3247), 31 states have internal predecessors, (3247), 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 22:43:49,175 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:43:49,175 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] [2025-03-14 22:43:49,183 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 22:43:49,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:43:49,376 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 2 more)] === [2025-03-14 22:43:49,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:43:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash 130675296, now seen corresponding path program 1 times [2025-03-14 22:43:49,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:43:49,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140978639] [2025-03-14 22:43:49,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:43:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:43:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:43:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:43:49,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:43:49,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140978639] [2025-03-14 22:43:49,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140978639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:43:49,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:43:49,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:43:49,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324326087] [2025-03-14 22:43:49,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:43:49,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:43:49,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:43:49,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:43:49,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:43:49,576 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 238 [2025-03-14 22:43:49,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 828 transitions, 7017 flow. Second operand has 6 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 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 22:43:49,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:43:49,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 238 [2025-03-14 22:43:49,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:43:52,126 INFO L124 PetriNetUnfolderBase]: 11047/20008 cut-off events. [2025-03-14 22:43:52,126 INFO L125 PetriNetUnfolderBase]: For 48422/58700 co-relation queries the response was YES. [2025-03-14 22:43:52,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80777 conditions, 20008 events. 11047/20008 cut-off events. For 48422/58700 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 167370 event pairs, 690 based on Foata normal form. 821/19457 useless extension candidates. Maximal degree in co-relation 42871. Up to 8516 conditions per place. [2025-03-14 22:43:52,270 INFO L140 encePairwiseOnDemand]: 226/238 looper letters, 540 selfloop transitions, 22 changer transitions 118/999 dead transitions. [2025-03-14 22:43:52,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 999 transitions, 10227 flow [2025-03-14 22:43:52,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 22:43:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 22:43:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1723 transitions. [2025-03-14 22:43:52,273 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8043884220354809 [2025-03-14 22:43:52,274 INFO L298 CegarLoopForPetriNet]: 238 programPoint places, 70 predicate places. [2025-03-14 22:43:52,274 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 999 transitions, 10227 flow [2025-03-14 22:43:52,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 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 22:43:52,274 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:43:52,275 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:43:52,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 22:43:52,275 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 2 more)] === [2025-03-14 22:43:52,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:43:52,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1098216549, now seen corresponding path program 2 times [2025-03-14 22:43:52,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:43:52,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717520985] [2025-03-14 22:43:52,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:43:52,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:43:52,307 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:43:52,308 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:43:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:43:52,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:43:52,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717520985] [2025-03-14 22:43:52,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717520985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:43:52,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425360239] [2025-03-14 22:43:52,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:43:52,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:43:52,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:43:52,539 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 22:43:52,541 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 22:43:52,636 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:43:52,636 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:43:52,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-14 22:43:52,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:43:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:43:52,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:43:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:43:53,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425360239] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:43:53,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:43:53,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2025-03-14 22:43:53,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693659675] [2025-03-14 22:43:53,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:43:53,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 22:43:53,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:43:53,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 22:43:53,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-14 22:43:53,121 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 238 [2025-03-14 22:43:53,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 999 transitions, 10227 flow. Second operand has 20 states, 20 states have (on average 179.0) internal successors, (3580), 20 states have internal predecessors, (3580), 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 22:43:53,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:43:53,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 238 [2025-03-14 22:43:53,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:43:57,130 INFO L124 PetriNetUnfolderBase]: 14876/27829 cut-off events. [2025-03-14 22:43:57,130 INFO L125 PetriNetUnfolderBase]: For 93646/111758 co-relation queries the response was YES. [2025-03-14 22:43:57,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121144 conditions, 27829 events. 14876/27829 cut-off events. For 93646/111758 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 250393 event pairs, 1145 based on Foata normal form. 623/26364 useless extension candidates. Maximal degree in co-relation 49476. Up to 12243 conditions per place. [2025-03-14 22:43:57,378 INFO L140 encePairwiseOnDemand]: 218/238 looper letters, 670 selfloop transitions, 50 changer transitions 207/1208 dead transitions. [2025-03-14 22:43:57,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1208 transitions, 14645 flow [2025-03-14 22:43:57,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 22:43:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 22:43:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4537 transitions. [2025-03-14 22:43:57,383 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7625210084033613 [2025-03-14 22:43:57,384 INFO L298 CegarLoopForPetriNet]: 238 programPoint places, 94 predicate places. [2025-03-14 22:43:57,384 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 1208 transitions, 14645 flow [2025-03-14 22:43:57,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 179.0) internal successors, (3580), 20 states have internal predecessors, (3580), 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 22:43:57,385 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:43:57,385 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] [2025-03-14 22:43:57,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 22:43:57,585 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,SelfDestructingSolverStorable5 [2025-03-14 22:43:57,586 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 2 more)] === [2025-03-14 22:43:57,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:43:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1742135286, now seen corresponding path program 1 times [2025-03-14 22:43:57,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:43:57,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662254940] [2025-03-14 22:43:57,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:43:57,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:43:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:43:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 22:43:57,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:43:57,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662254940] [2025-03-14 22:43:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662254940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:43:57,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132963528] [2025-03-14 22:43:57,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:43:57,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:43:57,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:43:57,821 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 22:43:57,822 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 22:43:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:43:57,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 22:43:57,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:43:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:43:58,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:43:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:43:58,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132963528] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:43:58,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:43:58,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 11] total 19 [2025-03-14 22:43:58,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372612735] [2025-03-14 22:43:58,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:43:58,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:43:58,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:43:58,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:43:58,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 22:43:58,657 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 238 [2025-03-14 22:43:58,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 1208 transitions, 14645 flow. Second operand has 7 states, 7 states have (on average 199.28571428571428) internal successors, (1395), 7 states have internal predecessors, (1395), 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 22:43:58,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:43:58,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 238 [2025-03-14 22:43:58,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:44:26,262 INFO L124 PetriNetUnfolderBase]: 110615/181699 cut-off events. [2025-03-14 22:44:26,262 INFO L125 PetriNetUnfolderBase]: For 891666/925832 co-relation queries the response was YES. [2025-03-14 22:44:27,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793430 conditions, 181699 events. 110615/181699 cut-off events. For 891666/925832 co-relation queries the response was YES. Maximal size of possible extension queue 6057. Compared 1779836 event pairs, 7818 based on Foata normal form. 285/152949 useless extension candidates. Maximal degree in co-relation 309377. Up to 61560 conditions per place. [2025-03-14 22:44:28,390 INFO L140 encePairwiseOnDemand]: 225/238 looper letters, 2847 selfloop transitions, 277 changer transitions 846/4241 dead transitions. [2025-03-14 22:44:28,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 4241 transitions, 65190 flow [2025-03-14 22:44:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 22:44:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 22:44:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1703 transitions. [2025-03-14 22:44:28,392 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8944327731092437 [2025-03-14 22:44:28,393 INFO L298 CegarLoopForPetriNet]: 238 programPoint places, 101 predicate places. [2025-03-14 22:44:28,393 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 4241 transitions, 65190 flow [2025-03-14 22:44:28,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 199.28571428571428) internal successors, (1395), 7 states have internal predecessors, (1395), 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 22:44:28,393 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:44:28,393 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] [2025-03-14 22:44:28,399 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 22:44:28,594 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 22:44:28,594 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 2 more)] === [2025-03-14 22:44:28,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:44:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash 382338124, now seen corresponding path program 2 times [2025-03-14 22:44:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:44:28,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201307892] [2025-03-14 22:44:28,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:44:28,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:44:28,614 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:44:28,614 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:44:28,762 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 22:44:28,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:44:28,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201307892] [2025-03-14 22:44:28,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201307892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:44:28,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:44:28,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:44:28,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916109583] [2025-03-14 22:44:28,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:44:28,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:44:28,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:44:28,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:44:28,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:44:28,764 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 238 [2025-03-14 22:44:28,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 4241 transitions, 65190 flow. Second operand has 7 states, 7 states have (on average 167.57142857142858) internal successors, (1173), 7 states have internal predecessors, (1173), 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 22:44:28,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:44:28,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 238 [2025-03-14 22:44:28,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:45:27,447 INFO L124 PetriNetUnfolderBase]: 154097/250340 cut-off events. [2025-03-14 22:45:27,447 INFO L125 PetriNetUnfolderBase]: For 1643150/1805583 co-relation queries the response was YES. [2025-03-14 22:45:28,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209910 conditions, 250340 events. 154097/250340 cut-off events. For 1643150/1805583 co-relation queries the response was YES. Maximal size of possible extension queue 7829. Compared 2484814 event pairs, 9198 based on Foata normal form. 1409/212584 useless extension candidates. Maximal degree in co-relation 494964. Up to 98497 conditions per place. [2025-03-14 22:45:30,261 INFO L140 encePairwiseOnDemand]: 225/238 looper letters, 3621 selfloop transitions, 731 changer transitions 868/5787 dead transitions. [2025-03-14 22:45:30,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 5787 transitions, 101389 flow [2025-03-14 22:45:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 22:45:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 22:45:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1547 transitions. [2025-03-14 22:45:30,262 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-03-14 22:45:30,263 INFO L298 CegarLoopForPetriNet]: 238 programPoint places, 107 predicate places. [2025-03-14 22:45:30,263 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 5787 transitions, 101389 flow [2025-03-14 22:45:30,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 167.57142857142858) internal successors, (1173), 7 states have internal predecessors, (1173), 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 22:45:30,263 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:45:30,264 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:45:30,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 22:45:30,264 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 2 more)] === [2025-03-14 22:45:30,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:45:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1095042393, now seen corresponding path program 3 times [2025-03-14 22:45:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:45:30,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511577141] [2025-03-14 22:45:30,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:45:30,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:45:30,297 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:45:30,297 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:45:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:45:30,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:45:30,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511577141] [2025-03-14 22:45:30,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511577141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:45:30,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:45:30,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:45:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007781836] [2025-03-14 22:45:30,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:45:30,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:45:30,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:45:30,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:45:30,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:45:30,487 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 238 [2025-03-14 22:45:30,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 5787 transitions, 101389 flow. Second operand has 7 states, 7 states have (on average 155.71428571428572) internal successors, (1090), 7 states have internal predecessors, (1090), 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 22:45:30,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:45:30,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 238 [2025-03-14 22:45:30,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:47:47,068 INFO L124 PetriNetUnfolderBase]: 251401/406408 cut-off events. [2025-03-14 22:47:47,071 INFO L125 PetriNetUnfolderBase]: For 3296836/3388575 co-relation queries the response was YES. [2025-03-14 22:47:49,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157341 conditions, 406408 events. 251401/406408 cut-off events. For 3296836/3388575 co-relation queries the response was YES. Maximal size of possible extension queue 12206. Compared 4219002 event pairs, 14288 based on Foata normal form. 3659/345447 useless extension candidates. Maximal degree in co-relation 961644. Up to 158948 conditions per place. [2025-03-14 22:47:52,093 INFO L140 encePairwiseOnDemand]: 226/238 looper letters, 6936 selfloop transitions, 800 changer transitions 1212/9173 dead transitions. [2025-03-14 22:47:52,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 9173 transitions, 180303 flow [2025-03-14 22:47:52,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:47:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:47:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1599 transitions. [2025-03-14 22:47:52,095 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6718487394957983 [2025-03-14 22:47:52,095 INFO L298 CegarLoopForPetriNet]: 238 programPoint places, 115 predicate places. [2025-03-14 22:47:52,096 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 9173 transitions, 180303 flow [2025-03-14 22:47:52,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.71428571428572) internal successors, (1090), 7 states have internal predecessors, (1090), 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 22:47:52,096 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:47:52,096 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] [2025-03-14 22:47:52,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 22:47:52,096 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 2 more)] === [2025-03-14 22:47:52,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:47:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1464885145, now seen corresponding path program 1 times [2025-03-14 22:47:52,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:47:52,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303237207] [2025-03-14 22:47:52,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:47:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:47:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:47:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 22:47:52,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:47:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303237207] [2025-03-14 22:47:52,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303237207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:47:52,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:47:52,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:47:52,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666488705] [2025-03-14 22:47:52,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:47:52,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:47:52,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:47:52,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:47:52,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:47:52,272 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 238 [2025-03-14 22:47:52,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 9173 transitions, 180303 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 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 22:47:52,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:47:52,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 238 [2025-03-14 22:47:52,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand