/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/parallel-parallel-sum-1-dsl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:39:21,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:39:21,091 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:39:21,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:39:21,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:39:21,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:39:21,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:39:21,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:39:21,133 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:39:21,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:39:21,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:39:21,133 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:39:21,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:39:21,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:39:21,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:39:21,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:39:21,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:39:21,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:39:21,134 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:39:21,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:39:21,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:39:21,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:39:21,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:39:21,134 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:39:21,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:39:21,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:39:21,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:39:21,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:39:21,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:39:21,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:39:21,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:39:21,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:39:21,138 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:39:21,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:39:21,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:39:21,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:39:21,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:39:21,364 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:39:21,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2025-03-14 22:39:22,572 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e09cd7e/c69235e58a8a4740be8510c678832e9a/FLAG0a2a5255c [2025-03-14 22:39:22,712 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:39:22,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2025-03-14 22:39:22,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e09cd7e/c69235e58a8a4740be8510c678832e9a/FLAG0a2a5255c [2025-03-14 22:39:23,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e09cd7e/c69235e58a8a4740be8510c678832e9a [2025-03-14 22:39:23,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:39:23,121 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:39:23,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:39:23,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:39:23,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:39:23,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5ee21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23, skipping insertion in model container [2025-03-14 22:39:23,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:39:23,241 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/parallel-parallel-sum-1-dsl.wvr.c[4450,4463] [2025-03-14 22:39:23,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:39:23,258 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:39:23,277 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/parallel-parallel-sum-1-dsl.wvr.c[4450,4463] [2025-03-14 22:39:23,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:39:23,289 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:39:23,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23 WrapperNode [2025-03-14 22:39:23,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:39:23,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:39:23,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:39:23,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:39:23,294 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:39:23" (1/1) ... [2025-03-14 22:39:23,300 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:39:23" (1/1) ... [2025-03-14 22:39:23,317 INFO L138 Inliner]: procedures = 28, calls = 65, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 292 [2025-03-14 22:39:23,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:39:23,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:39:23,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:39:23,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:39:23,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,333 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:39:23,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:39:23,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:39:23,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:39:23,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23" (1/1) ... [2025-03-14 22:39:23,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:39:23,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:23,370 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:39:23,372 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:39:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:39:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 22:39:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 22:39:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:39:23,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:39:23,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 22:39:23,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 22:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-14 22:39:23,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-14 22:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-14 22:39:23,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-14 22:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-14 22:39:23,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-14 22:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 22:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 22:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 22:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:39:23,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:39:23,389 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:39:23,472 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:39:23,473 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:39:23,860 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:39:23,860 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:39:24,043 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:39:24,043 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-14 22:39:24,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:39:24 BoogieIcfgContainer [2025-03-14 22:39:24,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:39:24,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:39:24,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:39:24,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:39:24,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:39:23" (1/3) ... [2025-03-14 22:39:24,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37131aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:39:24, skipping insertion in model container [2025-03-14 22:39:24,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:23" (2/3) ... [2025-03-14 22:39:24,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37131aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:39:24, skipping insertion in model container [2025-03-14 22:39:24,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:39:24" (3/3) ... [2025-03-14 22:39:24,053 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2025-03-14 22:39:24,065 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:39:24,068 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1-dsl.wvr.c that has 7 procedures, 218 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-14 22:39:24,069 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:39:24,168 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-14 22:39:24,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:39:24,212 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;@3f920ff5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:39:24,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-14 22:39:24,306 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:39:24,307 INFO L124 PetriNetUnfolderBase]: 17/222 cut-off events. [2025-03-14 22:39:24,310 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 22:39:24,310 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:24,311 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] [2025-03-14 22:39:24,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:24,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1488994196, now seen corresponding path program 1 times [2025-03-14 22:39:24,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457076702] [2025-03-14 22:39:24,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:24,593 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:39:24,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:24,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457076702] [2025-03-14 22:39:24,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457076702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:24,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:24,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 22:39:24,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810455968] [2025-03-14 22:39:24,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:24,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 22:39:24,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:24,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 22:39:24,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 22:39:24,635 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 246 [2025-03-14 22:39:24,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 242 transitions, 550 flow. Second operand has 2 states, 2 states have (on average 210.0) internal successors, (420), 2 states have internal predecessors, (420), 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:39:24,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:24,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 246 [2025-03-14 22:39:24,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:25,588 INFO L124 PetriNetUnfolderBase]: 2689/6185 cut-off events. [2025-03-14 22:39:25,589 INFO L125 PetriNetUnfolderBase]: For 1048/1048 co-relation queries the response was YES. [2025-03-14 22:39:25,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10697 conditions, 6185 events. 2689/6185 cut-off events. For 1048/1048 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49835 event pairs, 1348 based on Foata normal form. 989/6203 useless extension candidates. Maximal degree in co-relation 10325. Up to 3413 conditions per place. [2025-03-14 22:39:25,682 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 30 selfloop transitions, 0 changer transitions 4/215 dead transitions. [2025-03-14 22:39:25,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 215 transitions, 538 flow [2025-03-14 22:39:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 22:39:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 22:39:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 437 transitions. [2025-03-14 22:39:25,720 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8882113821138211 [2025-03-14 22:39:25,727 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, -18 predicate places. [2025-03-14 22:39:25,727 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 215 transitions, 538 flow [2025-03-14 22:39:25,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 210.0) internal successors, (420), 2 states have internal predecessors, (420), 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:39:25,732 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:25,732 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] [2025-03-14 22:39:25,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:39:25,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:25,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:25,734 INFO L85 PathProgramCache]: Analyzing trace with hash 303926412, now seen corresponding path program 1 times [2025-03-14 22:39:25,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:25,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646510810] [2025-03-14 22:39:25,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:25,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:26,161 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:39:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646510810] [2025-03-14 22:39:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646510810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:26,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:26,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:39:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848052046] [2025-03-14 22:39:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:26,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:39:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:26,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:39:26,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:39:26,167 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 246 [2025-03-14 22:39:26,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 215 transitions, 538 flow. Second operand has 6 states, 6 states have (on average 174.66666666666666) internal successors, (1048), 6 states have internal predecessors, (1048), 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:39:26,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:26,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 246 [2025-03-14 22:39:26,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:27,581 INFO L124 PetriNetUnfolderBase]: 5045/10855 cut-off events. [2025-03-14 22:39:27,581 INFO L125 PetriNetUnfolderBase]: For 4343/4879 co-relation queries the response was YES. [2025-03-14 22:39:27,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26202 conditions, 10855 events. 5045/10855 cut-off events. For 4343/4879 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 93163 event pairs, 1297 based on Foata normal form. 0/9630 useless extension candidates. Maximal degree in co-relation 25606. Up to 6483 conditions per place. [2025-03-14 22:39:27,662 INFO L140 encePairwiseOnDemand]: 231/246 looper letters, 105 selfloop transitions, 10 changer transitions 10/278 dead transitions. [2025-03-14 22:39:27,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 278 transitions, 1099 flow [2025-03-14 22:39:27,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 22:39:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 22:39:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1462 transitions. [2025-03-14 22:39:27,670 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7428861788617886 [2025-03-14 22:39:27,671 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, -11 predicate places. [2025-03-14 22:39:27,671 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 278 transitions, 1099 flow [2025-03-14 22:39:27,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.66666666666666) internal successors, (1048), 6 states have internal predecessors, (1048), 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:39:27,671 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:27,671 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] [2025-03-14 22:39:27,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:39:27,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:27,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash -912911288, now seen corresponding path program 2 times [2025-03-14 22:39:27,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:27,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161788255] [2025-03-14 22:39:27,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:27,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:27,714 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:39:27,714 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:27,967 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:39:27,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:27,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161788255] [2025-03-14 22:39:27,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161788255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:27,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:27,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:39:27,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147294162] [2025-03-14 22:39:27,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:27,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:39:27,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:27,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:39:27,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:39:27,969 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 246 [2025-03-14 22:39:27,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 278 transitions, 1099 flow. Second operand has 6 states, 6 states have (on average 174.66666666666666) internal successors, (1048), 6 states have internal predecessors, (1048), 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:39:27,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:27,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 246 [2025-03-14 22:39:27,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:29,704 INFO L124 PetriNetUnfolderBase]: 7282/14829 cut-off events. [2025-03-14 22:39:29,704 INFO L125 PetriNetUnfolderBase]: For 10459/11671 co-relation queries the response was YES. [2025-03-14 22:39:29,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46603 conditions, 14829 events. 7282/14829 cut-off events. For 10459/11671 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 130003 event pairs, 1591 based on Foata normal form. 44/13256 useless extension candidates. Maximal degree in co-relation 44731. Up to 9397 conditions per place. [2025-03-14 22:39:29,819 INFO L140 encePairwiseOnDemand]: 230/246 looper letters, 157 selfloop transitions, 14 changer transitions 16/340 dead transitions. [2025-03-14 22:39:29,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 340 transitions, 1901 flow [2025-03-14 22:39:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 22:39:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 22:39:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1463 transitions. [2025-03-14 22:39:29,822 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7433943089430894 [2025-03-14 22:39:29,823 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, -4 predicate places. [2025-03-14 22:39:29,823 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 340 transitions, 1901 flow [2025-03-14 22:39:29,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.66666666666666) internal successors, (1048), 6 states have internal predecessors, (1048), 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:39:29,824 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:29,824 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:29,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 22:39:29,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:29,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:29,825 INFO L85 PathProgramCache]: Analyzing trace with hash 987262926, now seen corresponding path program 1 times [2025-03-14 22:39:29,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:29,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482287644] [2025-03-14 22:39:29,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:29,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:29,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:29,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482287644] [2025-03-14 22:39:29,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482287644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:29,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:29,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 22:39:29,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319571751] [2025-03-14 22:39:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:29,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 22:39:29,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:29,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 22:39:29,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 22:39:29,921 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 246 [2025-03-14 22:39:29,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 340 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 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:39:29,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:29,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 246 [2025-03-14 22:39:29,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:31,353 INFO L124 PetriNetUnfolderBase]: 6853/13386 cut-off events. [2025-03-14 22:39:31,354 INFO L125 PetriNetUnfolderBase]: For 14741/16151 co-relation queries the response was YES. [2025-03-14 22:39:31,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52847 conditions, 13386 events. 6853/13386 cut-off events. For 14741/16151 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 110211 event pairs, 707 based on Foata normal form. 437/12528 useless extension candidates. Maximal degree in co-relation 50755. Up to 8968 conditions per place. [2025-03-14 22:39:31,492 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 214 selfloop transitions, 10 changer transitions 16/427 dead transitions. [2025-03-14 22:39:31,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 427 transitions, 3154 flow [2025-03-14 22:39:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 22:39:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 22:39:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-03-14 22:39:31,494 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8617886178861789 [2025-03-14 22:39:31,494 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, -2 predicate places. [2025-03-14 22:39:31,495 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 427 transitions, 3154 flow [2025-03-14 22:39:31,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 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:39:31,495 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:31,495 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:31,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:39:31,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:31,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash 545633392, now seen corresponding path program 1 times [2025-03-14 22:39:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:31,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324861189] [2025-03-14 22:39:31,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:31,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:31,664 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:39:31,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:31,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324861189] [2025-03-14 22:39:31,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324861189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:31,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:31,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:39:31,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691513750] [2025-03-14 22:39:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:31,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:39:31,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:31,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:39:31,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:39:31,666 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 246 [2025-03-14 22:39:31,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 427 transitions, 3154 flow. Second operand has 7 states, 7 states have (on average 184.14285714285714) internal successors, (1289), 7 states have internal predecessors, (1289), 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:39:31,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:31,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 246 [2025-03-14 22:39:31,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:33,589 INFO L124 PetriNetUnfolderBase]: 8684/17391 cut-off events. [2025-03-14 22:39:33,589 INFO L125 PetriNetUnfolderBase]: For 28123/30423 co-relation queries the response was YES. [2025-03-14 22:39:33,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79851 conditions, 17391 events. 8684/17391 cut-off events. For 28123/30423 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 150917 event pairs, 927 based on Foata normal form. 193/15859 useless extension candidates. Maximal degree in co-relation 59392. Up to 11492 conditions per place. [2025-03-14 22:39:33,760 INFO L140 encePairwiseOnDemand]: 235/246 looper letters, 363 selfloop transitions, 12 changer transitions 28/576 dead transitions. [2025-03-14 22:39:33,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 576 transitions, 5586 flow [2025-03-14 22:39:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:39:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:39:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1890 transitions. [2025-03-14 22:39:33,764 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7682926829268293 [2025-03-14 22:39:33,765 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 7 predicate places. [2025-03-14 22:39:33,765 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 576 transitions, 5586 flow [2025-03-14 22:39:33,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 184.14285714285714) internal successors, (1289), 7 states have internal predecessors, (1289), 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:39:33,766 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:33,766 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:33,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 22:39:33,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:33,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash -361366682, now seen corresponding path program 1 times [2025-03-14 22:39:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:33,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714880972] [2025-03-14 22:39:33,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:33,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:34,048 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:39:34,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:34,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714880972] [2025-03-14 22:39:34,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714880972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:34,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:34,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:39:34,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793902208] [2025-03-14 22:39:34,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:34,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:39:34,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:34,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:39:34,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:39:34,050 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 246 [2025-03-14 22:39:34,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 576 transitions, 5586 flow. Second operand has 7 states, 7 states have (on average 184.14285714285714) internal successors, (1289), 7 states have internal predecessors, (1289), 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:39:34,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:34,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 246 [2025-03-14 22:39:34,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:36,036 INFO L124 PetriNetUnfolderBase]: 7332/14784 cut-off events. [2025-03-14 22:39:36,036 INFO L125 PetriNetUnfolderBase]: For 32816/35834 co-relation queries the response was YES. [2025-03-14 22:39:36,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77244 conditions, 14784 events. 7332/14784 cut-off events. For 32816/35834 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 124827 event pairs, 731 based on Foata normal form. 144/13459 useless extension candidates. Maximal degree in co-relation 68034. Up to 9702 conditions per place. [2025-03-14 22:39:36,164 INFO L140 encePairwiseOnDemand]: 235/246 looper letters, 236 selfloop transitions, 6 changer transitions 107/522 dead transitions. [2025-03-14 22:39:36,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 522 transitions, 5560 flow [2025-03-14 22:39:36,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:39:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:39:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1882 transitions. [2025-03-14 22:39:36,168 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.765040650406504 [2025-03-14 22:39:36,168 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 16 predicate places. [2025-03-14 22:39:36,169 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 522 transitions, 5560 flow [2025-03-14 22:39:36,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 184.14285714285714) internal successors, (1289), 7 states have internal predecessors, (1289), 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:39:36,169 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:36,169 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:36,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 22:39:36,170 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:36,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash 706459577, now seen corresponding path program 1 times [2025-03-14 22:39:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:36,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447208582] [2025-03-14 22:39:36,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:36,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:36,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447208582] [2025-03-14 22:39:36,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447208582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934289634] [2025-03-14 22:39:36,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:36,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:36,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:36,351 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:39:36,353 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:39:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:36,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 22:39:36,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:36,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:36,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934289634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:36,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:36,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-14 22:39:36,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185888877] [2025-03-14 22:39:36,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:36,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 22:39:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:36,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 22:39:36,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-14 22:39:36,895 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 246 [2025-03-14 22:39:36,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 522 transitions, 5560 flow. Second operand has 19 states, 19 states have (on average 181.73684210526315) internal successors, (3453), 19 states have internal predecessors, (3453), 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:39:36,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:36,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 246 [2025-03-14 22:39:36,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:39,673 INFO L124 PetriNetUnfolderBase]: 9163/19020 cut-off events. [2025-03-14 22:39:39,674 INFO L125 PetriNetUnfolderBase]: For 55253/60035 co-relation queries the response was YES. [2025-03-14 22:39:39,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110287 conditions, 19020 events. 9163/19020 cut-off events. For 55253/60035 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 169880 event pairs, 785 based on Foata normal form. 307/17422 useless extension candidates. Maximal degree in co-relation 78368. Up to 12226 conditions per place. [2025-03-14 22:39:39,860 INFO L140 encePairwiseOnDemand]: 227/246 looper letters, 351 selfloop transitions, 30 changer transitions 119/672 dead transitions. [2025-03-14 22:39:39,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 672 transitions, 8784 flow [2025-03-14 22:39:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:39:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:39:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2975 transitions. [2025-03-14 22:39:39,865 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7558434959349594 [2025-03-14 22:39:39,865 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 31 predicate places. [2025-03-14 22:39:39,865 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 672 transitions, 8784 flow [2025-03-14 22:39:39,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 181.73684210526315) internal successors, (3453), 19 states have internal predecessors, (3453), 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:39:39,867 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:39,867 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:39,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 22:39:40,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:40,068 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:40,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:40,069 INFO L85 PathProgramCache]: Analyzing trace with hash -536150443, now seen corresponding path program 1 times [2025-03-14 22:39:40,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:40,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617832955] [2025-03-14 22:39:40,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:40,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:40,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617832955] [2025-03-14 22:39:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617832955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369213760] [2025-03-14 22:39:40,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:40,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:40,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:40,237 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:39:40,238 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:39:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:40,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 22:39:40,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:40,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:40,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369213760] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:40,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:40,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-14 22:39:40,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618094741] [2025-03-14 22:39:40,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:40,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 22:39:40,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:40,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 22:39:40,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-14 22:39:40,641 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 246 [2025-03-14 22:39:40,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 672 transitions, 8784 flow. Second operand has 19 states, 19 states have (on average 181.52631578947367) internal successors, (3449), 19 states have internal predecessors, (3449), 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:39:40,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:40,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 246 [2025-03-14 22:39:40,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:43,182 INFO L124 PetriNetUnfolderBase]: 7370/15736 cut-off events. [2025-03-14 22:39:43,182 INFO L125 PetriNetUnfolderBase]: For 54276/57200 co-relation queries the response was YES. [2025-03-14 22:39:43,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100639 conditions, 15736 events. 7370/15736 cut-off events. For 54276/57200 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 137769 event pairs, 476 based on Foata normal form. 571/14791 useless extension candidates. Maximal degree in co-relation 83082. Up to 9995 conditions per place. [2025-03-14 22:39:43,348 INFO L140 encePairwiseOnDemand]: 227/246 looper letters, 354 selfloop transitions, 34 changer transitions 198/758 dead transitions. [2025-03-14 22:39:43,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 758 transitions, 11400 flow [2025-03-14 22:39:43,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:39:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:39:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2969 transitions. [2025-03-14 22:39:43,352 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7543191056910569 [2025-03-14 22:39:43,352 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 46 predicate places. [2025-03-14 22:39:43,352 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 758 transitions, 11400 flow [2025-03-14 22:39:43,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 181.52631578947367) internal successors, (3449), 19 states have internal predecessors, (3449), 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:39:43,354 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:43,354 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:43,360 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 22:39:43,558 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,SelfDestructingSolverStorable7 [2025-03-14 22:39:43,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:43,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1304643990, now seen corresponding path program 1 times [2025-03-14 22:39:43,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:43,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868306577] [2025-03-14 22:39:43,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:43,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:39:43,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868306577] [2025-03-14 22:39:43,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868306577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465928225] [2025-03-14 22:39:43,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:43,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:43,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:43,722 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:39:43,723 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:39:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:43,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 22:39:43,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:39:43,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:39:44,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465928225] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:44,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:39:44,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2025-03-14 22:39:44,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088693242] [2025-03-14 22:39:44,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:44,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 22:39:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:44,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 22:39:44,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-14 22:39:44,182 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 246 [2025-03-14 22:39:44,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 758 transitions, 11400 flow. Second operand has 9 states, 9 states have (on average 183.11111111111111) internal successors, (1648), 9 states have internal predecessors, (1648), 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:39:44,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:44,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 246 [2025-03-14 22:39:44,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:46,289 INFO L124 PetriNetUnfolderBase]: 6157/12904 cut-off events. [2025-03-14 22:39:46,289 INFO L125 PetriNetUnfolderBase]: For 54645/56831 co-relation queries the response was YES. [2025-03-14 22:39:46,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92175 conditions, 12904 events. 6157/12904 cut-off events. For 54645/56831 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 106299 event pairs, 322 based on Foata normal form. 207/11918 useless extension candidates. Maximal degree in co-relation 71890. Up to 8352 conditions per place. [2025-03-14 22:39:46,413 INFO L140 encePairwiseOnDemand]: 230/246 looper letters, 406 selfloop transitions, 23 changer transitions 195/790 dead transitions. [2025-03-14 22:39:46,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 790 transitions, 13306 flow [2025-03-14 22:39:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:39:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:39:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1883 transitions. [2025-03-14 22:39:46,416 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7654471544715448 [2025-03-14 22:39:46,416 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 55 predicate places. [2025-03-14 22:39:46,416 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 790 transitions, 13306 flow [2025-03-14 22:39:46,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 183.11111111111111) internal successors, (1648), 9 states have internal predecessors, (1648), 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:39:46,417 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:46,417 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:46,423 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:39:46,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:46,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:46,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1285757125, now seen corresponding path program 1 times [2025-03-14 22:39:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552503014] [2025-03-14 22:39:46,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:39:46,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:46,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552503014] [2025-03-14 22:39:46,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552503014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:46,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802193791] [2025-03-14 22:39:46,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:46,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:46,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:46,766 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 22:39:46,767 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 22:39:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:46,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 22:39:46,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:39:47,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:39:47,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802193791] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:47,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:39:47,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2025-03-14 22:39:47,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982956619] [2025-03-14 22:39:47,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:47,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 22:39:47,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:47,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 22:39:47,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-14 22:39:47,199 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 246 [2025-03-14 22:39:47,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 790 transitions, 13306 flow. Second operand has 9 states, 9 states have (on average 183.11111111111111) internal successors, (1648), 9 states have internal predecessors, (1648), 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:39:47,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:47,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 246 [2025-03-14 22:39:47,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:48,790 INFO L124 PetriNetUnfolderBase]: 5144/10775 cut-off events. [2025-03-14 22:39:48,790 INFO L125 PetriNetUnfolderBase]: For 53816/55770 co-relation queries the response was YES. [2025-03-14 22:39:48,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84017 conditions, 10775 events. 5144/10775 cut-off events. For 53816/55770 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 84961 event pairs, 227 based on Foata normal form. 153/9963 useless extension candidates. Maximal degree in co-relation 63682. Up to 6979 conditions per place. [2025-03-14 22:39:48,919 INFO L140 encePairwiseOnDemand]: 230/246 looper letters, 424 selfloop transitions, 28 changer transitions 194/806 dead transitions. [2025-03-14 22:39:48,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 806 transitions, 14968 flow [2025-03-14 22:39:48,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:39:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:39:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1883 transitions. [2025-03-14 22:39:49,050 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7654471544715448 [2025-03-14 22:39:49,050 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 64 predicate places. [2025-03-14 22:39:49,051 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 806 transitions, 14968 flow [2025-03-14 22:39:49,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 183.11111111111111) internal successors, (1648), 9 states have internal predecessors, (1648), 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:39:49,051 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:49,051 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:49,058 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 22:39:49,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:49,257 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:49,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1498021993, now seen corresponding path program 1 times [2025-03-14 22:39:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:49,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347613030] [2025-03-14 22:39:49,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347613030] [2025-03-14 22:39:50,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347613030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839641905] [2025-03-14 22:39:50,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:50,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:50,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:50,468 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 22:39:50,468 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 22:39:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:50,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:39:50,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:50,775 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 19 treesize of output 7 [2025-03-14 22:39:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:39:50,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:50,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:39:50,958 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 20 treesize of output 14 [2025-03-14 22:39:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:39:51,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839641905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:51,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:51,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 25 [2025-03-14 22:39:51,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981900867] [2025-03-14 22:39:51,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:51,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 22:39:51,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:51,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 22:39:51,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2025-03-14 22:39:51,018 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 246 [2025-03-14 22:39:51,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 806 transitions, 14968 flow. Second operand has 25 states, 25 states have (on average 140.76) internal successors, (3519), 25 states have internal predecessors, (3519), 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:39:51,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:51,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 246 [2025-03-14 22:39:51,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:54,862 INFO L124 PetriNetUnfolderBase]: 8345/17268 cut-off events. [2025-03-14 22:39:54,862 INFO L125 PetriNetUnfolderBase]: For 97840/100611 co-relation queries the response was YES. [2025-03-14 22:39:54,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146363 conditions, 17268 events. 8345/17268 cut-off events. For 97840/100611 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 149251 event pairs, 320 based on Foata normal form. 130/15891 useless extension candidates. Maximal degree in co-relation 123457. Up to 11252 conditions per place. [2025-03-14 22:39:55,145 INFO L140 encePairwiseOnDemand]: 216/246 looper letters, 791 selfloop transitions, 150 changer transitions 206/1270 dead transitions. [2025-03-14 22:39:55,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 1270 transitions, 27782 flow [2025-03-14 22:39:55,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-14 22:39:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-14 22:39:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4524 transitions. [2025-03-14 22:39:55,153 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5932336742722266 [2025-03-14 22:39:55,154 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 94 predicate places. [2025-03-14 22:39:55,154 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 1270 transitions, 27782 flow [2025-03-14 22:39:55,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 140.76) internal successors, (3519), 25 states have internal predecessors, (3519), 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:39:55,155 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:55,155 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:55,161 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 22:39:55,360 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,SelfDestructingSolverStorable10 [2025-03-14 22:39:55,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:39:55,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:55,361 INFO L85 PathProgramCache]: Analyzing trace with hash 776091501, now seen corresponding path program 2 times [2025-03-14 22:39:55,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:55,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523581612] [2025-03-14 22:39:55,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:55,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:55,441 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:55,442 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:39:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:56,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523581612] [2025-03-14 22:39:56,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523581612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:56,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691074702] [2025-03-14 22:39:56,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:56,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:56,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:56,053 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 22:39:56,055 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 22:39:56,317 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:56,317 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:56,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-14 22:39:56,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:56,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-14 22:39:56,696 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 15 treesize of output 7 [2025-03-14 22:39:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:56,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:39:56,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691074702] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:56,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:56,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 10] total 30 [2025-03-14 22:39:56,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337553002] [2025-03-14 22:39:56,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:56,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 22:39:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:56,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 22:39:56,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2025-03-14 22:39:56,948 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 246 [2025-03-14 22:39:56,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 1270 transitions, 27782 flow. Second operand has 30 states, 30 states have (on average 137.4) internal successors, (4122), 30 states have internal predecessors, (4122), 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:39:56,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:56,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 246 [2025-03-14 22:39:56,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:40:03,011 INFO L124 PetriNetUnfolderBase]: 12391/24647 cut-off events. [2025-03-14 22:40:03,011 INFO L125 PetriNetUnfolderBase]: For 155742/158691 co-relation queries the response was YES. [2025-03-14 22:40:03,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232058 conditions, 24647 events. 12391/24647 cut-off events. For 155742/158691 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 221684 event pairs, 350 based on Foata normal form. 167/22670 useless extension candidates. Maximal degree in co-relation 207231. Up to 16645 conditions per place. [2025-03-14 22:40:03,645 INFO L140 encePairwiseOnDemand]: 216/246 looper letters, 1647 selfloop transitions, 338 changer transitions 236/2341 dead transitions. [2025-03-14 22:40:03,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 2341 transitions, 58746 flow [2025-03-14 22:40:03,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-14 22:40:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-14 22:40:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 5317 transitions. [2025-03-14 22:40:03,650 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5841573280597671 [2025-03-14 22:40:03,651 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 130 predicate places. [2025-03-14 22:40:03,651 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 2341 transitions, 58746 flow [2025-03-14 22:40:03,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 137.4) internal successors, (4122), 30 states have internal predecessors, (4122), 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:40:03,652 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:40:03,652 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:40:03,659 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 22:40:03,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:40:03,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:40:03,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:40:03,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1277821226, now seen corresponding path program 1 times [2025-03-14 22:40:03,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:40:03,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445677344] [2025-03-14 22:40:03,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:40:03,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:40:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:40:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:40:04,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:40:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445677344] [2025-03-14 22:40:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445677344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:40:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085943074] [2025-03-14 22:40:04,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:40:04,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:40:04,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:40:04,763 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 22:40:04,764 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 22:40:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:40:04,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:40:04,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:40:05,192 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 19 treesize of output 7 [2025-03-14 22:40:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:40:05,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:40:05,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:40:05,344 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 25 treesize of output 16 [2025-03-14 22:40:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:40:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085943074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:40:05,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:40:05,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 27 [2025-03-14 22:40:05,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883231751] [2025-03-14 22:40:05,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:40:05,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-14 22:40:05,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:40:05,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-14 22:40:05,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-03-14 22:40:05,436 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 246 [2025-03-14 22:40:05,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 2341 transitions, 58746 flow. Second operand has 27 states, 27 states have (on average 140.77777777777777) internal successors, (3801), 27 states have internal predecessors, (3801), 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:40:05,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:40:05,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 246 [2025-03-14 22:40:05,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:40:13,033 INFO L124 PetriNetUnfolderBase]: 13713/27109 cut-off events. [2025-03-14 22:40:13,033 INFO L125 PetriNetUnfolderBase]: For 195053/198321 co-relation queries the response was YES. [2025-03-14 22:40:13,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275167 conditions, 27109 events. 13713/27109 cut-off events. For 195053/198321 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 246857 event pairs, 401 based on Foata normal form. 142/24924 useless extension candidates. Maximal degree in co-relation 248616. Up to 18421 conditions per place. [2025-03-14 22:40:13,469 INFO L140 encePairwiseOnDemand]: 216/246 looper letters, 2071 selfloop transitions, 237 changer transitions 253/2684 dead transitions. [2025-03-14 22:40:13,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 2684 transitions, 73066 flow [2025-03-14 22:40:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-14 22:40:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-14 22:40:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4490 transitions. [2025-03-14 22:40:13,472 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5887752425911356 [2025-03-14 22:40:13,472 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 160 predicate places. [2025-03-14 22:40:13,472 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 2684 transitions, 73066 flow [2025-03-14 22:40:13,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 140.77777777777777) internal successors, (3801), 27 states have internal predecessors, (3801), 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:40:13,473 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:40:13,473 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:40:13,479 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 22:40:13,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:40:13,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:40:13,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:40:13,678 INFO L85 PathProgramCache]: Analyzing trace with hash -355969102, now seen corresponding path program 1 times [2025-03-14 22:40:13,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:40:13,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201490361] [2025-03-14 22:40:13,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:40:13,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:40:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:40:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:40:14,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:40:14,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201490361] [2025-03-14 22:40:14,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201490361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:40:14,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529588995] [2025-03-14 22:40:14,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:40:14,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:40:14,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:40:14,698 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 22:40:14,699 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 22:40:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:40:14,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:40:14,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:40:14,996 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 19 treesize of output 7 [2025-03-14 22:40:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:40:15,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:40:15,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:40:15,139 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 25 treesize of output 16 [2025-03-14 22:40:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:40:15,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529588995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:40:15,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:40:15,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 25 [2025-03-14 22:40:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100711756] [2025-03-14 22:40:15,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:40:15,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 22:40:15,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:40:15,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 22:40:15,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2025-03-14 22:40:15,210 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 246 [2025-03-14 22:40:15,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 2684 transitions, 73066 flow. Second operand has 25 states, 25 states have (on average 140.72) internal successors, (3518), 25 states have internal predecessors, (3518), 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:40:15,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:40:15,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 246 [2025-03-14 22:40:15,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:40:24,677 INFO L124 PetriNetUnfolderBase]: 14726/29214 cut-off events. [2025-03-14 22:40:24,677 INFO L125 PetriNetUnfolderBase]: For 244964/249979 co-relation queries the response was YES. [2025-03-14 22:40:24,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315420 conditions, 29214 events. 14726/29214 cut-off events. For 244964/249979 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 271145 event pairs, 410 based on Foata normal form. 164/26841 useless extension candidates. Maximal degree in co-relation 287033. Up to 19778 conditions per place. [2025-03-14 22:40:25,216 INFO L140 encePairwiseOnDemand]: 216/246 looper letters, 2268 selfloop transitions, 225 changer transitions 276/2892 dead transitions. [2025-03-14 22:40:25,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 2892 transitions, 84573 flow [2025-03-14 22:40:25,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-14 22:40:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-14 22:40:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4046 transitions. [2025-03-14 22:40:25,218 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5873983739837398 [2025-03-14 22:40:25,219 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 187 predicate places. [2025-03-14 22:40:25,219 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 2892 transitions, 84573 flow [2025-03-14 22:40:25,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 140.72) internal successors, (3518), 25 states have internal predecessors, (3518), 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:40:25,220 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:40:25,220 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:40:25,226 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 22:40:25,424 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,SelfDestructingSolverStorable13 [2025-03-14 22:40:25,424 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:40:25,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:40:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1792199048, now seen corresponding path program 1 times [2025-03-14 22:40:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:40:25,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231663820] [2025-03-14 22:40:25,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:40:25,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:40:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:40:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:40:26,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:40:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231663820] [2025-03-14 22:40:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231663820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:40:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111728798] [2025-03-14 22:40:26,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:40:26,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:40:26,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:40:26,314 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 22:40:26,316 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 22:40:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:40:26,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:40:26,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:40:26,544 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 19 treesize of output 7 [2025-03-14 22:40:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:40:26,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 22:40:26,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111728798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:40:26,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 22:40:26,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 21 [2025-03-14 22:40:26,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896496568] [2025-03-14 22:40:26,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:40:26,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:40:26,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:40:26,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:40:26,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-03-14 22:40:26,586 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 246 [2025-03-14 22:40:26,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 2892 transitions, 84573 flow. Second operand has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:40:26,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:40:26,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 246 [2025-03-14 22:40:26,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:40:36,287 INFO L124 PetriNetUnfolderBase]: 15726/30927 cut-off events. [2025-03-14 22:40:36,287 INFO L125 PetriNetUnfolderBase]: For 286863/290942 co-relation queries the response was YES. [2025-03-14 22:40:36,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357729 conditions, 30927 events. 15726/30927 cut-off events. For 286863/290942 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 288004 event pairs, 389 based on Foata normal form. 96/28313 useless extension candidates. Maximal degree in co-relation 320075. Up to 21119 conditions per place. [2025-03-14 22:40:36,847 INFO L140 encePairwiseOnDemand]: 229/246 looper letters, 2421 selfloop transitions, 212 changer transitions 296/3076 dead transitions. [2025-03-14 22:40:36,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 3076 transitions, 96081 flow [2025-03-14 22:40:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:40:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:40:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2519 transitions. [2025-03-14 22:40:36,849 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6826558265582656 [2025-03-14 22:40:36,850 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 201 predicate places. [2025-03-14 22:40:36,850 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 3076 transitions, 96081 flow [2025-03-14 22:40:36,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:40:36,850 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:40:36,851 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:40:36,856 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 22:40:37,051 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,SelfDestructingSolverStorable14 [2025-03-14 22:40:37,051 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:40:37,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:40:37,052 INFO L85 PathProgramCache]: Analyzing trace with hash 863191791, now seen corresponding path program 1 times [2025-03-14 22:40:37,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:40:37,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123224772] [2025-03-14 22:40:37,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:40:37,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:40:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:40:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:40:37,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:40:37,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123224772] [2025-03-14 22:40:37,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123224772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:40:37,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083851356] [2025-03-14 22:40:37,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:40:37,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:40:37,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:40:37,943 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 22:40:37,943 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 22:40:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:40:38,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:40:38,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:40:38,198 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 19 treesize of output 7 [2025-03-14 22:40:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:40:38,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:40:38,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:40:38,323 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 25 treesize of output 16 [2025-03-14 22:40:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:40:38,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083851356] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:40:38,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:40:38,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 26 [2025-03-14 22:40:38,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634445911] [2025-03-14 22:40:38,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:40:38,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 22:40:38,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:40:38,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 22:40:38,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2025-03-14 22:40:38,392 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 246 [2025-03-14 22:40:38,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 3076 transitions, 96081 flow. Second operand has 26 states, 26 states have (on average 140.69230769230768) internal successors, (3658), 26 states have internal predecessors, (3658), 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:40:38,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:40:38,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 246 [2025-03-14 22:40:38,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:40:50,803 INFO L124 PetriNetUnfolderBase]: 16846/32895 cut-off events. [2025-03-14 22:40:50,804 INFO L125 PetriNetUnfolderBase]: For 344874/350609 co-relation queries the response was YES. [2025-03-14 22:40:50,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405743 conditions, 32895 events. 16846/32895 cut-off events. For 344874/350609 co-relation queries the response was YES. Maximal size of possible extension queue 1548. Compared 308019 event pairs, 461 based on Foata normal form. 148/30191 useless extension candidates. Maximal degree in co-relation 373757. Up to 22624 conditions per place. [2025-03-14 22:40:51,462 INFO L140 encePairwiseOnDemand]: 216/246 looper letters, 2633 selfloop transitions, 230 changer transitions 318/3304 dead transitions. [2025-03-14 22:40:51,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 3304 transitions, 109929 flow [2025-03-14 22:40:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-14 22:40:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-14 22:40:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4048 transitions. [2025-03-14 22:40:51,464 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5876887340301974 [2025-03-14 22:40:51,465 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 228 predicate places. [2025-03-14 22:40:51,465 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 3304 transitions, 109929 flow [2025-03-14 22:40:51,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 140.69230769230768) internal successors, (3658), 26 states have internal predecessors, (3658), 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:40:51,465 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:40:51,466 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:40:51,471 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 22:40:51,666 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,SelfDestructingSolverStorable15 [2025-03-14 22:40:51,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:40:51,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:40:51,667 INFO L85 PathProgramCache]: Analyzing trace with hash 459436032, now seen corresponding path program 2 times [2025-03-14 22:40:51,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:40:51,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775330464] [2025-03-14 22:40:51,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:40:51,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:40:51,680 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:40:51,680 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:40:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:40:52,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:40:52,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775330464] [2025-03-14 22:40:52,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775330464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:40:52,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:40:52,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:40:52,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088308095] [2025-03-14 22:40:52,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:40:52,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:40:52,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:40:52,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:40:52,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:40:52,055 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 246 [2025-03-14 22:40:52,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 3304 transitions, 109929 flow. Second operand has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:40:52,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:40:52,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 246 [2025-03-14 22:40:52,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:41:05,917 INFO L124 PetriNetUnfolderBase]: 17850/34538 cut-off events. [2025-03-14 22:41:05,918 INFO L125 PetriNetUnfolderBase]: For 393895/398880 co-relation queries the response was YES. [2025-03-14 22:41:06,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453590 conditions, 34538 events. 17850/34538 cut-off events. For 393895/398880 co-relation queries the response was YES. Maximal size of possible extension queue 1652. Compared 323051 event pairs, 428 based on Foata normal form. 126/31667 useless extension candidates. Maximal degree in co-relation 409576. Up to 23969 conditions per place. [2025-03-14 22:41:06,768 INFO L140 encePairwiseOnDemand]: 229/246 looper letters, 2795 selfloop transitions, 220 changer transitions 341/3503 dead transitions. [2025-03-14 22:41:06,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 3503 transitions, 123537 flow [2025-03-14 22:41:06,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:41:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:41:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2514 transitions. [2025-03-14 22:41:06,769 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6813008130081301 [2025-03-14 22:41:06,770 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 242 predicate places. [2025-03-14 22:41:06,770 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 3503 transitions, 123537 flow [2025-03-14 22:41:06,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:41:06,770 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:41:06,770 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:41:06,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 22:41:06,771 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:41:06,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:41:06,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1076804744, now seen corresponding path program 2 times [2025-03-14 22:41:06,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:41:06,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204093231] [2025-03-14 22:41:06,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:41:06,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:41:06,790 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:41:06,790 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:41:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:41:07,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:41:07,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204093231] [2025-03-14 22:41:07,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204093231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:41:07,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078489540] [2025-03-14 22:41:07,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:41:07,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:41:07,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:41:07,064 INFO L229 MonitoredProcess]: Starting monitored process 12 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:41:07,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-14 22:41:07,153 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:41:07,153 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:41:07,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-14 22:41:07,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:41:07,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-14 22:41:07,446 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 15 treesize of output 7 [2025-03-14 22:41:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:41:07,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:41:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:41:07,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078489540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:41:07,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:41:07,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 10] total 29 [2025-03-14 22:41:07,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578088463] [2025-03-14 22:41:07,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:41:07,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 22:41:07,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:41:07,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 22:41:07,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2025-03-14 22:41:07,666 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 246 [2025-03-14 22:41:07,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 3503 transitions, 123537 flow. Second operand has 29 states, 29 states have (on average 137.41379310344828) internal successors, (3985), 29 states have internal predecessors, (3985), 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:41:07,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:41:07,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 246 [2025-03-14 22:41:07,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:41:25,560 INFO L124 PetriNetUnfolderBase]: 18850/36581 cut-off events. [2025-03-14 22:41:25,560 INFO L125 PetriNetUnfolderBase]: For 475563/482470 co-relation queries the response was YES. [2025-03-14 22:41:25,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504506 conditions, 36581 events. 18850/36581 cut-off events. For 475563/482470 co-relation queries the response was YES. Maximal size of possible extension queue 1755. Compared 347242 event pairs, 508 based on Foata normal form. 166/33548 useless extension candidates. Maximal degree in co-relation 468823. Up to 25310 conditions per place. [2025-03-14 22:41:26,400 INFO L140 encePairwiseOnDemand]: 216/246 looper letters, 2972 selfloop transitions, 248 changer transitions 361/3701 dead transitions. [2025-03-14 22:41:26,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 3701 transitions, 137987 flow [2025-03-14 22:41:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 22:41:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 22:41:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4528 transitions. [2025-03-14 22:41:26,403 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5752032520325203 [2025-03-14 22:41:26,404 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 273 predicate places. [2025-03-14 22:41:26,404 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 3701 transitions, 137987 flow [2025-03-14 22:41:26,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 137.41379310344828) internal successors, (3985), 29 states have internal predecessors, (3985), 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:41:26,404 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:41:26,405 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:41:26,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-14 22:41:26,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-14 22:41:26,605 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:41:26,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:41:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1250342447, now seen corresponding path program 1 times [2025-03-14 22:41:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:41:26,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704123722] [2025-03-14 22:41:26,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:41:26,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:41:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:41:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:41:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:41:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704123722] [2025-03-14 22:41:27,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704123722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:41:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764714661] [2025-03-14 22:41:27,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:41:27,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:41:27,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:41:27,255 INFO L229 MonitoredProcess]: Starting monitored process 13 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:41:27,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-14 22:41:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:41:27,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:41:27,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:41:27,586 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 19 treesize of output 7 [2025-03-14 22:41:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:41:27,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 22:41:27,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764714661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:41:27,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 22:41:27,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 23 [2025-03-14 22:41:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131689908] [2025-03-14 22:41:27,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:41:27,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:41:27,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:41:27,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:41:27,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-03-14 22:41:27,605 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 246 [2025-03-14 22:41:27,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 3701 transitions, 137987 flow. Second operand has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:41:27,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:41:27,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 246 [2025-03-14 22:41:27,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:41:47,342 INFO L124 PetriNetUnfolderBase]: 19983/38837 cut-off events. [2025-03-14 22:41:47,342 INFO L125 PetriNetUnfolderBase]: For 560691/569320 co-relation queries the response was YES. [2025-03-14 22:41:47,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561895 conditions, 38837 events. 19983/38837 cut-off events. For 560691/569320 co-relation queries the response was YES. Maximal size of possible extension queue 1861. Compared 372476 event pairs, 512 based on Foata normal form. 204/35652 useless extension candidates. Maximal degree in co-relation 524353. Up to 26835 conditions per place. [2025-03-14 22:41:48,430 INFO L140 encePairwiseOnDemand]: 229/246 looper letters, 3029 selfloop transitions, 356 changer transitions 378/3910 dead transitions. [2025-03-14 22:41:48,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 3910 transitions, 153618 flow [2025-03-14 22:41:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:41:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:41:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2702 transitions. [2025-03-14 22:41:48,432 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6864837398373984 [2025-03-14 22:41:48,432 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 288 predicate places. [2025-03-14 22:41:48,432 INFO L471 AbstractCegarLoop]: Abstraction has has 532 places, 3910 transitions, 153618 flow [2025-03-14 22:41:48,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:41:48,432 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:41:48,433 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:41:48,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-14 22:41:48,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:41:48,637 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:41:48,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:41:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash -748974891, now seen corresponding path program 1 times [2025-03-14 22:41:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:41:48,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709870927] [2025-03-14 22:41:48,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:41:48,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:41:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:41:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:41:49,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:41:49,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709870927] [2025-03-14 22:41:49,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709870927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:41:49,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572250825] [2025-03-14 22:41:49,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:41:49,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:41:49,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:41:49,093 INFO L229 MonitoredProcess]: Starting monitored process 14 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:41:49,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-14 22:41:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:41:49,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:41:49,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:41:49,366 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 19 treesize of output 7 [2025-03-14 22:41:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:41:49,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 22:41:49,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572250825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:41:49,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 22:41:49,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 21 [2025-03-14 22:41:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964967434] [2025-03-14 22:41:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:41:49,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:41:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:41:49,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:41:49,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2025-03-14 22:41:49,411 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 246 [2025-03-14 22:41:49,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 3910 transitions, 153618 flow. Second operand has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:41:49,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:41:49,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 246 [2025-03-14 22:41:49,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:42:11,651 INFO L124 PetriNetUnfolderBase]: 20983/40492 cut-off events. [2025-03-14 22:42:11,651 INFO L125 PetriNetUnfolderBase]: For 632724/639793 co-relation queries the response was YES. [2025-03-14 22:42:11,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617948 conditions, 40492 events. 20983/40492 cut-off events. For 632724/639793 co-relation queries the response was YES. Maximal size of possible extension queue 1965. Compared 389179 event pairs, 472 based on Foata normal form. 224/37160 useless extension candidates. Maximal degree in co-relation 562640. Up to 28176 conditions per place. [2025-03-14 22:42:12,813 INFO L140 encePairwiseOnDemand]: 229/246 looper letters, 3204 selfloop transitions, 347 changer transitions 396/4094 dead transitions. [2025-03-14 22:42:12,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 4094 transitions, 169002 flow [2025-03-14 22:42:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:42:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:42:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2696 transitions. [2025-03-14 22:42:12,815 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6849593495934959 [2025-03-14 22:42:12,815 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 303 predicate places. [2025-03-14 22:42:12,815 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 4094 transitions, 169002 flow [2025-03-14 22:42:12,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:42:12,816 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:42:12,816 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:42:12,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-14 22:42:13,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-14 22:42:13,017 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:42:13,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:42:13,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1445417164, now seen corresponding path program 1 times [2025-03-14 22:42:13,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:42:13,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337861814] [2025-03-14 22:42:13,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:42:13,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:42:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:42:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:42:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:42:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337861814] [2025-03-14 22:42:13,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337861814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:42:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730138794] [2025-03-14 22:42:13,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:42:13,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:42:13,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:42:13,465 INFO L229 MonitoredProcess]: Starting monitored process 15 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:42:13,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-14 22:42:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:42:13,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:42:13,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:42:13,730 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 19 treesize of output 7 [2025-03-14 22:42:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:42:13,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:42:13,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:42:13,862 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 20 treesize of output 14 [2025-03-14 22:42:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:42:13,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730138794] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:42:13,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:42:13,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 25 [2025-03-14 22:42:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764460006] [2025-03-14 22:42:13,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:42:13,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 22:42:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:42:13,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 22:42:13,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2025-03-14 22:42:13,901 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 246 [2025-03-14 22:42:13,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 4094 transitions, 169002 flow. Second operand has 25 states, 25 states have (on average 140.8) internal successors, (3520), 25 states have internal predecessors, (3520), 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:42:13,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:42:13,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 246 [2025-03-14 22:42:13,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:42:39,264 INFO L124 PetriNetUnfolderBase]: 21975/42033 cut-off events. [2025-03-14 22:42:39,265 INFO L125 PetriNetUnfolderBase]: For 693507/699608 co-relation queries the response was YES. [2025-03-14 22:42:39,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676355 conditions, 42033 events. 21975/42033 cut-off events. For 693507/699608 co-relation queries the response was YES. Maximal size of possible extension queue 2067. Compared 402677 event pairs, 596 based on Foata normal form. 226/38609 useless extension candidates. Maximal degree in co-relation 635100. Up to 29505 conditions per place. [2025-03-14 22:42:40,493 INFO L140 encePairwiseOnDemand]: 216/246 looper letters, 3521 selfloop transitions, 482 changer transitions 421/4547 dead transitions. [2025-03-14 22:42:40,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 4547 transitions, 197243 flow [2025-03-14 22:42:40,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 22:42:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 22:42:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4934 transitions. [2025-03-14 22:42:40,496 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5899091343854616 [2025-03-14 22:42:40,496 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 336 predicate places. [2025-03-14 22:42:40,496 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 4547 transitions, 197243 flow [2025-03-14 22:42:40,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 140.8) internal successors, (3520), 25 states have internal predecessors, (3520), 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:42:40,497 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:42:40,497 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:42:40,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-14 22:42:40,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:42:40,702 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:42:40,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:42:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1992075139, now seen corresponding path program 2 times [2025-03-14 22:42:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:42:40,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744140436] [2025-03-14 22:42:40,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:42:40,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:42:40,722 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:42:40,722 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:42:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:42:41,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:42:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744140436] [2025-03-14 22:42:41,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744140436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:42:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863969275] [2025-03-14 22:42:41,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:42:41,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:42:41,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:42:41,006 INFO L229 MonitoredProcess]: Starting monitored process 16 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:42:41,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-14 22:42:41,101 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:42:41,101 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:42:41,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-14 22:42:41,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:42:41,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-14 22:42:41,391 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 15 treesize of output 7 [2025-03-14 22:42:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:42:41,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:42:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:42:41,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863969275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:42:41,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:42:41,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 10] total 30 [2025-03-14 22:42:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612215118] [2025-03-14 22:42:41,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:42:41,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 22:42:41,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:42:41,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 22:42:41,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-03-14 22:42:41,594 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 246 [2025-03-14 22:42:41,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 4547 transitions, 197243 flow. Second operand has 30 states, 30 states have (on average 137.36666666666667) internal successors, (4121), 30 states have internal predecessors, (4121), 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:42:41,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:42:41,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 246 [2025-03-14 22:42:41,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:43:16,130 INFO L124 PetriNetUnfolderBase]: 24282/46291 cut-off events. [2025-03-14 22:43:16,130 INFO L125 PetriNetUnfolderBase]: For 830395/837374 co-relation queries the response was YES. [2025-03-14 22:43:16,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781118 conditions, 46291 events. 24282/46291 cut-off events. For 830395/837374 co-relation queries the response was YES. Maximal size of possible extension queue 2268. Compared 448436 event pairs, 596 based on Foata normal form. 109/42315 useless extension candidates. Maximal degree in co-relation 714922. Up to 32654 conditions per place. [2025-03-14 22:43:17,524 INFO L140 encePairwiseOnDemand]: 214/246 looper letters, 4306 selfloop transitions, 400 changer transitions 467/5293 dead transitions. [2025-03-14 22:43:17,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 5293 transitions, 241073 flow [2025-03-14 22:43:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-14 22:43:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-14 22:43:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 6294 transitions. [2025-03-14 22:43:17,527 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5814855875831486 [2025-03-14 22:43:17,528 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 379 predicate places. [2025-03-14 22:43:17,528 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 5293 transitions, 241073 flow [2025-03-14 22:43:17,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 137.36666666666667) internal successors, (4121), 30 states have internal predecessors, (4121), 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:17,529 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:43:17,529 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:43:17,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-14 22:43:17,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:43:17,729 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:43:17,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:43:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash 348056856, now seen corresponding path program 2 times [2025-03-14 22:43:17,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:43:17,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428651764] [2025-03-14 22:43:17,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:43:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:43:17,745 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:43:17,745 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:43:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:43:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:43:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428651764] [2025-03-14 22:43:17,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428651764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:43:17,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45492063] [2025-03-14 22:43:17,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:43:17,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:43:17,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:43:17,996 INFO L229 MonitoredProcess]: Starting monitored process 17 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:17,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-14 22:43:18,091 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:43:18,091 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:43:18,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-14 22:43:18,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:43:18,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-14 22:43:18,376 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 15 treesize of output 7 [2025-03-14 22:43:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:43:18,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:43:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:43:18,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45492063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:43:18,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:43:18,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 10] total 29 [2025-03-14 22:43:18,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928380414] [2025-03-14 22:43:18,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:43:18,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 22:43:18,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:43:18,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 22:43:18,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2025-03-14 22:43:18,578 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 246 [2025-03-14 22:43:18,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 5293 transitions, 241073 flow. Second operand has 29 states, 29 states have (on average 137.3793103448276) internal successors, (3984), 29 states have internal predecessors, (3984), 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:18,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:43:18,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 246 [2025-03-14 22:43:18,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:44:00,554 INFO L124 PetriNetUnfolderBase]: 25303/48064 cut-off events. [2025-03-14 22:44:00,555 INFO L125 PetriNetUnfolderBase]: For 924982/932249 co-relation queries the response was YES. [2025-03-14 22:44:00,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847849 conditions, 48064 events. 25303/48064 cut-off events. For 924982/932249 co-relation queries the response was YES. Maximal size of possible extension queue 2377. Compared 466999 event pairs, 596 based on Foata normal form. 115/43953 useless extension candidates. Maximal degree in co-relation 777229. Up to 34023 conditions per place. [2025-03-14 22:44:02,139 INFO L140 encePairwiseOnDemand]: 216/246 looper letters, 4606 selfloop transitions, 293 changer transitions 485/5504 dead transitions. [2025-03-14 22:44:02,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 5504 transitions, 261701 flow [2025-03-14 22:44:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-14 22:44:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-14 22:44:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4393 transitions. [2025-03-14 22:44:02,142 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5760555992656701 [2025-03-14 22:44:02,142 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 409 predicate places. [2025-03-14 22:44:02,142 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 5504 transitions, 261701 flow [2025-03-14 22:44:02,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 137.3793103448276) internal successors, (3984), 29 states have internal predecessors, (3984), 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:02,143 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:44:02,143 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:44:02,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-14 22:44:02,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-14 22:44:02,344 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:44:02,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:44:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash 255834737, now seen corresponding path program 3 times [2025-03-14 22:44:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:44:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214014642] [2025-03-14 22:44:02,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:44:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:44:02,357 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:44:02,358 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:44:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:44:02,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:44:02,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214014642] [2025-03-14 22:44:02,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214014642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:44:02,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:44:02,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:44:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380802718] [2025-03-14 22:44:02,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:44:02,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:44:02,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:44:02,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:44:02,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:44:02,563 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 246 [2025-03-14 22:44:02,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 5504 transitions, 261701 flow. Second operand has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:02,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:44:02,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 246 [2025-03-14 22:44:02,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:44:49,190 INFO L124 PetriNetUnfolderBase]: 26298/50118 cut-off events. [2025-03-14 22:44:49,191 INFO L125 PetriNetUnfolderBase]: For 1066458/1075963 co-relation queries the response was YES. [2025-03-14 22:44:49,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916694 conditions, 50118 events. 26298/50118 cut-off events. For 1066458/1075963 co-relation queries the response was YES. Maximal size of possible extension queue 2484. Compared 492485 event pairs, 670 based on Foata normal form. 135/45815 useless extension candidates. Maximal degree in co-relation 869687. Up to 35356 conditions per place. [2025-03-14 22:44:50,662 INFO L140 encePairwiseOnDemand]: 229/246 looper letters, 4803 selfloop transitions, 264 changer transitions 510/5724 dead transitions. [2025-03-14 22:44:50,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 5724 transitions, 283569 flow [2025-03-14 22:44:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:44:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:44:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2516 transitions. [2025-03-14 22:44:50,664 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6818428184281843 [2025-03-14 22:44:50,665 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 423 predicate places. [2025-03-14 22:44:50,665 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 5724 transitions, 283569 flow [2025-03-14 22:44:50,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:50,665 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:44:50,665 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:44:50,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 22:44:50,665 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:44:50,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:44:50,666 INFO L85 PathProgramCache]: Analyzing trace with hash 385947264, now seen corresponding path program 2 times [2025-03-14 22:44:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:44:50,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343336811] [2025-03-14 22:44:50,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:44:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:44:50,688 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:44:50,688 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:44:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:44:51,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:44:51,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343336811] [2025-03-14 22:44:51,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343336811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:44:51,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979521571] [2025-03-14 22:44:51,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:44:51,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:44:51,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:44:51,060 INFO L229 MonitoredProcess]: Starting monitored process 18 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:44:51,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-14 22:44:51,148 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:44:51,149 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:44:51,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-14 22:44:51,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:44:51,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-14 22:44:51,539 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 15 treesize of output 7 [2025-03-14 22:44:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:44:51,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:44:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:44:51,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979521571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:44:51,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:44:51,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 10] total 30 [2025-03-14 22:44:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966561591] [2025-03-14 22:44:51,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:44:51,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 22:44:51,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:44:51,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 22:44:51,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2025-03-14 22:44:51,713 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 246 [2025-03-14 22:44:51,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 5724 transitions, 283569 flow. Second operand has 30 states, 30 states have (on average 137.56666666666666) internal successors, (4127), 30 states have internal predecessors, (4127), 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:51,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:44:51,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 246 [2025-03-14 22:44:51,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:45:47,801 INFO L124 PetriNetUnfolderBase]: 27516/52153 cut-off events. [2025-03-14 22:45:47,801 INFO L125 PetriNetUnfolderBase]: For 1190150/1199657 co-relation queries the response was YES. [2025-03-14 22:45:48,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996015 conditions, 52153 events. 27516/52153 cut-off events. For 1190150/1199657 co-relation queries the response was YES. Maximal size of possible extension queue 2599. Compared 513488 event pairs, 651 based on Foata normal form. 103/47653 useless extension candidates. Maximal degree in co-relation 916496. Up to 36994 conditions per place. [2025-03-14 22:45:49,381 INFO L140 encePairwiseOnDemand]: 214/246 looper letters, 5032 selfloop transitions, 301 changer transitions 527/5980 dead transitions. [2025-03-14 22:45:49,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 5980 transitions, 308318 flow [2025-03-14 22:45:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 22:45:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 22:45:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4819 transitions. [2025-03-14 22:45:49,383 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5761597321855572 [2025-03-14 22:45:49,383 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 456 predicate places. [2025-03-14 22:45:49,383 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 5980 transitions, 308318 flow [2025-03-14 22:45:49,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 137.56666666666666) internal successors, (4127), 30 states have internal predecessors, (4127), 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:49,384 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:45:49,384 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:45:49,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-14 22:45:49,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:45:49,585 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:45:49,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:45:49,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1394662577, now seen corresponding path program 4 times [2025-03-14 22:45:49,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:45:49,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984184268] [2025-03-14 22:45:49,586 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:45:49,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:45:49,600 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:45:49,600 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:45:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:45:50,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:45:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984184268] [2025-03-14 22:45:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984184268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:45:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047461430] [2025-03-14 22:45:50,343 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:45:50,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:45:50,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:45:50,346 INFO L229 MonitoredProcess]: Starting monitored process 19 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:45:50,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-14 22:45:50,437 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:45:50,437 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:45:50,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-14 22:45:50,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:45:50,609 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 15 treesize of output 7 [2025-03-14 22:45:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:45:50,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:45:50,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:45:50,714 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 25 treesize of output 16 [2025-03-14 22:45:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:45:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047461430] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:45:50,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:45:50,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 10] total 23 [2025-03-14 22:45:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213905543] [2025-03-14 22:45:50,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:45:50,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 22:45:50,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:45:50,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 22:45:50,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-03-14 22:45:50,781 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 246 [2025-03-14 22:45:50,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 5980 transitions, 308318 flow. Second operand has 23 states, 23 states have (on average 141.08695652173913) internal successors, (3245), 23 states have internal predecessors, (3245), 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:50,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:45:50,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 246 [2025-03-14 22:45:50,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:46:55,517 INFO L124 PetriNetUnfolderBase]: 28508/54006 cut-off events. [2025-03-14 22:46:55,517 INFO L125 PetriNetUnfolderBase]: For 1317958/1328079 co-relation queries the response was YES. [2025-03-14 22:46:55,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070244 conditions, 54006 events. 28508/54006 cut-off events. For 1317958/1328079 co-relation queries the response was YES. Maximal size of possible extension queue 2699. Compared 534379 event pairs, 644 based on Foata normal form. 119/49348 useless extension candidates. Maximal degree in co-relation 986160. Up to 38323 conditions per place. [2025-03-14 22:46:57,160 INFO L140 encePairwiseOnDemand]: 216/246 looper letters, 5232 selfloop transitions, 291 changer transitions 550/6196 dead transitions. [2025-03-14 22:46:57,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 6196 transitions, 331862 flow [2025-03-14 22:46:57,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-14 22:46:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-14 22:46:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4042 transitions. [2025-03-14 22:46:57,162 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5868176538908246 [2025-03-14 22:46:57,162 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 483 predicate places. [2025-03-14 22:46:57,162 INFO L471 AbstractCegarLoop]: Abstraction has has 727 places, 6196 transitions, 331862 flow [2025-03-14 22:46:57,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 141.08695652173913) internal successors, (3245), 23 states have internal predecessors, (3245), 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:46:57,163 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:46:57,163 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:46:57,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-14 22:46:57,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:46:57,363 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:46:57,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:46:57,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1685416905, now seen corresponding path program 1 times [2025-03-14 22:46:57,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:46:57,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95198446] [2025-03-14 22:46:57,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:46:57,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:46:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:46:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:46:57,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:46:57,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95198446] [2025-03-14 22:46:57,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95198446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:46:57,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089318602] [2025-03-14 22:46:57,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:46:57,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:46:57,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:46:57,904 INFO L229 MonitoredProcess]: Starting monitored process 20 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:46:57,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-14 22:46:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:46:58,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:46:58,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:46:58,151 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 19 treesize of output 7 [2025-03-14 22:46:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:46:58,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 22:46:58,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089318602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:46:58,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 22:46:58,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 21 [2025-03-14 22:46:58,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397806642] [2025-03-14 22:46:58,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:46:58,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:46:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:46:58,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:46:58,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-14 22:46:58,186 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 246 [2025-03-14 22:46:58,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 727 places, 6196 transitions, 331862 flow. Second operand has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:46:58,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:46:58,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 246 [2025-03-14 22:46:58,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:48:05,703 INFO L124 PetriNetUnfolderBase]: 29508/55731 cut-off events. [2025-03-14 22:48:05,703 INFO L125 PetriNetUnfolderBase]: For 1467999/1478542 co-relation queries the response was YES. [2025-03-14 22:48:06,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147305 conditions, 55731 events. 29508/55731 cut-off events. For 1467999/1478542 co-relation queries the response was YES. Maximal size of possible extension queue 2802. Compared 553425 event pairs, 702 based on Foata normal form. 117/50902 useless extension candidates. Maximal degree in co-relation 1058506. Up to 39664 conditions per place. [2025-03-14 22:48:07,635 INFO L140 encePairwiseOnDemand]: 229/246 looper letters, 5399 selfloop transitions, 264 changer transitions 570/6380 dead transitions. [2025-03-14 22:48:07,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 741 places, 6380 transitions, 354394 flow [2025-03-14 22:48:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:48:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:48:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2515 transitions. [2025-03-14 22:48:07,637 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6815718157181572 [2025-03-14 22:48:07,637 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 497 predicate places. [2025-03-14 22:48:07,637 INFO L471 AbstractCegarLoop]: Abstraction has has 741 places, 6380 transitions, 354394 flow [2025-03-14 22:48:07,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:48:07,638 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:48:07,638 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:48:07,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-14 22:48:07,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:48:07,838 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:48:07,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:48:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1151518791, now seen corresponding path program 1 times [2025-03-14 22:48:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:48:07,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902870435] [2025-03-14 22:48:07,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:48:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:48:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:48:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:48:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:48:08,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902870435] [2025-03-14 22:48:08,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902870435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:48:08,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580711923] [2025-03-14 22:48:08,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:48:08,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:48:08,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:48:08,431 INFO L229 MonitoredProcess]: Starting monitored process 21 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:48:08,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-14 22:48:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:48:08,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:48:08,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:48:08,703 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 19 treesize of output 7 [2025-03-14 22:48:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:48:08,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:48:08,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:48:08,911 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 20 treesize of output 14 [2025-03-14 22:48:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:48:08,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580711923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:48:08,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:48:08,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 27 [2025-03-14 22:48:08,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937140874] [2025-03-14 22:48:08,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:48:08,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-14 22:48:08,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:48:08,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-14 22:48:08,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2025-03-14 22:48:08,939 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 246 [2025-03-14 22:48:08,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 741 places, 6380 transitions, 354394 flow. Second operand has 27 states, 27 states have (on average 140.7037037037037) internal successors, (3799), 27 states have internal predecessors, (3799), 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:48:08,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:48:08,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 246 [2025-03-14 22:48:08,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:49:24,085 INFO L124 PetriNetUnfolderBase]: 30500/57518 cut-off events. [2025-03-14 22:49:24,086 INFO L125 PetriNetUnfolderBase]: For 1630835/1642490 co-relation queries the response was YES. [2025-03-14 22:49:24,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226812 conditions, 57518 events. 30500/57518 cut-off events. For 1630835/1642490 co-relation queries the response was YES. Maximal size of possible extension queue 2910. Compared 573460 event pairs, 705 based on Foata normal form. 199/52601 useless extension candidates. Maximal degree in co-relation 1133370. Up to 40993 conditions per place. [2025-03-14 22:49:26,106 INFO L140 encePairwiseOnDemand]: 216/246 looper letters, 5330 selfloop transitions, 551 changer transitions 592/6596 dead transitions. [2025-03-14 22:49:26,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 773 places, 6596 transitions, 379602 flow [2025-03-14 22:49:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-14 22:49:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-14 22:49:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4795 transitions. [2025-03-14 22:49:26,109 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5906627248090662 [2025-03-14 22:49:26,109 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 529 predicate places. [2025-03-14 22:49:26,110 INFO L471 AbstractCegarLoop]: Abstraction has has 773 places, 6596 transitions, 379602 flow [2025-03-14 22:49:26,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 140.7037037037037) internal successors, (3799), 27 states have internal predecessors, (3799), 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:49:26,110 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:49:26,110 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:49:26,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-14 22:49:26,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-14 22:49:26,311 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:49:26,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:49:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1893404363, now seen corresponding path program 3 times [2025-03-14 22:49:26,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:49:26,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277454638] [2025-03-14 22:49:26,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:49:26,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:49:26,327 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:49:26,327 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:49:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:49:26,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:49:26,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277454638] [2025-03-14 22:49:26,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277454638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:49:26,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:49:26,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:49:26,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438019238] [2025-03-14 22:49:26,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:49:26,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:49:26,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:49:26,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:49:26,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:49:26,519 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 246 [2025-03-14 22:49:26,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 6596 transitions, 379602 flow. Second operand has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:49:26,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:49:26,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 246 [2025-03-14 22:49:26,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:50:53,343 INFO L124 PetriNetUnfolderBase]: 31397/59570 cut-off events. [2025-03-14 22:50:53,343 INFO L125 PetriNetUnfolderBase]: For 1835391/1849194 co-relation queries the response was YES. [2025-03-14 22:50:53,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305440 conditions, 59570 events. 31397/59570 cut-off events. For 1835391/1849194 co-relation queries the response was YES. Maximal size of possible extension queue 3004. Compared 600475 event pairs, 752 based on Foata normal form. 263/54521 useless extension candidates. Maximal degree in co-relation 1248646. Up to 42194 conditions per place. [2025-03-14 22:50:55,607 INFO L140 encePairwiseOnDemand]: 229/246 looper letters, 5579 selfloop transitions, 452 changer transitions 615/6793 dead transitions. [2025-03-14 22:50:55,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 789 places, 6793 transitions, 404423 flow [2025-03-14 22:50:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:50:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:50:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2851 transitions. [2025-03-14 22:50:55,609 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6817312290769967 [2025-03-14 22:50:55,610 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 545 predicate places. [2025-03-14 22:50:55,610 INFO L471 AbstractCegarLoop]: Abstraction has has 789 places, 6793 transitions, 404423 flow [2025-03-14 22:50:55,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 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:50:55,610 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:50:55,610 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:50:55,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-14 22:50:55,611 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:50:55,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:50:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1106836173, now seen corresponding path program 4 times [2025-03-14 22:50:55,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:50:55,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140497954] [2025-03-14 22:50:55,617 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:50:55,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:50:55,654 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:50:55,654 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:50:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:50:56,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:50:56,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140497954] [2025-03-14 22:50:56,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140497954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:50:56,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100512244] [2025-03-14 22:50:56,253 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:50:56,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:50:56,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:50:56,255 INFO L229 MonitoredProcess]: Starting monitored process 22 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:50:56,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-14 22:50:56,382 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:50:56,383 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:50:56,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-14 22:50:56,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:50:56,735 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 15 treesize of output 7 [2025-03-14 22:50:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:50:56,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:50:56,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:50:56,914 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 20 treesize of output 14 [2025-03-14 22:50:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:50:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100512244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:50:56,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:50:56,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 10] total 25 [2025-03-14 22:50:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701450365] [2025-03-14 22:50:56,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:50:56,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 22:50:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:50:56,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 22:50:56,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2025-03-14 22:50:56,951 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 246 [2025-03-14 22:50:56,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 789 places, 6793 transitions, 404423 flow. Second operand has 25 states, 25 states have (on average 140.96) internal successors, (3524), 25 states have internal predecessors, (3524), 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:50:56,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:50:56,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 246 [2025-03-14 22:50:56,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:52:28,519 INFO L124 PetriNetUnfolderBase]: 31614/59800 cut-off events. [2025-03-14 22:52:28,519 INFO L125 PetriNetUnfolderBase]: For 1960144/1974385 co-relation queries the response was YES. [2025-03-14 22:52:28,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356647 conditions, 59800 events. 31614/59800 cut-off events. For 1960144/1974385 co-relation queries the response was YES. Maximal size of possible extension queue 3024. Compared 601820 event pairs, 776 based on Foata normal form. 239/54711 useless extension candidates. Maximal degree in co-relation 1298117. Up to 42479 conditions per place. [2025-03-14 22:52:30,624 INFO L140 encePairwiseOnDemand]: 216/246 looper letters, 5530 selfloop transitions, 551 changer transitions 634/6838 dead transitions. [2025-03-14 22:52:30,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 822 places, 6838 transitions, 420651 flow [2025-03-14 22:52:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 22:52:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 22:52:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4935 transitions. [2025-03-14 22:52:30,627 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5900286944045912 [2025-03-14 22:52:30,627 INFO L298 CegarLoopForPetriNet]: 244 programPoint places, 578 predicate places. [2025-03-14 22:52:30,627 INFO L471 AbstractCegarLoop]: Abstraction has has 822 places, 6838 transitions, 420651 flow [2025-03-14 22:52:30,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 140.96) internal successors, (3524), 25 states have internal predecessors, (3524), 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:52:30,628 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:52:30,628 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:52:30,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-14 22:52:30,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:52:30,832 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-14 22:52:30,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:52:30,833 INFO L85 PathProgramCache]: Analyzing trace with hash 369453605, now seen corresponding path program 1 times [2025-03-14 22:52:30,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:52:30,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312072789] [2025-03-14 22:52:30,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:52:30,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:52:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:52:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:52:31,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:52:31,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312072789] [2025-03-14 22:52:31,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312072789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:52:31,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977047779] [2025-03-14 22:52:31,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:52:31,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:52:31,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:52:31,321 INFO L229 MonitoredProcess]: Starting monitored process 23 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:52:31,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-14 22:52:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:52:31,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:52:31,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:52:31,560 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 19 treesize of output 7 [2025-03-14 22:52:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:52:31,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:52:31,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:52:31,680 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 20 treesize of output 14 [2025-03-14 22:52:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:52:31,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977047779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:52:31,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:52:31,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 25 [2025-03-14 22:52:31,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241218622] [2025-03-14 22:52:31,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:52:31,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 22:52:31,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:52:31,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 22:52:31,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2025-03-14 22:52:31,707 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 246 [2025-03-14 22:52:31,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 822 places, 6838 transitions, 420651 flow. Second operand has 25 states, 25 states have (on average 140.76) internal successors, (3519), 25 states have internal predecessors, (3519), 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:52:31,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:52:31,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 246 [2025-03-14 22:52:31,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-14 22:52:42,665 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 22:52:42,666 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 22:52:42,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-14 22:52:42,718 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2025-03-14 22:52:42,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-14 22:52:42,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:52:42,920 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). [2025-03-14 22:52:42,925 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 11 remaining) [2025-03-14 22:52:42,926 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 11 remaining) [2025-03-14 22:52:42,926 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 11 remaining) [2025-03-14 22:52:42,926 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 11 remaining) [2025-03-14 22:52:42,926 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-03-14 22:52:42,926 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-03-14 22:52:42,926 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork5Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 11 remaining) [2025-03-14 22:52:42,926 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork5Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 11 remaining) [2025-03-14 22:52:42,926 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining) [2025-03-14 22:52:42,926 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 11 remaining) [2025-03-14 22:52:42,926 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:52:42,937 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 22:52:42,937 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 22:52:42,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 10:52:42 BasicIcfg [2025-03-14 22:52:42,950 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 22:52:42,956 INFO L158 Benchmark]: Toolchain (without parser) took 799830.20ms. Allocated memory was 71.3MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 44.4MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 5.3GB. Max. memory is 8.0GB. [2025-03-14 22:52:42,956 INFO L158 Benchmark]: CDTParser took 1.26ms. Allocated memory is still 71.3MB. Free memory is still 35.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:52:42,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.57ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 31.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-03-14 22:52:42,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.72ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 28.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 22:52:42,956 INFO L158 Benchmark]: Boogie Preprocessor took 29.91ms. Allocated memory is still 71.3MB. Free memory was 28.8MB in the beginning and 26.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:52:42,956 INFO L158 Benchmark]: RCFGBuilder took 695.38ms. Allocated memory is still 71.3MB. Free memory was 26.9MB in the beginning and 24.2MB in the end (delta: 2.7MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. [2025-03-14 22:52:42,956 INFO L158 Benchmark]: TraceAbstraction took 798903.08ms. Allocated memory was 71.3MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 23.0MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2025-03-14 22:52:42,957 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.26ms. Allocated memory is still 71.3MB. Free memory is still 35.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.57ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 31.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.72ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 28.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.91ms. Allocated memory is still 71.3MB. Free memory was 28.8MB in the beginning and 26.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 695.38ms. Allocated memory is still 71.3MB. Free memory was 26.9MB in the beginning and 24.2MB in the end (delta: 2.7MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. * TraceAbstraction took 798903.08ms. Allocated memory was 71.3MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 23.0MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 174]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). - TimeoutResultAtElement [Line: 168]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). - TimeoutResultAtElement [Line: 169]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 136/246 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 156111 conditions, 8564 events (3104/8563 cut-off events. For 483910/492405 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 96460 event pairs, 137 based on Foata normal form. 111/9250 useless extension candidates. Maximal degree in co-relation 115001. Up to 4602 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 318 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 798.7s, OverallIterations: 31, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 768.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7276 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7276 mSDsluCounter, 14465 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13228 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43279 IncrementalHoareTripleChecker+Invalid, 43523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 1237 mSDtfsCounter, 43279 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9258 GetRequests, 8213 SyntacticMatches, 4 SemanticMatches, 1041 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10997 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420651occurred in iteration=30, InterpolantAutomatonStates: 627, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 22.2s InterpolantComputationTime, 10941 NumberOfCodeBlocks, 10893 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 14628 ConstructedInterpolants, 0 QuantifiedInterpolants, 58530 SizeOfPredicates, 329 NumberOfNonLiveVariables, 10992 ConjunctsInSsa, 706 ConjunctsInUnsatCore, 71 InterpolantComputations, 15 PerfectInterpolantSequences, 384/710 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown