/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/chl-name-comparator-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:14:42,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:14:43,048 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:14:43,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:14:43,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:14:43,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:14:43,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:14:43,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:14:43,109 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:14:43,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:14:43,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:14:43,109 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:14:43,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:14:43,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:14:43,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:14:43,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:14:43,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:14:43,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:14:43,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:14:43,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:14:43,110 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:14:43,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:14:43,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:14:43,110 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:14:43,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:14:43,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:14:43,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:14:43,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:14:43,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:14:43,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:14:43,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:14:43,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:14:43,113 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:14:43,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:14:43,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:14:43,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:14:43,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:14:43,377 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:14:43,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2025-03-14 22:14:44,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f45f63ada/e46cfa5945ee4d43984d25ea51660e22/FLAG7b25dd16b [2025-03-14 22:14:44,778 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:14:44,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2025-03-14 22:14:44,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f45f63ada/e46cfa5945ee4d43984d25ea51660e22/FLAG7b25dd16b [2025-03-14 22:14:45,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f45f63ada/e46cfa5945ee4d43984d25ea51660e22 [2025-03-14 22:14:45,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:14:45,150 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:14:45,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:14:45,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:14:45,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:14:45,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c789d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45, skipping insertion in model container [2025-03-14 22:14:45,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:14:45,285 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/chl-name-comparator-trans.wvr.c[4827,4840] [2025-03-14 22:14:45,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:14:45,304 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:14:45,324 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/chl-name-comparator-trans.wvr.c[4827,4840] [2025-03-14 22:14:45,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:14:45,340 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:14:45,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45 WrapperNode [2025-03-14 22:14:45,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:14:45,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:14:45,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:14:45,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:14:45,346 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:14:45" (1/1) ... [2025-03-14 22:14:45,354 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:14:45" (1/1) ... [2025-03-14 22:14:45,385 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 298 [2025-03-14 22:14:45,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:14:45,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:14:45,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:14:45,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:14:45,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:14:45,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:14:45,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:14:45,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:14:45,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45" (1/1) ... [2025-03-14 22:14:45,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:14:45,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:14:45,446 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:14:45,450 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:14:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:14:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:14:45,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:14:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:14:45,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:14:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 22:14:45,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 22:14:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:14:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 22:14:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 22:14:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:14:45,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:14:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 22:14:45,470 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:14:45,546 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:14:45,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:14:45,890 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:14:45,890 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:14:45,906 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:14:45,906 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-14 22:14:45,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:14:45 BoogieIcfgContainer [2025-03-14 22:14:45,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:14:45,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:14:45,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:14:45,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:14:45,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:14:45" (1/3) ... [2025-03-14 22:14:45,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34316eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:14:45, skipping insertion in model container [2025-03-14 22:14:45,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:45" (2/3) ... [2025-03-14 22:14:45,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34316eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:14:45, skipping insertion in model container [2025-03-14 22:14:45,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:14:45" (3/3) ... [2025-03-14 22:14:45,914 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2025-03-14 22:14:45,924 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:14:45,926 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-trans.wvr.c that has 4 procedures, 360 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-14 22:14:45,926 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:14:46,033 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 22:14:46,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:14:46,081 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;@560d63bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:14:46,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 22:14:46,210 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:14:46,210 INFO L124 PetriNetUnfolderBase]: 25/375 cut-off events. [2025-03-14 22:14:46,215 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 22:14:46,215 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:46,216 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:46,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:46,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1555521311, now seen corresponding path program 1 times [2025-03-14 22:14:46,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:46,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881894651] [2025-03-14 22:14:46,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:46,474 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:14:46,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:46,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881894651] [2025-03-14 22:14:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881894651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:46,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:46,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 22:14:46,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158739701] [2025-03-14 22:14:46,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:46,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 22:14:46,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:46,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 22:14:46,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 22:14:46,504 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 384 [2025-03-14 22:14:46,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 384 transitions, 789 flow. Second operand has 2 states, 2 states have (on average 363.5) internal successors, (727), 2 states have internal predecessors, (727), 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:14:46,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:46,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 384 [2025-03-14 22:14:46,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:46,612 INFO L124 PetriNetUnfolderBase]: 7/358 cut-off events. [2025-03-14 22:14:46,612 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-14 22:14:46,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 358 events. 7/358 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 866 event pairs, 0 based on Foata normal form. 34/370 useless extension candidates. Maximal degree in co-relation 282. Up to 7 conditions per place. [2025-03-14 22:14:46,625 INFO L140 encePairwiseOnDemand]: 365/384 looper letters, 6 selfloop transitions, 0 changer transitions 3/358 dead transitions. [2025-03-14 22:14:46,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 358 transitions, 746 flow [2025-03-14 22:14:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 22:14:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 22:14:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 743 transitions. [2025-03-14 22:14:46,641 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9674479166666666 [2025-03-14 22:14:46,647 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, -7 predicate places. [2025-03-14 22:14:46,647 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 358 transitions, 746 flow [2025-03-14 22:14:46,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 363.5) internal successors, (727), 2 states have internal predecessors, (727), 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:14:46,648 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:46,648 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:46,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:14:46,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:46,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash 644991549, now seen corresponding path program 1 times [2025-03-14 22:14:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:46,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645944355] [2025-03-14 22:14:46,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:46,984 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:14:46,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:46,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645944355] [2025-03-14 22:14:46,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645944355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:46,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:46,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 22:14:46,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412120291] [2025-03-14 22:14:46,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:46,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 22:14:46,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:46,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 22:14:46,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 22:14:46,990 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 344 out of 384 [2025-03-14 22:14:46,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 358 transitions, 746 flow. Second operand has 5 states, 5 states have (on average 347.4) internal successors, (1737), 5 states have internal predecessors, (1737), 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:14:46,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:46,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 344 of 384 [2025-03-14 22:14:46,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:47,089 INFO L124 PetriNetUnfolderBase]: 7/365 cut-off events. [2025-03-14 22:14:47,089 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-14 22:14:47,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 365 events. 7/365 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 863 event pairs, 0 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 310. Up to 11 conditions per place. [2025-03-14 22:14:47,095 INFO L140 encePairwiseOnDemand]: 377/384 looper letters, 19 selfloop transitions, 6 changer transitions 3/362 dead transitions. [2025-03-14 22:14:47,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 362 transitions, 804 flow [2025-03-14 22:14:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 22:14:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 22:14:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1746 transitions. [2025-03-14 22:14:47,099 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.909375 [2025-03-14 22:14:47,100 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, -3 predicate places. [2025-03-14 22:14:47,100 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 362 transitions, 804 flow [2025-03-14 22:14:47,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 347.4) internal successors, (1737), 5 states have internal predecessors, (1737), 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:14:47,104 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:47,104 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:47,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:14:47,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:47,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash 773512054, now seen corresponding path program 1 times [2025-03-14 22:14:47,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:47,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728179334] [2025-03-14 22:14:47,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:47,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:47,390 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:14:47,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:47,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728179334] [2025-03-14 22:14:47,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728179334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:14:47,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136188922] [2025-03-14 22:14:47,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:47,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:14:47,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:14:47,394 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:14:47,398 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:14:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:47,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 22:14:47,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:14:47,643 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:14:47,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:14:47,738 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:14:47,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136188922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:14:47,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:14:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-14 22:14:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851093081] [2025-03-14 22:14:47,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:14:47,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:14:47,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:47,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:14:47,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:14:47,748 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 384 [2025-03-14 22:14:47,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 362 transitions, 804 flow. Second operand has 14 states, 14 states have (on average 346.0) internal successors, (4844), 14 states have internal predecessors, (4844), 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:14:47,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:47,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 384 [2025-03-14 22:14:47,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:47,935 INFO L124 PetriNetUnfolderBase]: 7/375 cut-off events. [2025-03-14 22:14:47,935 INFO L125 PetriNetUnfolderBase]: For 48/62 co-relation queries the response was YES. [2025-03-14 22:14:47,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 375 events. 7/375 cut-off events. For 48/62 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 853 event pairs, 0 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 354. Up to 16 conditions per place. [2025-03-14 22:14:47,937 INFO L140 encePairwiseOnDemand]: 374/384 looper letters, 20 selfloop transitions, 13 changer transitions 3/369 dead transitions. [2025-03-14 22:14:47,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 369 transitions, 894 flow [2025-03-14 22:14:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 22:14:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 22:14:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3808 transitions. [2025-03-14 22:14:47,943 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9015151515151515 [2025-03-14 22:14:47,943 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, 7 predicate places. [2025-03-14 22:14:47,944 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 369 transitions, 894 flow [2025-03-14 22:14:47,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 346.0) internal successors, (4844), 14 states have internal predecessors, (4844), 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:14:47,946 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:47,946 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:47,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 22:14:48,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:14:48,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:48,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash 838104598, now seen corresponding path program 2 times [2025-03-14 22:14:48,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:48,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689277265] [2025-03-14 22:14:48,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:14:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:48,188 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:14:48,188 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:48,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:48,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689277265] [2025-03-14 22:14:48,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689277265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:48,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:48,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:14:48,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097517018] [2025-03-14 22:14:48,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:48,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:14:48,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:48,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:14:48,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:14:48,467 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 384 [2025-03-14 22:14:48,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 369 transitions, 894 flow. Second operand has 10 states, 10 states have (on average 299.2) internal successors, (2992), 10 states have internal predecessors, (2992), 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:14:48,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:48,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 384 [2025-03-14 22:14:48,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:51,189 INFO L124 PetriNetUnfolderBase]: 5231/17944 cut-off events. [2025-03-14 22:14:51,189 INFO L125 PetriNetUnfolderBase]: For 6497/6497 co-relation queries the response was YES. [2025-03-14 22:14:51,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28449 conditions, 17944 events. 5231/17944 cut-off events. For 6497/6497 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 215773 event pairs, 1844 based on Foata normal form. 0/16377 useless extension candidates. Maximal degree in co-relation 27587. Up to 3051 conditions per place. [2025-03-14 22:14:51,342 INFO L140 encePairwiseOnDemand]: 365/384 looper letters, 168 selfloop transitions, 14 changer transitions 9/489 dead transitions. [2025-03-14 22:14:51,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 489 transitions, 1660 flow [2025-03-14 22:14:51,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 22:14:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 22:14:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3720 transitions. [2025-03-14 22:14:51,349 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8072916666666666 [2025-03-14 22:14:51,350 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, 18 predicate places. [2025-03-14 22:14:51,350 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 489 transitions, 1660 flow [2025-03-14 22:14:51,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 299.2) internal successors, (2992), 10 states have internal predecessors, (2992), 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:14:51,351 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:51,352 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:51,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:14:51,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:51,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash 812317840, now seen corresponding path program 1 times [2025-03-14 22:14:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:51,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861821388] [2025-03-14 22:14:51,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:51,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:51,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:51,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861821388] [2025-03-14 22:14:51,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861821388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:51,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:51,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:14:51,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238380922] [2025-03-14 22:14:51,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:51,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:14:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:51,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:14:51,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:14:51,816 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 384 [2025-03-14 22:14:51,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 489 transitions, 1660 flow. Second operand has 10 states, 10 states have (on average 299.5) internal successors, (2995), 10 states have internal predecessors, (2995), 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:14:51,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:51,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 384 [2025-03-14 22:14:51,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:58,602 INFO L124 PetriNetUnfolderBase]: 18396/64227 cut-off events. [2025-03-14 22:14:58,603 INFO L125 PetriNetUnfolderBase]: For 47133/51387 co-relation queries the response was YES. [2025-03-14 22:14:58,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120646 conditions, 64227 events. 18396/64227 cut-off events. For 47133/51387 co-relation queries the response was YES. Maximal size of possible extension queue 1751. Compared 908781 event pairs, 3967 based on Foata normal form. 169/57709 useless extension candidates. Maximal degree in co-relation 118914. Up to 9432 conditions per place. [2025-03-14 22:14:59,110 INFO L140 encePairwiseOnDemand]: 364/384 looper letters, 499 selfloop transitions, 40 changer transitions 55/904 dead transitions. [2025-03-14 22:14:59,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 904 transitions, 4997 flow [2025-03-14 22:14:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 22:14:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 22:14:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 4012 transitions. [2025-03-14 22:14:59,118 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8036858974358975 [2025-03-14 22:14:59,120 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, 30 predicate places. [2025-03-14 22:14:59,121 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 904 transitions, 4997 flow [2025-03-14 22:14:59,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 299.5) internal successors, (2995), 10 states have internal predecessors, (2995), 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:14:59,122 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:59,122 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:59,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 22:14:59,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:59,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1937530416, now seen corresponding path program 1 times [2025-03-14 22:14:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:59,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520360284] [2025-03-14 22:14:59,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:59,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:15:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:15:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:15:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520360284] [2025-03-14 22:15:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520360284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:15:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588073665] [2025-03-14 22:15:01,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:15:01,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:15:01,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:15:01,573 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:15:01,575 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:15:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:15:01,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-14 22:15:01,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:15:02,819 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:15:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:15:03,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:15:04,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:15:04,928 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 37 treesize of output 29 [2025-03-14 22:15:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:15:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588073665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:15:05,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:15:05,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 31] total 90 [2025-03-14 22:15:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854654167] [2025-03-14 22:15:05,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:15:05,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2025-03-14 22:15:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:15:05,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2025-03-14 22:15:05,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=7402, Unknown=0, NotChecked=0, Total=8010 [2025-03-14 22:15:05,435 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 384 [2025-03-14 22:15:05,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 904 transitions, 4997 flow. Second operand has 90 states, 90 states have (on average 166.2) internal successors, (14958), 90 states have internal predecessors, (14958), 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:15:05,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:15:05,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 384 [2025-03-14 22:15:05,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand