/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/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 21:31:44,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 21:31:45,023 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 21:31:45,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 21:31:45,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 21:31:45,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 21:31:45,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 21:31:45,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 21:31:45,056 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 21:31:45,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 21:31:45,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 21:31:45,057 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 21:31:45,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 21:31:45,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:31:45,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 21:31:45,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 21:31:45,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 21:31:45,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 21:31:45,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 21:31:45,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 21:31:45,057 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 21:31:45,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 21:31:45,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 21:31:45,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 21:31:45,294 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 21:31:45,294 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 21:31:45,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2025-03-14 21:31:46,487 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2542072d/d422e272bd0d4fc7b4fc7e5fb4866444/FLAGd51f4ca03 [2025-03-14 21:31:46,685 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 21:31:46,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2025-03-14 21:31:46,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2542072d/d422e272bd0d4fc7b4fc7e5fb4866444/FLAGd51f4ca03 [2025-03-14 21:31:46,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2542072d/d422e272bd0d4fc7b4fc7e5fb4866444 [2025-03-14 21:31:46,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 21:31:46,719 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 21:31:46,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 21:31:46,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 21:31:46,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 21:31:46,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:31:46" (1/1) ... [2025-03-14 21:31:46,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2c2ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:46, skipping insertion in model container [2025-03-14 21:31:46,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:31:46" (1/1) ... [2025-03-14 21:31:46,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 21:31:47,043 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2025-03-14 21:31:47,049 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2025-03-14 21:31:47,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:31:47,084 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 21:31:47,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2025-03-14 21:31:47,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2025-03-14 21:31:47,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:31:47,254 INFO L204 MainTranslator]: Completed translation [2025-03-14 21:31:47,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47 WrapperNode [2025-03-14 21:31:47,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 21:31:47,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 21:31:47,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 21:31:47,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 21:31:47,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,361 INFO L138 Inliner]: procedures = 274, calls = 852, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 991 [2025-03-14 21:31:47,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 21:31:47,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 21:31:47,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 21:31:47,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 21:31:47,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 21:31:47,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 21:31:47,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 21:31:47,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 21:31:47,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (1/1) ... [2025-03-14 21:31:47,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:31:47,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:31:47,461 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 21:31:47,464 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 21:31:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-14 21:31:47,480 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-14 21:31:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-14 21:31:47,480 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-14 21:31:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 21:31:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 21:31:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 21:31:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 21:31:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 21:31:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 21:31:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 21:31:47,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 21:31:47,483 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 21:31:47,590 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 21:31:47,591 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 21:31:48,609 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 21:31:48,609 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 21:31:48,651 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 21:31:48,651 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 21:31:48,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:31:48 BoogieIcfgContainer [2025-03-14 21:31:48,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 21:31:48,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 21:31:48,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 21:31:48,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 21:31:48,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 09:31:46" (1/3) ... [2025-03-14 21:31:48,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31894427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:31:48, skipping insertion in model container [2025-03-14 21:31:48,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:31:47" (2/3) ... [2025-03-14 21:31:48,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31894427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:31:48, skipping insertion in model container [2025-03-14 21:31:48,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:31:48" (3/3) ... [2025-03-14 21:31:48,660 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2025-03-14 21:31:48,672 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 21:31:48,676 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longer.i that has 3 procedures, 1009 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-14 21:31:48,676 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 21:31:48,786 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 21:31:48,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:31:48,843 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;@6b080ef1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:31:48,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 21:31:49,112 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:31:49,113 INFO L124 PetriNetUnfolderBase]: 1/860 cut-off events. [2025-03-14 21:31:49,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 21:31:49,114 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:31:49,115 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:49,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:31:49,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:31:49,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2090811861, now seen corresponding path program 1 times [2025-03-14 21:31:49,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:31:49,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723030485] [2025-03-14 21:31:49,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:31:49,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:31:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:31:49,808 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 21:31:49,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:31:49,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723030485] [2025-03-14 21:31:49,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723030485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:31:49,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:31:49,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 21:31:49,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489700741] [2025-03-14 21:31:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:31:49,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 21:31:49,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:31:49,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 21:31:49,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 21:31:49,853 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1006 out of 1019 [2025-03-14 21:31:49,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1019 transitions, 2052 flow. Second operand has 2 states, 2 states have (on average 1006.5) internal successors, (2013), 2 states have internal predecessors, (2013), 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 21:31:49,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:31:49,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1006 of 1019 [2025-03-14 21:31:49,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:31:50,177 INFO L124 PetriNetUnfolderBase]: 26/1173 cut-off events. [2025-03-14 21:31:50,177 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 21:31:50,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 1173 events. 26/1173 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1272 event pairs, 8 based on Foata normal form. 2/1155 useless extension candidates. Maximal degree in co-relation 927. Up to 25 conditions per place. [2025-03-14 21:31:50,192 INFO L140 encePairwiseOnDemand]: 1017/1019 looper letters, 7 selfloop transitions, 0 changer transitions 8/1010 dead transitions. [2025-03-14 21:31:50,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 1010 transitions, 2048 flow [2025-03-14 21:31:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 21:31:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 21:31:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2022 transitions. [2025-03-14 21:31:50,210 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9921491658488715 [2025-03-14 21:31:50,213 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, -6 predicate places. [2025-03-14 21:31:50,213 INFO L471 AbstractCegarLoop]: Abstraction has has 1009 places, 1010 transitions, 2048 flow [2025-03-14 21:31:50,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1006.5) internal successors, (2013), 2 states have internal predecessors, (2013), 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 21:31:50,215 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:31:50,215 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:50,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 21:31:50,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:31:50,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:31:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -856294291, now seen corresponding path program 1 times [2025-03-14 21:31:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:31:50,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469997306] [2025-03-14 21:31:50,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:31:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:31:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:31:51,337 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 21:31:51,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:31:51,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469997306] [2025-03-14 21:31:51,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469997306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:31:51,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:31:51,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:31:51,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161734903] [2025-03-14 21:31:51,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:31:51,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:31:51,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:31:51,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:31:51,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:31:51,346 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1000 out of 1019 [2025-03-14 21:31:51,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 1010 transitions, 2048 flow. Second operand has 3 states, 3 states have (on average 1002.0) internal successors, (3006), 3 states have internal predecessors, (3006), 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 21:31:51,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:31:51,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1000 of 1019 [2025-03-14 21:31:51,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:31:51,649 INFO L124 PetriNetUnfolderBase]: 48/1374 cut-off events. [2025-03-14 21:31:51,650 INFO L125 PetriNetUnfolderBase]: For 93/99 co-relation queries the response was YES. [2025-03-14 21:31:51,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 1374 events. 48/1374 cut-off events. For 93/99 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2522 event pairs, 13 based on Foata normal form. 0/1338 useless extension candidates. Maximal degree in co-relation 939. Up to 50 conditions per place. [2025-03-14 21:31:51,657 INFO L140 encePairwiseOnDemand]: 1015/1019 looper letters, 11 selfloop transitions, 2 changer transitions 16/1017 dead transitions. [2025-03-14 21:31:51,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1011 places, 1017 transitions, 2125 flow [2025-03-14 21:31:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:31:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:31:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3022 transitions. [2025-03-14 21:31:51,664 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9885508668629375 [2025-03-14 21:31:51,664 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, -4 predicate places. [2025-03-14 21:31:51,664 INFO L471 AbstractCegarLoop]: Abstraction has has 1011 places, 1017 transitions, 2125 flow [2025-03-14 21:31:51,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.0) internal successors, (3006), 3 states have internal predecessors, (3006), 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 21:31:51,666 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:31:51,666 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:51,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 21:31:51,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:31:51,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:31:51,671 INFO L85 PathProgramCache]: Analyzing trace with hash 600350709, now seen corresponding path program 1 times [2025-03-14 21:31:51,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:31:51,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743712475] [2025-03-14 21:31:51,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:31:51,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:31:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:31:52,031 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 21:31:52,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:31:52,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743712475] [2025-03-14 21:31:52,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743712475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:31:52,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:31:52,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:31:52,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188275] [2025-03-14 21:31:52,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:31:52,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:31:52,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:31:52,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:31:52,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:31:52,038 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 999 out of 1019 [2025-03-14 21:31:52,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 1017 transitions, 2125 flow. Second operand has 3 states, 3 states have (on average 1001.3333333333334) internal successors, (3004), 3 states have internal predecessors, (3004), 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 21:31:52,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:31:52,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 999 of 1019 [2025-03-14 21:31:52,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:31:52,344 INFO L124 PetriNetUnfolderBase]: 84/1553 cut-off events. [2025-03-14 21:31:52,344 INFO L125 PetriNetUnfolderBase]: For 308/328 co-relation queries the response was YES. [2025-03-14 21:31:52,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 1553 events. 84/1553 cut-off events. For 308/328 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3263 event pairs, 31 based on Foata normal form. 0/1511 useless extension candidates. Maximal degree in co-relation 992. Up to 99 conditions per place. [2025-03-14 21:31:52,348 INFO L140 encePairwiseOnDemand]: 1016/1019 looper letters, 21 selfloop transitions, 2 changer transitions 15/1024 dead transitions. [2025-03-14 21:31:52,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 1024 transitions, 2210 flow [2025-03-14 21:31:52,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:31:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:31:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3020 transitions. [2025-03-14 21:31:52,353 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9878966306836768 [2025-03-14 21:31:52,354 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, -2 predicate places. [2025-03-14 21:31:52,354 INFO L471 AbstractCegarLoop]: Abstraction has has 1013 places, 1024 transitions, 2210 flow [2025-03-14 21:31:52,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1001.3333333333334) internal successors, (3004), 3 states have internal predecessors, (3004), 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 21:31:52,355 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:31:52,356 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:52,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 21:31:52,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:31:52,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:31:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash -124556513, now seen corresponding path program 1 times [2025-03-14 21:31:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:31:52,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650598958] [2025-03-14 21:31:52,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:31:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:31:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:31:52,986 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 21:31:52,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:31:52,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650598958] [2025-03-14 21:31:52,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650598958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:31:52,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673271844] [2025-03-14 21:31:52,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:31:52,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:31:52,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:31:52,989 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 21:31:52,992 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 21:31:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:31:53,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 1941 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 21:31:53,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:31:53,427 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 11 treesize of output 7 [2025-03-14 21:31:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:31:53,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 21:31:53,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673271844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:31:53,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:31:53,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-14 21:31:53,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658005462] [2025-03-14 21:31:53,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:31:53,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:31:53,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:31:53,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:31:53,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 21:31:53,450 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 999 out of 1019 [2025-03-14 21:31:53,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1013 places, 1024 transitions, 2210 flow. Second operand has 3 states, 3 states have (on average 1002.6666666666666) internal successors, (3008), 3 states have internal predecessors, (3008), 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 21:31:53,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:31:53,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 999 of 1019 [2025-03-14 21:31:53,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:31:53,691 INFO L124 PetriNetUnfolderBase]: 45/1356 cut-off events. [2025-03-14 21:31:53,691 INFO L125 PetriNetUnfolderBase]: For 433/455 co-relation queries the response was YES. [2025-03-14 21:31:53,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 1356 events. 45/1356 cut-off events. For 433/455 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1933 event pairs, 6 based on Foata normal form. 12/1342 useless extension candidates. Maximal degree in co-relation 1003. Up to 68 conditions per place. [2025-03-14 21:31:53,696 INFO L140 encePairwiseOnDemand]: 1015/1019 looper letters, 15 selfloop transitions, 3 changer transitions 19/1026 dead transitions. [2025-03-14 21:31:53,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1015 places, 1026 transitions, 2290 flow [2025-03-14 21:31:53,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:31:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:31:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3016 transitions. [2025-03-14 21:31:53,702 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9865881583251553 [2025-03-14 21:31:53,703 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, 0 predicate places. [2025-03-14 21:31:53,703 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1026 transitions, 2290 flow [2025-03-14 21:31:53,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.6666666666666) internal successors, (3008), 3 states have internal predecessors, (3008), 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 21:31:53,705 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:31:53,705 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:53,715 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 21:31:53,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:31:53,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:31:53,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:31:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash 874885356, now seen corresponding path program 1 times [2025-03-14 21:31:53,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:31:53,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132512950] [2025-03-14 21:31:53,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:31:53,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:31:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:31:54,310 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 21:31:54,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:31:54,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132512950] [2025-03-14 21:31:54,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132512950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:31:54,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435021573] [2025-03-14 21:31:54,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:31:54,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:31:54,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:31:54,313 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 21:31:54,315 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 21:31:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:31:54,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 1947 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 21:31:54,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:31:54,705 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 21:31:54,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:31:54,774 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 21:31:54,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435021573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:31:54,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:31:54,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 21:31:54,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335667818] [2025-03-14 21:31:54,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:31:54,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:31:54,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:31:54,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:31:54,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:31:54,782 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 998 out of 1019 [2025-03-14 21:31:54,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1026 transitions, 2290 flow. Second operand has 10 states, 10 states have (on average 1000.5) internal successors, (10005), 10 states have internal predecessors, (10005), 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 21:31:54,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:31:54,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 998 of 1019 [2025-03-14 21:31:54,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:31:55,094 INFO L124 PetriNetUnfolderBase]: 56/1487 cut-off events. [2025-03-14 21:31:55,095 INFO L125 PetriNetUnfolderBase]: For 600/632 co-relation queries the response was YES. [2025-03-14 21:31:55,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 1487 events. 56/1487 cut-off events. For 600/632 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1948 event pairs, 6 based on Foata normal form. 0/1458 useless extension candidates. Maximal degree in co-relation 1072. Up to 91 conditions per place. [2025-03-14 21:31:55,098 INFO L140 encePairwiseOnDemand]: 1013/1019 looper letters, 27 selfloop transitions, 9 changer transitions 19/1039 dead transitions. [2025-03-14 21:31:55,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1039 transitions, 2480 flow [2025-03-14 21:31:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 21:31:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 21:31:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9018 transitions. [2025-03-14 21:31:55,113 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9833169774288518 [2025-03-14 21:31:55,114 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, 8 predicate places. [2025-03-14 21:31:55,114 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1039 transitions, 2480 flow [2025-03-14 21:31:55,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1000.5) internal successors, (10005), 10 states have internal predecessors, (10005), 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 21:31:55,118 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:31:55,119 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:55,131 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 21:31:55,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:31:55,320 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:31:55,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:31:55,322 INFO L85 PathProgramCache]: Analyzing trace with hash 437257910, now seen corresponding path program 2 times [2025-03-14 21:31:55,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:31:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351431714] [2025-03-14 21:31:55,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:31:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:31:55,444 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:31:55,444 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:31:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-14 21:31:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:31:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351431714] [2025-03-14 21:31:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351431714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:31:57,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:31:57,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 21:31:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225218068] [2025-03-14 21:31:57,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:31:57,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 21:31:57,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:31:57,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 21:31:57,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-14 21:31:57,947 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 1019 [2025-03-14 21:31:57,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1039 transitions, 2480 flow. Second operand has 13 states, 13 states have (on average 216.6153846153846) internal successors, (2816), 13 states have internal predecessors, (2816), 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 21:31:57,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:31:57,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 1019 [2025-03-14 21:31:57,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:00,614 INFO L124 PetriNetUnfolderBase]: 94/1542 cut-off events. [2025-03-14 21:32:00,614 INFO L125 PetriNetUnfolderBase]: For 1814/1860 co-relation queries the response was YES. [2025-03-14 21:32:00,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3352 conditions, 1542 events. 94/1542 cut-off events. For 1814/1860 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2601 event pairs, 18 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 1931. Up to 584 conditions per place. [2025-03-14 21:32:00,620 INFO L140 encePairwiseOnDemand]: 1003/1019 looper letters, 861 selfloop transitions, 15 changer transitions 24/1044 dead transitions. [2025-03-14 21:32:00,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1032 places, 1044 transitions, 4341 flow [2025-03-14 21:32:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 21:32:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 21:32:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2833 transitions. [2025-03-14 21:32:00,629 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.2138597418283385 [2025-03-14 21:32:00,629 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, 17 predicate places. [2025-03-14 21:32:00,629 INFO L471 AbstractCegarLoop]: Abstraction has has 1032 places, 1044 transitions, 4341 flow [2025-03-14 21:32:00,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 216.6153846153846) internal successors, (2816), 13 states have internal predecessors, (2816), 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 21:32:00,631 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:00,631 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:00,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 21:32:00,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:32:00,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1647061241, now seen corresponding path program 1 times [2025-03-14 21:32:00,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:00,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311984220] [2025-03-14 21:32:00,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:00,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:01,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:01,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311984220] [2025-03-14 21:32:01,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311984220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:32:01,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45870362] [2025-03-14 21:32:01,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:01,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:01,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:32:01,177 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 21:32:01,179 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 21:32:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:01,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 2080 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 21:32:01,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:32:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:01,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:32:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:01,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45870362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:32:01,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:32:01,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 21:32:01,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428013511] [2025-03-14 21:32:01,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:32:01,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 21:32:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:01,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 21:32:01,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-14 21:32:01,726 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 998 out of 1019 [2025-03-14 21:32:01,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 1044 transitions, 4341 flow. Second operand has 18 states, 18 states have (on average 1000.5) internal successors, (18009), 18 states have internal predecessors, (18009), 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 21:32:01,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:01,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 998 of 1019 [2025-03-14 21:32:01,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:02,351 INFO L124 PetriNetUnfolderBase]: 162/2060 cut-off events. [2025-03-14 21:32:02,352 INFO L125 PetriNetUnfolderBase]: For 3751/3817 co-relation queries the response was YES. [2025-03-14 21:32:02,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4821 conditions, 2060 events. 162/2060 cut-off events. For 3751/3817 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4581 event pairs, 20 based on Foata normal form. 0/2020 useless extension candidates. Maximal degree in co-relation 2726. Up to 760 conditions per place. [2025-03-14 21:32:02,362 INFO L140 encePairwiseOnDemand]: 1013/1019 looper letters, 53 selfloop transitions, 21 changer transitions 23/1080 dead transitions. [2025-03-14 21:32:02,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1052 places, 1080 transitions, 4905 flow [2025-03-14 21:32:02,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 21:32:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 21:32:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21028 transitions. [2025-03-14 21:32:02,383 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9826627412495911 [2025-03-14 21:32:02,385 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, 37 predicate places. [2025-03-14 21:32:02,385 INFO L471 AbstractCegarLoop]: Abstraction has has 1052 places, 1080 transitions, 4905 flow [2025-03-14 21:32:02,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1000.5) internal successors, (18009), 18 states have internal predecessors, (18009), 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 21:32:02,392 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:02,393 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:02,402 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 21:32:02,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:02,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:32:02,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash -283615009, now seen corresponding path program 2 times [2025-03-14 21:32:02,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200434328] [2025-03-14 21:32:02,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:32:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:02,711 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:32:02,711 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:32:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:03,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:03,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200434328] [2025-03-14 21:32:03,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200434328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:32:03,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919051760] [2025-03-14 21:32:03,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:32:03,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:03,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:32:03,688 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 21:32:03,689 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 21:32:04,076 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:32:04,077 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:32:04,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 2340 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 21:32:04,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:32:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:04,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:32:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:04,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919051760] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:32:04,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:32:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-14 21:32:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404369623] [2025-03-14 21:32:04,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:32:04,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 21:32:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:04,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 21:32:04,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 21:32:04,683 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 998 out of 1019 [2025-03-14 21:32:04,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1052 places, 1080 transitions, 4905 flow. Second operand has 34 states, 34 states have (on average 1000.5) internal successors, (34017), 34 states have internal predecessors, (34017), 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 21:32:04,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:04,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 998 of 1019 [2025-03-14 21:32:04,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:06,110 INFO L124 PetriNetUnfolderBase]: 298/3115 cut-off events. [2025-03-14 21:32:06,111 INFO L125 PetriNetUnfolderBase]: For 8098/8184 co-relation queries the response was YES. [2025-03-14 21:32:06,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7967 conditions, 3115 events. 298/3115 cut-off events. For 8098/8184 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 8558 event pairs, 5 based on Foata normal form. 0/3052 useless extension candidates. Maximal degree in co-relation 5833. Up to 1112 conditions per place. [2025-03-14 21:32:06,124 INFO L140 encePairwiseOnDemand]: 1013/1019 looper letters, 101 selfloop transitions, 45 changer transitions 24/1152 dead transitions. [2025-03-14 21:32:06,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1096 places, 1152 transitions, 6149 flow [2025-03-14 21:32:06,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 21:32:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 21:32:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45048 transitions. [2025-03-14 21:32:06,150 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9824010467778869 [2025-03-14 21:32:06,150 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, 81 predicate places. [2025-03-14 21:32:06,150 INFO L471 AbstractCegarLoop]: Abstraction has has 1096 places, 1152 transitions, 6149 flow [2025-03-14 21:32:06,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1000.5) internal successors, (34017), 34 states have internal predecessors, (34017), 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 21:32:06,201 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:06,202 INFO L221 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:06,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 21:32:06,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:06,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:32:06,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash 648238829, now seen corresponding path program 3 times [2025-03-14 21:32:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:06,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833393299] [2025-03-14 21:32:06,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:32:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:06,575 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-14 21:32:06,575 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:32:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 737 proven. 64 refuted. 0 times theorem prover too weak. 2574 trivial. 0 not checked. [2025-03-14 21:32:10,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833393299] [2025-03-14 21:32:10,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833393299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:32:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74924093] [2025-03-14 21:32:10,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:32:10,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:10,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:32:10,641 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 21:32:10,642 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 21:32:11,088 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-14 21:32:11,089 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:32:11,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 2015 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-14 21:32:11,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:32:14,039 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 21:32:14,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 21:32:14,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-14 21:32:14,297 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-03-14 21:32:14,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2025-03-14 21:32:14,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-14 21:32:14,359 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 21:32:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 482 proven. 319 refuted. 0 times theorem prover too weak. 2574 trivial. 0 not checked. [2025-03-14 21:32:14,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:32:14,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_690 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_690) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 400)) is different from false [2025-03-14 21:32:14,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 21:32:14,615 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-14 21:32:14,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 21:32:14,626 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 35 treesize of output 34 [2025-03-14 21:32:14,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2025-03-14 21:32:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 391 proven. 319 refuted. 0 times theorem prover too weak. 2574 trivial. 91 not checked. [2025-03-14 21:32:15,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74924093] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:32:15,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:32:15,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 12] total 43 [2025-03-14 21:32:15,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67788351] [2025-03-14 21:32:15,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:32:15,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-14 21:32:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:15,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-14 21:32:15,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1543, Unknown=1, NotChecked=80, Total=1806 [2025-03-14 21:32:15,823 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 1019 [2025-03-14 21:32:15,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1096 places, 1152 transitions, 6149 flow. Second operand has 43 states, 43 states have (on average 194.3953488372093) internal successors, (8359), 43 states have internal predecessors, (8359), 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 21:32:15,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:15,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 1019 [2025-03-14 21:32:15,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:22,893 INFO L124 PetriNetUnfolderBase]: 733/5030 cut-off events. [2025-03-14 21:32:22,894 INFO L125 PetriNetUnfolderBase]: For 27619/27743 co-relation queries the response was YES. [2025-03-14 21:32:22,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18550 conditions, 5030 events. 733/5030 cut-off events. For 27619/27743 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 23068 event pairs, 6 based on Foata normal form. 0/4958 useless extension candidates. Maximal degree in co-relation 14908. Up to 1920 conditions per place. [2025-03-14 21:32:22,922 INFO L140 encePairwiseOnDemand]: 998/1019 looper letters, 1140 selfloop transitions, 35 changer transitions 29/1376 dead transitions. [2025-03-14 21:32:22,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1116 places, 1376 transitions, 12161 flow [2025-03-14 21:32:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 21:32:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 21:32:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3758 transitions. [2025-03-14 21:32:22,930 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.17561568297584 [2025-03-14 21:32:22,930 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, 101 predicate places. [2025-03-14 21:32:22,930 INFO L471 AbstractCegarLoop]: Abstraction has has 1116 places, 1376 transitions, 12161 flow [2025-03-14 21:32:22,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 194.3953488372093) internal successors, (8359), 43 states have internal predecessors, (8359), 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 21:32:22,933 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:22,933 INFO L221 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:22,944 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 21:32:23,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:23,134 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:32:23,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1227570103, now seen corresponding path program 1 times [2025-03-14 21:32:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:23,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903039868] [2025-03-14 21:32:23,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:23,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 0 proven. 3375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:25,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:25,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903039868] [2025-03-14 21:32:25,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903039868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:32:25,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408703275] [2025-03-14 21:32:25,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:25,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:25,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:32:25,686 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 21:32:25,686 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 21:32:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:26,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 2900 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 21:32:26,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:32:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 0 proven. 3375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:26,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:32:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 0 proven. 3375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:27,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408703275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:32:27,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:32:27,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2025-03-14 21:32:27,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701237180] [2025-03-14 21:32:27,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:32:27,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-14 21:32:27,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:27,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-14 21:32:27,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2025-03-14 21:32:27,303 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 998 out of 1019 [2025-03-14 21:32:27,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1116 places, 1376 transitions, 12161 flow. Second operand has 66 states, 66 states have (on average 1000.5) internal successors, (66033), 66 states have internal predecessors, (66033), 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 21:32:27,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:27,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 998 of 1019 [2025-03-14 21:32:27,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:32,839 INFO L124 PetriNetUnfolderBase]: 1453/9214 cut-off events. [2025-03-14 21:32:32,839 INFO L125 PetriNetUnfolderBase]: For 64710/64858 co-relation queries the response was YES. [2025-03-14 21:32:32,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36857 conditions, 9214 events. 1453/9214 cut-off events. For 64710/64858 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 46243 event pairs, 46 based on Foata normal form. 0/9095 useless extension candidates. Maximal degree in co-relation 33126. Up to 3504 conditions per place. [2025-03-14 21:32:32,874 INFO L140 encePairwiseOnDemand]: 1013/1019 looper letters, 539 selfloop transitions, 93 changer transitions 30/1696 dead transitions. [2025-03-14 21:32:32,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1208 places, 1696 transitions, 19669 flow [2025-03-14 21:32:32,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-03-14 21:32:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2025-03-14 21:32:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93088 transitions. [2025-03-14 21:32:32,903 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9822828621777623 [2025-03-14 21:32:32,903 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, 193 predicate places. [2025-03-14 21:32:32,903 INFO L471 AbstractCegarLoop]: Abstraction has has 1208 places, 1696 transitions, 19669 flow [2025-03-14 21:32:32,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1000.5) internal successors, (66033), 66 states have internal predecessors, (66033), 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 21:32:32,910 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:32,911 INFO L221 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:32,920 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 21:32:33,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:33,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:32:33,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash -152017277, now seen corresponding path program 2 times [2025-03-14 21:32:33,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:33,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309218567] [2025-03-14 21:32:33,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:32:33,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:33,258 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:32:33,258 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:32:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14911 backedges. 0 proven. 14911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:41,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:41,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309218567] [2025-03-14 21:32:41,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309218567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:32:41,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720802427] [2025-03-14 21:32:41,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:32:41,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:41,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:32:41,375 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 21:32:41,376 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 21:32:41,957 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:32:41,957 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:32:41,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 3980 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-14 21:32:41,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:32:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14911 backedges. 0 proven. 14911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:42,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:32:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14911 backedges. 0 proven. 14911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:45,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720802427] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:32:45,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:32:45,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 130 [2025-03-14 21:32:45,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850015443] [2025-03-14 21:32:45,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:32:45,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2025-03-14 21:32:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:45,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2025-03-14 21:32:45,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2025-03-14 21:32:45,424 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 998 out of 1019 [2025-03-14 21:32:45,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1208 places, 1696 transitions, 19669 flow. Second operand has 130 states, 130 states have (on average 1000.5) internal successors, (130065), 130 states have internal predecessors, (130065), 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 21:32:45,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:45,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 998 of 1019 [2025-03-14 21:32:45,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:33:03,017 INFO L124 PetriNetUnfolderBase]: 2893/17557 cut-off events. [2025-03-14 21:33:03,018 INFO L125 PetriNetUnfolderBase]: For 152026/152198 co-relation queries the response was YES. [2025-03-14 21:33:03,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75739 conditions, 17557 events. 2893/17557 cut-off events. For 152026/152198 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 94255 event pairs, 27 based on Foata normal form. 0/17341 useless extension candidates. Maximal degree in co-relation 71934. Up to 6672 conditions per place. [2025-03-14 21:33:03,176 INFO L140 encePairwiseOnDemand]: 1013/1019 looper letters, 1083 selfloop transitions, 189 changer transitions 29/2336 dead transitions. [2025-03-14 21:33:03,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1396 places, 2336 transitions, 35945 flow [2025-03-14 21:33:03,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2025-03-14 21:33:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2025-03-14 21:33:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189168 transitions. [2025-03-14 21:33:03,313 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9822265837967507 [2025-03-14 21:33:03,313 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, 381 predicate places. [2025-03-14 21:33:03,314 INFO L471 AbstractCegarLoop]: Abstraction has has 1396 places, 2336 transitions, 35945 flow [2025-03-14 21:33:03,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 1000.5) internal successors, (130065), 130 states have internal predecessors, (130065), 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 21:33:03,327 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:33:03,332 INFO L221 CegarLoopForPetriNet]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:33:03,347 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 21:33:03,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:33:03,534 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:33:03,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:33:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1910899023, now seen corresponding path program 3 times [2025-03-14 21:33:03,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:33:03,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788148524] [2025-03-14 21:33:03,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:33:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:33:03,765 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-14 21:33:03,765 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:33:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 62559 backedges. 6517 proven. 936 refuted. 0 times theorem prover too weak. 55106 trivial. 0 not checked. [2025-03-14 21:33:12,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:33:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788148524] [2025-03-14 21:33:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788148524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:33:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423692008] [2025-03-14 21:33:12,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:33:12,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:33:12,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:33:12,843 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 21:33:12,845 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 21:33:14,064 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-14 21:33:14,064 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:33:14,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 2155 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-14 21:33:14,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:33:22,382 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 21:33:22,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 21:33:22,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-14 21:33:22,579 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-03-14 21:33:22,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2025-03-14 21:33:22,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-14 21:33:22,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-14 21:33:22,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 21:33:22,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-14 21:33:22,915 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-03-14 21:33:22,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2025-03-14 21:33:22,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-14 21:33:23,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-14 21:33:23,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 21:33:23,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-14 21:33:23,238 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-03-14 21:33:23,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2025-03-14 21:33:23,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-14 21:33:23,279 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 21:33:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 62559 backedges. 5980 proven. 1473 refuted. 0 times theorem prover too weak. 55106 trivial. 0 not checked. [2025-03-14 21:33:23,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:33:48,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2557 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2552 (Array Int Int)) (v_ArrVal_2556 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2550)))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2552) |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2556) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 v_ArrVal_2556)) |c_~#stored_elements~0.base| v_ArrVal_2557) |c_~#queue~0.base|) .cse1) 400) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) v_ArrVal_2550)))))) is different from false [2025-03-14 21:33:48,417 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2557 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2552 (Array Int Int)) (v_ArrVal_2556 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2550)))) (let ((.cse2 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2552) |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2550) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2556) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_2556)) |c_~#stored_elements~0.base| v_ArrVal_2557) |c_~#queue~0.base|) .cse3) 400))))))) is different from false [2025-03-14 21:33:53,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2557 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2550 Int) (v_ArrVal_2552 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_235| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_312| Int) (v_ArrVal_2556 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_312| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse4 v_ArrVal_2550)))) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2552) |c_~#queue~0.base|))) (let ((.cse1 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_235|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_312| 1)) .cse2 v_ArrVal_2556)) |c_~#stored_elements~0.base| v_ArrVal_2557) |c_~#queue~0.base|) .cse2) 400) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_312|) (< (+ (select .cse5 .cse4) 1) v_ArrVal_2550) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308|) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_2556)))))))) is different from false [2025-03-14 21:34:01,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2547 (Array Int Int)) (v_ArrVal_2557 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2550 Int) (v_ArrVal_2552 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_235| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_312| Int) (v_ArrVal_2556 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2547) |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse3 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 v_ArrVal_2550)) |c_~#stored_elements~0.base| v_ArrVal_2552) |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_235|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_312| 1)) .cse1 v_ArrVal_2556)) |c_~#stored_elements~0.base| v_ArrVal_2557) |c_~#queue~0.base|) .cse1) 400) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_312|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2556) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2550))))))) is different from false [2025-03-14 21:34:02,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 21:34:02,080 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 197 [2025-03-14 21:34:02,120 INFO L349 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2025-03-14 21:34:02,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 307 treesize of output 297 [2025-03-14 21:34:02,126 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2025-03-14 21:34:02,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 21:34:02,187 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 155 treesize of output 147 [2025-03-14 21:34:02,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 34 [2025-03-14 21:34:02,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2025-03-14 21:34:02,245 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 21:34:02,246 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2025-03-14 21:34:02,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 21:34:02,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 52 treesize of output 52 [2025-03-14 21:34:02,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2025-03-14 21:34:02,308 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 21:34:02,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 83 [2025-03-14 21:34:02,313 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 21:34:02,314 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 101 [2025-03-14 21:34:02,316 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 21:34:02,318 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 21:34:02,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 21:34:02,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-14 21:34:02,326 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 21:34:02,327 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-14 21:34:02,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2025-03-14 21:34:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 62559 backedges. 2573 proven. 1449 refuted. 2477 times theorem prover too weak. 55106 trivial. 954 not checked. [2025-03-14 21:34:29,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423692008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:34:29,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:34:29,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 26, 30] total 84 [2025-03-14 21:34:29,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977008994] [2025-03-14 21:34:29,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:34:29,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2025-03-14 21:34:29,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:34:29,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2025-03-14 21:34:29,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=5401, Unknown=194, NotChecked=636, Total=6972 [2025-03-14 21:34:29,767 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 1019 [2025-03-14 21:34:29,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1396 places, 2336 transitions, 35945 flow. Second operand has 84 states, 84 states have (on average 169.98809523809524) internal successors, (14279), 84 states have internal predecessors, (14279), 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 21:34:29,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:34:29,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 1019 [2025-03-14 21:34:29,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:35:52,446 INFO L124 PetriNetUnfolderBase]: 8575/47632 cut-off events. [2025-03-14 21:35:52,446 INFO L125 PetriNetUnfolderBase]: For 525332/525666 co-relation queries the response was YES. [2025-03-14 21:35:52,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245937 conditions, 47632 events. 8575/47632 cut-off events. For 525332/525666 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 382309 event pairs, 138 based on Foata normal form. 0/47383 useless extension candidates. Maximal degree in co-relation 238962. Up to 18346 conditions per place. [2025-03-14 21:35:52,753 INFO L140 encePairwiseOnDemand]: 988/1019 looper letters, 4860 selfloop transitions, 158 changer transitions 53/5449 dead transitions. [2025-03-14 21:35:52,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1457 places, 5449 transitions, 125177 flow [2025-03-14 21:35:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-14 21:35:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-03-14 21:35:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 9629 transitions. [2025-03-14 21:35:52,761 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.15241064927664694 [2025-03-14 21:35:52,762 INFO L298 CegarLoopForPetriNet]: 1015 programPoint places, 442 predicate places. [2025-03-14 21:35:52,762 INFO L471 AbstractCegarLoop]: Abstraction has has 1457 places, 5449 transitions, 125177 flow [2025-03-14 21:35:52,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 169.98809523809524) internal successors, (14279), 84 states have internal predecessors, (14279), 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 21:35:52,764 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:35:52,765 INFO L221 CegarLoopForPetriNet]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 53, 53, 53, 53, 53, 53, 53, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:52,776 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 21:35:52,965 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,SelfDestructingSolverStorable11 [2025-03-14 21:35:52,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 21:35:52,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:35:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1402987096, now seen corresponding path program 4 times [2025-03-14 21:35:52,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:35:52,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143952245] [2025-03-14 21:35:52,972 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 21:35:52,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:35:53,227 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 21:35:53,227 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:36:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 67011 backedges. 0 proven. 67011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:36:32,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:36:32,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143952245] [2025-03-14 21:36:32,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143952245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:36:32,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191603540] [2025-03-14 21:36:32,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 21:36:32,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:36:32,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:36:32,925 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 21:36:32,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process Received shutdown request... [2025-03-14 21:45:45,267 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 21:45:45,267 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 21:45:46,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2025-03-14 21:45:46,471 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forcibly destroying the process [2025-03-14 21:45:46,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 137 [2025-03-14 21:45:46,501 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-14 21:45:46,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:45:46,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2025-03-14 21:45:46,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500518637] [2025-03-14 21:45:46,501 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-14 21:45:46,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2025-03-14 21:45:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:45:46,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2025-03-14 21:45:46,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2025-03-14 21:45:46,591 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 998 out of 1019 [2025-03-14 21:45:46,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1457 places, 5449 transitions, 125177 flow. Second operand has 129 states, 129 states have (on average 1000.5038759689922) internal successors, (129065), 129 states have internal predecessors, (129065), 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 21:45:46,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:45:46,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 998 of 1019 [2025-03-14 21:45:46,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:45:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 21:45:46,655 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-03-14 21:45:46,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 21:45:46,660 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (129states, 998/1019 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 17 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.). [2025-03-14 21:45:46,662 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-14 21:45:46,662 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-14 21:45:46,662 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-14 21:45:46,662 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-14 21:45:46,663 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1] [2025-03-14 21:45:46,673 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 21:45:46,673 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 21:45:46,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 09:45:46 BasicIcfg [2025-03-14 21:45:46,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 21:45:46,685 INFO L158 Benchmark]: Toolchain (without parser) took 839965.54ms. Allocated memory was 71.3MB in the beginning and 2.7GB in the end (delta: 2.7GB). Free memory was 42.3MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-03-14 21:45:46,685 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 71.3MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:45:46,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.36ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 27.3MB in the end (delta: 14.8MB). Peak memory consumption was 26.9MB. Max. memory is 8.0GB. [2025-03-14 21:45:46,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.63ms. Allocated memory is still 71.3MB. Free memory was 27.3MB in the beginning and 36.2MB in the end (delta: -8.9MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2025-03-14 21:45:46,685 INFO L158 Benchmark]: Boogie Preprocessor took 67.41ms. Allocated memory is still 71.3MB. Free memory was 36.2MB in the beginning and 30.1MB in the end (delta: 6.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 21:45:46,685 INFO L158 Benchmark]: RCFGBuilder took 1218.05ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 30.1MB in the beginning and 30.2MB in the end (delta: -186.1kB). Peak memory consumption was 35.4MB. Max. memory is 8.0GB. [2025-03-14 21:45:46,686 INFO L158 Benchmark]: TraceAbstraction took 838030.60ms. Allocated memory was 96.5MB in the beginning and 2.7GB in the end (delta: 2.7GB). Free memory was 29.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-03-14 21:45:46,691 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 71.3MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 534.36ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 27.3MB in the end (delta: 14.8MB). Peak memory consumption was 26.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 108.63ms. Allocated memory is still 71.3MB. Free memory was 27.3MB in the beginning and 36.2MB in the end (delta: -8.9MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.41ms. Allocated memory is still 71.3MB. Free memory was 36.2MB in the beginning and 30.1MB in the end (delta: 6.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1218.05ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 30.1MB in the beginning and 30.2MB in the end (delta: -186.1kB). Peak memory consumption was 35.4MB. Max. memory is 8.0GB. * TraceAbstraction took 838030.60ms. Allocated memory was 96.5MB in the beginning and 2.7GB in the end (delta: 2.7GB). Free memory was 29.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (129states, 998/1019 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 17 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.). - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (129states, 998/1019 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 17 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (129states, 998/1019 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 17 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.). - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (129states, 998/1019 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 17 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1139 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.3s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 837.9s, OverallIterations: 13, TraceHistogramMax: 63, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 120.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5888 SdHoareTripleChecker+Valid, 28.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5888 mSDsluCounter, 3297 SdHoareTripleChecker+Invalid, 25.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5453 IncrementalHoareTripleChecker+Unchecked, 2732 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61101 IncrementalHoareTripleChecker+Invalid, 66788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 565 mSDtfsCounter, 61101 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23948 GetRequests, 23097 SyntacticMatches, 23 SemanticMatches, 828 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 31226 ImplicationChecksByTransitivity, 83.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125177occurred in iteration=12, InterpolantAutomatonStates: 464, 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.7s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 156.1s InterpolantComputationTime, 30861 NumberOfCodeBlocks, 25917 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 41871 ConstructedInterpolants, 88 QuantifiedInterpolants, 152544 SizeOfPredicates, 174 NumberOfNonLiveVariables, 19358 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 189820/322109 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