/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 ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:20:56,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:20:56,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:20:56,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:20:56,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:20:56,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:20:56,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:20:56,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:20:56,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:20:56,540 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:20:56,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:20:56,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:20:56,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:20:56,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:20:56,541 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:20:56,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:20:56,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:20:56,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:20:56,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:20:56,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:20:56,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:20:56,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:20:56,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:20:56,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:20:56,544 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:20:56,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:20:56,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:20:56,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:20:56,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:20:56,767 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:20:56,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs.i [2025-04-13 19:20:58,134 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b59ba0d7/db52d261c4944b07bf34560d8c7cfc7b/FLAGa3d212133 [2025-04-13 19:20:58,408 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:20:58,408 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs.i [2025-04-13 19:20:58,423 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b59ba0d7/db52d261c4944b07bf34560d8c7cfc7b/FLAGa3d212133 [2025-04-13 19:20:59,184 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b59ba0d7/db52d261c4944b07bf34560d8c7cfc7b [2025-04-13 19:20:59,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:20:59,187 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:20:59,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:20:59,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:20:59,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:20:59,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ed212b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59, skipping insertion in model container [2025-04-13 19:20:59,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:20:59,504 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-ext/31_simple_loop5_vs.i[30640,30653] [2025-04-13 19:20:59,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:20:59,525 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:20:59,568 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-ext/31_simple_loop5_vs.i[30640,30653] [2025-04-13 19:20:59,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:20:59,601 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:20:59,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59 WrapperNode [2025-04-13 19:20:59,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:20:59,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:20:59,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:20:59,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:20:59,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,630 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-04-13 19:20:59,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:20:59,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:20:59,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:20:59,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:20:59,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,651 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-04-13 19:20:59,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:20:59,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:20:59,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:20:59,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:20:59,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (1/1) ... [2025-04-13 19:20:59,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:20:59,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:20:59,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:20:59,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:20:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-04-13 19:20:59,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-04-13 19:20:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 19:20:59,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 19:20:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:20:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:20:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:20:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:20:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:20:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:20:59,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:20:59,712 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:20:59,801 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:20:59,802 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:20:59,898 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:20:59,898 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:20:59,898 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:20:59,985 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:20:59,990 INFO L313 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-13 19:20:59,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:20:59 BoogieIcfgContainer [2025-04-13 19:20:59,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:20:59,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:20:59,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:20:59,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:20:59,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:20:59" (1/3) ... [2025-04-13 19:20:59,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18898562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:20:59, skipping insertion in model container [2025-04-13 19:20:59,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:20:59" (2/3) ... [2025-04-13 19:20:59,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18898562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:20:59, skipping insertion in model container [2025-04-13 19:20:59,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:20:59" (3/3) ... [2025-04-13 19:20:59,999 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-04-13 19:21:00,010 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:21:00,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 19 locations, 20 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 19:21:00,011 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:21:00,041 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:00,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 22 transitions, 52 flow [2025-04-13 19:21:00,091 INFO L116 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-04-13 19:21:00,092 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:21:00,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 21 events. 2/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 19:21:00,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 22 transitions, 52 flow [2025-04-13 19:21:00,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 21 transitions, 49 flow [2025-04-13 19:21:00,103 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:00,116 INFO L340 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=LoopHeads, 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;@498b22e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:00,116 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:21:00,123 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:00,123 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 19:21:00,123 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:21:00,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:00,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:00,124 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:21:00,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 179986358, now seen corresponding path program 1 times [2025-04-13 19:21:00,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:00,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26744022] [2025-04-13 19:21:00,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:00,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:00,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:00,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:00,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:00,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:00,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26744022] [2025-04-13 19:21:00,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26744022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:00,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:00,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345736552] [2025-04-13 19:21:00,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:00,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:00,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:00,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:00,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:00,396 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-04-13 19:21:00,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 49 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-04-13 19:21:00,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:00,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-04-13 19:21:00,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:00,480 INFO L116 PetriNetUnfolderBase]: 96/189 cut-off events. [2025-04-13 19:21:00,480 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:21:00,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 189 events. 96/189 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 659 event pairs, 29 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 355. Up to 85 conditions per place. [2025-04-13 19:21:00,483 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 16 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2025-04-13 19:21:00,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 93 flow [2025-04-13 19:21:00,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-04-13 19:21:00,496 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-04-13 19:21:00,497 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 49 flow. Second operand 3 states and 45 transitions. [2025-04-13 19:21:00,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 93 flow [2025-04-13 19:21:00,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 92 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:00,506 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 62 flow [2025-04-13 19:21:00,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2025-04-13 19:21:00,509 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-04-13 19:21:00,509 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 62 flow [2025-04-13 19:21:00,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-04-13 19:21:00,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:00,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:21:00,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:21:00,510 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:21:00,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:00,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1284319200, now seen corresponding path program 1 times [2025-04-13 19:21:00,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:00,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821734844] [2025-04-13 19:21:00,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:00,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:00,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:21:00,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:21:00,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:00,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:00,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:21:00,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:21:00,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:21:00,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:00,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:00,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:21:00,565 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:21:00,566 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 19:21:00,567 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 19:21:00,568 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 19:21:00,568 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 19:21:00,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:21:00,568 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:21:00,571 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:21:00,571 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:21:00,589 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:00,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 94 flow [2025-04-13 19:21:00,598 INFO L116 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-04-13 19:21:00,598 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:21:00,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 30 events. 3/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2025-04-13 19:21:00,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 94 flow [2025-04-13 19:21:00,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 69 flow [2025-04-13 19:21:00,602 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:00,602 INFO L340 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=LoopHeads, 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;@498b22e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:00,602 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:21:00,605 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:00,605 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 19:21:00,605 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:21:00,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:00,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:00,605 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:21:00,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash 215695835, now seen corresponding path program 1 times [2025-04-13 19:21:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:00,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102380895] [2025-04-13 19:21:00,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:00,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:00,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:00,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:00,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:00,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:00,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102380895] [2025-04-13 19:21:00,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102380895] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:00,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:00,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:00,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816887803] [2025-04-13 19:21:00,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:00,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:00,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:00,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:00,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:00,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-04-13 19:21:00,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-04-13 19:21:00,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:00,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-04-13 19:21:00,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:00,858 INFO L116 PetriNetUnfolderBase]: 760/1207 cut-off events. [2025-04-13 19:21:00,858 INFO L117 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-04-13 19:21:00,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 1207 events. 760/1207 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5724 event pairs, 185 based on Foata normal form. 0/1160 useless extension candidates. Maximal degree in co-relation 2378. Up to 644 conditions per place. [2025-04-13 19:21:00,871 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 23 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-04-13 19:21:00,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 140 flow [2025-04-13 19:21:00,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-13 19:21:00,873 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6036036036036037 [2025-04-13 19:21:00,873 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 69 flow. Second operand 3 states and 67 transitions. [2025-04-13 19:21:00,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 140 flow [2025-04-13 19:21:00,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:00,875 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 88 flow [2025-04-13 19:21:00,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-04-13 19:21:00,876 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2025-04-13 19:21:00,876 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 88 flow [2025-04-13 19:21:00,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-04-13 19:21:00,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:00,876 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:00,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:21:00,876 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:21:00,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash -127308495, now seen corresponding path program 1 times [2025-04-13 19:21:00,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:00,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502208876] [2025-04-13 19:21:00,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:00,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:00,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:21:00,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:21:00,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:00,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:00,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:21:00,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:21:00,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:21:00,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:00,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:00,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:21:00,913 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:21:00,913 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:21:00,913 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:21:00,913 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 19:21:00,913 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:21:00,913 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:21:00,914 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:21:00,914 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:21:00,914 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:21:00,914 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:21:00,938 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:00,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 52 transitions, 140 flow [2025-04-13 19:21:00,943 INFO L116 PetriNetUnfolderBase]: 4/39 cut-off events. [2025-04-13 19:21:00,943 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:21:00,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 39 events. 4/39 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 50. Up to 4 conditions per place. [2025-04-13 19:21:00,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 52 transitions, 140 flow [2025-04-13 19:21:00,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 91 flow [2025-04-13 19:21:00,945 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:00,945 INFO L340 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=LoopHeads, 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;@498b22e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:00,945 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:21:00,946 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:00,946 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 19:21:00,946 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:21:00,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:00,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:00,946 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:21:00,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:00,946 INFO L85 PathProgramCache]: Analyzing trace with hash 265712936, now seen corresponding path program 1 times [2025-04-13 19:21:00,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:00,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391857939] [2025-04-13 19:21:00,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:00,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:00,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:00,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:00,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:00,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:00,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:00,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391857939] [2025-04-13 19:21:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391857939] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:00,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:00,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80998046] [2025-04-13 19:21:00,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:00,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:00,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:00,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:00,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:00,995 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2025-04-13 19:21:00,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-04-13 19:21:00,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:00,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2025-04-13 19:21:00,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:01,468 INFO L116 PetriNetUnfolderBase]: 4492/6423 cut-off events. [2025-04-13 19:21:01,468 INFO L117 PetriNetUnfolderBase]: For 1031/1031 co-relation queries the response was YES. [2025-04-13 19:21:01,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12876 conditions, 6423 events. 4492/6423 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 34123 event pairs, 1075 based on Foata normal form. 0/6210 useless extension candidates. Maximal degree in co-relation 12864. Up to 3740 conditions per place. [2025-04-13 19:21:01,513 INFO L140 encePairwiseOnDemand]: 40/52 looper letters, 30 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-04-13 19:21:01,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 191 flow [2025-04-13 19:21:01,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-04-13 19:21:01,515 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5705128205128205 [2025-04-13 19:21:01,516 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 91 flow. Second operand 3 states and 89 transitions. [2025-04-13 19:21:01,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 191 flow [2025-04-13 19:21:01,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 186 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:01,518 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 114 flow [2025-04-13 19:21:01,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-04-13 19:21:01,521 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-04-13 19:21:01,521 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 114 flow [2025-04-13 19:21:01,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-04-13 19:21:01,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:01,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:01,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:21:01,522 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:21:01,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash 726860827, now seen corresponding path program 1 times [2025-04-13 19:21:01,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:01,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388222470] [2025-04-13 19:21:01,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:01,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:01,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:21:01,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:21:01,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:01,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:01,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:01,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388222470] [2025-04-13 19:21:01,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388222470] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:01,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:01,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:21:01,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463566246] [2025-04-13 19:21:01,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:01,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:01,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:01,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:01,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:01,611 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2025-04-13 19:21:01,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-04-13 19:21:01,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:01,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2025-04-13 19:21:01,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:01,723 INFO L116 PetriNetUnfolderBase]: 388/812 cut-off events. [2025-04-13 19:21:01,724 INFO L117 PetriNetUnfolderBase]: For 299/299 co-relation queries the response was YES. [2025-04-13 19:21:01,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 812 events. 388/812 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4206 event pairs, 56 based on Foata normal form. 568/1351 useless extension candidates. Maximal degree in co-relation 2012. Up to 589 conditions per place. [2025-04-13 19:21:01,730 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 21 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2025-04-13 19:21:01,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 195 flow [2025-04-13 19:21:01,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-13 19:21:01,732 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2025-04-13 19:21:01,732 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 114 flow. Second operand 3 states and 71 transitions. [2025-04-13 19:21:01,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 195 flow [2025-04-13 19:21:01,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:21:01,734 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 120 flow [2025-04-13 19:21:01,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-04-13 19:21:01,735 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-04-13 19:21:01,735 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 120 flow [2025-04-13 19:21:01,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-04-13 19:21:01,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:01,735 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:01,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:21:01,735 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:21:01,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash -509786369, now seen corresponding path program 1 times [2025-04-13 19:21:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:01,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349862611] [2025-04-13 19:21:01,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:01,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:01,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:21:01,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:21:01,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:01,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:01,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:21:01,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:21:01,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:21:01,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:01,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:01,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:21:01,772 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:21:01,772 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:21:01,772 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:21:01,772 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 19:21:01,772 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:21:01,772 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:21:01,772 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:21:01,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:21:01,773 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 19:21:01,773 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:21:01,773 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:21:01,808 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:01,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 67 transitions, 190 flow [2025-04-13 19:21:01,818 INFO L116 PetriNetUnfolderBase]: 5/48 cut-off events. [2025-04-13 19:21:01,818 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:21:01,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 48 events. 5/48 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 64. Up to 5 conditions per place. [2025-04-13 19:21:01,819 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 67 transitions, 190 flow [2025-04-13 19:21:01,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 42 transitions, 115 flow [2025-04-13 19:21:01,820 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:01,821 INFO L340 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=LoopHeads, 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;@498b22e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:01,821 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:21:01,823 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:01,823 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-13 19:21:01,823 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:21:01,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:01,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:01,823 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:21:01,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash 330051563, now seen corresponding path program 1 times [2025-04-13 19:21:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:01,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238433212] [2025-04-13 19:21:01,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:01,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:01,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:01,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:01,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:01,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:01,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:01,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238433212] [2025-04-13 19:21:01,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238433212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:01,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:01,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:01,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752667732] [2025-04-13 19:21:01,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:01,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:01,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:01,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:01,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:01,881 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2025-04-13 19:21:01,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-04-13 19:21:01,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:01,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2025-04-13 19:21:01,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:03,507 INFO L116 PetriNetUnfolderBase]: 23538/31513 cut-off events. [2025-04-13 19:21:03,508 INFO L117 PetriNetUnfolderBase]: For 7749/7749 co-relation queries the response was YES. [2025-04-13 19:21:03,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63706 conditions, 31513 events. 23538/31513 cut-off events. For 7749/7749 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 178806 event pairs, 5913 based on Foata normal form. 0/30608 useless extension candidates. Maximal degree in co-relation 63693. Up to 19170 conditions per place. [2025-04-13 19:21:03,708 INFO L140 encePairwiseOnDemand]: 53/67 looper letters, 37 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2025-04-13 19:21:03,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 246 flow [2025-04-13 19:21:03,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-04-13 19:21:03,710 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5522388059701493 [2025-04-13 19:21:03,710 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 115 flow. Second operand 3 states and 111 transitions. [2025-04-13 19:21:03,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 246 flow [2025-04-13 19:21:03,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 233 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:03,719 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 140 flow [2025-04-13 19:21:03,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-04-13 19:21:03,722 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2025-04-13 19:21:03,722 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 140 flow [2025-04-13 19:21:03,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-04-13 19:21:03,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:03,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:03,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:21:03,723 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:21:03,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash -450333757, now seen corresponding path program 1 times [2025-04-13 19:21:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:03,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048709837] [2025-04-13 19:21:03,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:03,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:21:03,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:21:03,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:03,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:03,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:03,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048709837] [2025-04-13 19:21:03,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048709837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:03,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:21:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353121174] [2025-04-13 19:21:03,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:03,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:03,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:03,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:03,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:03,854 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2025-04-13 19:21:03,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-04-13 19:21:03,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:03,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2025-04-13 19:21:03,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:03,975 INFO L116 PetriNetUnfolderBase]: 1033/2060 cut-off events. [2025-04-13 19:21:03,975 INFO L117 PetriNetUnfolderBase]: For 916/916 co-relation queries the response was YES. [2025-04-13 19:21:03,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5195 conditions, 2060 events. 1033/2060 cut-off events. For 916/916 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12545 event pairs, 148 based on Foata normal form. 1904/3901 useless extension candidates. Maximal degree in co-relation 5179. Up to 1536 conditions per place. [2025-04-13 19:21:03,987 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 25 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2025-04-13 19:21:03,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 240 flow [2025-04-13 19:21:03,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-04-13 19:21:03,991 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4427860696517413 [2025-04-13 19:21:03,991 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 140 flow. Second operand 3 states and 89 transitions. [2025-04-13 19:21:03,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 240 flow [2025-04-13 19:21:03,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:21:03,995 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 148 flow [2025-04-13 19:21:03,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-04-13 19:21:03,995 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2025-04-13 19:21:03,996 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 148 flow [2025-04-13 19:21:03,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-04-13 19:21:03,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:03,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:03,996 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:21:03,996 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:21:03,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:03,996 INFO L85 PathProgramCache]: Analyzing trace with hash 783692874, now seen corresponding path program 1 times [2025-04-13 19:21:03,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:03,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509485045] [2025-04-13 19:21:03,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:03,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:04,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:21:04,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:21:04,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:04,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:04,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:04,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509485045] [2025-04-13 19:21:04,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509485045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:04,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:04,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:21:04,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015494798] [2025-04-13 19:21:04,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:04,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:21:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:04,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:21:04,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:21:04,081 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2025-04-13 19:21:04,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-04-13 19:21:04,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:04,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2025-04-13 19:21:04,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:04,274 INFO L116 PetriNetUnfolderBase]: 1666/3198 cut-off events. [2025-04-13 19:21:04,274 INFO L117 PetriNetUnfolderBase]: For 1179/1181 co-relation queries the response was YES. [2025-04-13 19:21:04,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9006 conditions, 3198 events. 1666/3198 cut-off events. For 1179/1181 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 20905 event pairs, 63 based on Foata normal form. 0/3140 useless extension candidates. Maximal degree in co-relation 8991. Up to 2152 conditions per place. [2025-04-13 19:21:04,290 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 55 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2025-04-13 19:21:04,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 454 flow [2025-04-13 19:21:04,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:21:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:21:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-04-13 19:21:04,291 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48880597014925375 [2025-04-13 19:21:04,291 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 148 flow. Second operand 4 states and 131 transitions. [2025-04-13 19:21:04,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 454 flow [2025-04-13 19:21:04,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:04,294 INFO L231 Difference]: Finished difference. Result has 48 places, 52 transitions, 242 flow [2025-04-13 19:21:04,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=48, PETRI_TRANSITIONS=52} [2025-04-13 19:21:04,295 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-04-13 19:21:04,295 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 52 transitions, 242 flow [2025-04-13 19:21:04,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-04-13 19:21:04,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:04,295 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:04,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:21:04,295 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:21:04,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:04,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1225860054, now seen corresponding path program 1 times [2025-04-13 19:21:04,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:04,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100591289] [2025-04-13 19:21:04,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:04,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:04,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:21:04,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:21:04,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:04,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:04,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:21:04,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:21:04,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:21:04,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:04,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:04,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:21:04,315 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:21:04,315 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 19:21:04,316 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:21:04,316 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 19:21:04,316 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 19:21:04,316 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 19:21:04,316 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 19:21:04,317 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:21:04,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:21:04,318 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-13 19:21:04,319 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:21:04,319 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 19:21:04,347 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:04,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 82 transitions, 244 flow [2025-04-13 19:21:04,352 INFO L116 PetriNetUnfolderBase]: 6/57 cut-off events. [2025-04-13 19:21:04,352 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:21:04,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 57 events. 6/57 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 79. Up to 6 conditions per place. [2025-04-13 19:21:04,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 82 transitions, 244 flow [2025-04-13 19:21:04,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 49 transitions, 141 flow [2025-04-13 19:21:04,354 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:04,355 INFO L340 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=LoopHeads, 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;@498b22e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:04,355 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 19:21:04,356 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:04,356 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 19:21:04,356 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:21:04,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:04,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:04,356 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 19:21:04,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:04,356 INFO L85 PathProgramCache]: Analyzing trace with hash 408690863, now seen corresponding path program 1 times [2025-04-13 19:21:04,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:04,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582826057] [2025-04-13 19:21:04,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:04,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:04,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:04,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:04,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:04,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:04,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:04,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582826057] [2025-04-13 19:21:04,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582826057] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:04,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:04,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:04,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454017254] [2025-04-13 19:21:04,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:04,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:04,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:04,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:04,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:04,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 82 [2025-04-13 19:21:04,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-04-13 19:21:04,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:04,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 82 [2025-04-13 19:21:04,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:11,189 INFO L116 PetriNetUnfolderBase]: 116006/148285 cut-off events. [2025-04-13 19:21:11,189 INFO L117 PetriNetUnfolderBase]: For 49466/49466 co-relation queries the response was YES. [2025-04-13 19:21:11,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301739 conditions, 148285 events. 116006/148285 cut-off events. For 49466/49466 co-relation queries the response was YES. Maximal size of possible extension queue 4644. Compared 878641 event pairs, 30983 based on Foata normal form. 0/144554 useless extension candidates. Maximal degree in co-relation 301725. Up to 92734 conditions per place. [2025-04-13 19:21:12,344 INFO L140 encePairwiseOnDemand]: 66/82 looper letters, 44 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-04-13 19:21:12,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 305 flow [2025-04-13 19:21:12,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2025-04-13 19:21:12,345 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.540650406504065 [2025-04-13 19:21:12,345 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 141 flow. Second operand 3 states and 133 transitions. [2025-04-13 19:21:12,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 305 flow [2025-04-13 19:21:12,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 280 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:12,364 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 166 flow [2025-04-13 19:21:12,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2025-04-13 19:21:12,365 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2025-04-13 19:21:12,365 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 166 flow [2025-04-13 19:21:12,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-04-13 19:21:12,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:12,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:12,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:21:12,365 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 19:21:12,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1452343147, now seen corresponding path program 1 times [2025-04-13 19:21:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:12,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693819020] [2025-04-13 19:21:12,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:12,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:21:12,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:21:12,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:12,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:12,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693819020] [2025-04-13 19:21:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693819020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:12,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:21:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622096093] [2025-04-13 19:21:12,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:12,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:12,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:12,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:12,399 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 82 [2025-04-13 19:21:12,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-04-13 19:21:12,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:12,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 82 [2025-04-13 19:21:12,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:12,646 INFO L116 PetriNetUnfolderBase]: 2554/4946 cut-off events. [2025-04-13 19:21:12,646 INFO L117 PetriNetUnfolderBase]: For 2541/2541 co-relation queries the response was YES. [2025-04-13 19:21:12,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12554 conditions, 4946 events. 2554/4946 cut-off events. For 2541/2541 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 34895 event pairs, 380 based on Foata normal form. 5642/10459 useless extension candidates. Maximal degree in co-relation 12537. Up to 3753 conditions per place. [2025-04-13 19:21:12,679 INFO L140 encePairwiseOnDemand]: 70/82 looper letters, 29 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2025-04-13 19:21:12,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 285 flow [2025-04-13 19:21:12,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-04-13 19:21:12,680 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2025-04-13 19:21:12,680 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 166 flow. Second operand 3 states and 107 transitions. [2025-04-13 19:21:12,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 285 flow [2025-04-13 19:21:12,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:21:12,687 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 176 flow [2025-04-13 19:21:12,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2025-04-13 19:21:12,688 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2025-04-13 19:21:12,688 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 176 flow [2025-04-13 19:21:12,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-04-13 19:21:12,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:12,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:12,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:21:12,689 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 19:21:12,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1406694336, now seen corresponding path program 1 times [2025-04-13 19:21:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:12,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544991261] [2025-04-13 19:21:12,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:12,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:12,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:21:12,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:21:12,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:12,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:12,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:12,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544991261] [2025-04-13 19:21:12,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544991261] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:12,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:12,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:21:12,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798051430] [2025-04-13 19:21:12,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:12,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:21:12,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:12,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:21:12,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:21:12,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 82 [2025-04-13 19:21:12,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-04-13 19:21:12,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:12,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 82 [2025-04-13 19:21:12,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:13,235 INFO L116 PetriNetUnfolderBase]: 3869/7123 cut-off events. [2025-04-13 19:21:13,235 INFO L117 PetriNetUnfolderBase]: For 2555/2555 co-relation queries the response was YES. [2025-04-13 19:21:13,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20290 conditions, 7123 events. 3869/7123 cut-off events. For 2555/2555 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 50974 event pairs, 115 based on Foata normal form. 0/6999 useless extension candidates. Maximal degree in co-relation 20274. Up to 5348 conditions per place. [2025-04-13 19:21:13,268 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 65 selfloop transitions, 16 changer transitions 0/94 dead transitions. [2025-04-13 19:21:13,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 94 transitions, 546 flow [2025-04-13 19:21:13,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:21:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:21:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-04-13 19:21:13,269 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4817073170731707 [2025-04-13 19:21:13,269 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 176 flow. Second operand 4 states and 158 transitions. [2025-04-13 19:21:13,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 94 transitions, 546 flow [2025-04-13 19:21:13,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 515 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:13,275 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 293 flow [2025-04-13 19:21:13,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2025-04-13 19:21:13,275 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2025-04-13 19:21:13,275 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 293 flow [2025-04-13 19:21:13,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-04-13 19:21:13,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:13,276 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:13,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:21:13,276 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 19:21:13,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1711281042, now seen corresponding path program 1 times [2025-04-13 19:21:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:13,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825363881] [2025-04-13 19:21:13,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:13,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:21:13,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:21:13,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:13,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:13,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:21:13,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:21:13,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:21:13,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:13,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:13,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:21:13,298 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:21:13,298 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-13 19:21:13,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-13 19:21:13,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-04-13 19:21:13,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 19:21:13,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 19:21:13,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 19:21:13,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-13 19:21:13,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-13 19:21:13,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 19:21:13,298 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-13 19:21:13,299 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:21:13,299 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 19:21:13,333 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:13,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 97 transitions, 302 flow [2025-04-13 19:21:13,339 INFO L116 PetriNetUnfolderBase]: 7/66 cut-off events. [2025-04-13 19:21:13,339 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-13 19:21:13,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 66 events. 7/66 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 159 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 95. Up to 7 conditions per place. [2025-04-13 19:21:13,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 97 transitions, 302 flow [2025-04-13 19:21:13,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 56 transitions, 169 flow [2025-04-13 19:21:13,340 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:13,340 INFO L340 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=LoopHeads, 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;@498b22e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:13,340 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 19:21:13,341 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:13,341 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 19:21:13,341 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:21:13,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:13,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:13,341 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 19:21:13,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:13,341 INFO L85 PathProgramCache]: Analyzing trace with hash 501651689, now seen corresponding path program 1 times [2025-04-13 19:21:13,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:13,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382526667] [2025-04-13 19:21:13,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:13,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:13,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:13,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:13,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:13,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:13,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382526667] [2025-04-13 19:21:13,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382526667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:13,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:13,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:13,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208013953] [2025-04-13 19:21:13,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:13,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:13,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:13,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:13,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:13,363 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-04-13 19:21:13,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-04-13 19:21:13,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:13,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-04-13 19:21:13,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:48,511 INFO L116 PetriNetUnfolderBase]: 550976/680787 cut-off events. [2025-04-13 19:21:48,512 INFO L117 PetriNetUnfolderBase]: For 288769/288769 co-relation queries the response was YES. [2025-04-13 19:21:50,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392399 conditions, 680787 events. 550976/680787 cut-off events. For 288769/288769 co-relation queries the response was YES. Maximal size of possible extension queue 17928. Compared 4143617 event pairs, 155685 based on Foata normal form. 0/665724 useless extension candidates. Maximal degree in co-relation 1392384. Up to 434032 conditions per place. [2025-04-13 19:21:53,664 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 51 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2025-04-13 19:21:53,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 368 flow [2025-04-13 19:21:53,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-04-13 19:21:53,665 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5326460481099656 [2025-04-13 19:21:53,665 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 169 flow. Second operand 3 states and 155 transitions. [2025-04-13 19:21:53,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 368 flow [2025-04-13 19:21:53,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 327 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:53,864 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 192 flow [2025-04-13 19:21:53,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-04-13 19:21:53,865 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2025-04-13 19:21:53,865 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 192 flow [2025-04-13 19:21:53,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-04-13 19:21:53,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:53,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:53,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 19:21:53,866 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 19:21:53,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1540650866, now seen corresponding path program 1 times [2025-04-13 19:21:53,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:53,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621327901] [2025-04-13 19:21:53,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:53,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:53,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:21:53,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:21:53,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:53,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:53,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:53,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621327901] [2025-04-13 19:21:53,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621327901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:53,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:53,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:21:53,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135206045] [2025-04-13 19:21:53,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:53,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:53,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:53,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:53,900 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-04-13 19:21:53,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-04-13 19:21:53,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:53,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-04-13 19:21:53,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:54,477 INFO L116 PetriNetUnfolderBase]: 6043/11482 cut-off events. [2025-04-13 19:21:54,477 INFO L117 PetriNetUnfolderBase]: For 6666/6666 co-relation queries the response was YES. [2025-04-13 19:21:54,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29284 conditions, 11482 events. 6043/11482 cut-off events. For 6666/6666 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 91395 event pairs, 952 based on Foata normal form. 15530/26753 useless extension candidates. Maximal degree in co-relation 29266. Up to 8820 conditions per place. [2025-04-13 19:21:54,575 INFO L140 encePairwiseOnDemand]: 83/97 looper letters, 33 selfloop transitions, 14 changer transitions 0/62 dead transitions. [2025-04-13 19:21:54,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 330 flow [2025-04-13 19:21:54,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-04-13 19:21:54,576 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42955326460481097 [2025-04-13 19:21:54,576 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 192 flow. Second operand 3 states and 125 transitions. [2025-04-13 19:21:54,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 330 flow [2025-04-13 19:21:54,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:21:54,594 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 204 flow [2025-04-13 19:21:54,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-04-13 19:21:54,594 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2025-04-13 19:21:54,594 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 204 flow [2025-04-13 19:21:54,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-04-13 19:21:54,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:54,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:54,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 19:21:54,594 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 19:21:54,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:54,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1559013132, now seen corresponding path program 1 times [2025-04-13 19:21:54,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:54,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637791917] [2025-04-13 19:21:54,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:54,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:21:54,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:21:54,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:54,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:54,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:54,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637791917] [2025-04-13 19:21:54,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637791917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:54,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:54,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:21:54,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270621258] [2025-04-13 19:21:54,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:54,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:21:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:54,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:21:54,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:21:54,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-04-13 19:21:54,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-04-13 19:21:54,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:54,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-04-13 19:21:54,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:55,439 INFO L116 PetriNetUnfolderBase]: 8696/15526 cut-off events. [2025-04-13 19:21:55,439 INFO L117 PetriNetUnfolderBase]: For 5334/5336 co-relation queries the response was YES. [2025-04-13 19:21:55,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44559 conditions, 15526 events. 8696/15526 cut-off events. For 5334/5336 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 119781 event pairs, 263 based on Foata normal form. 0/15275 useless extension candidates. Maximal degree in co-relation 44542. Up to 12652 conditions per place. [2025-04-13 19:21:55,554 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 75 selfloop transitions, 19 changer transitions 0/109 dead transitions. [2025-04-13 19:21:55,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 109 transitions, 638 flow [2025-04-13 19:21:55,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:21:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:21:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2025-04-13 19:21:55,555 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47680412371134023 [2025-04-13 19:21:55,555 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 204 flow. Second operand 4 states and 185 transitions. [2025-04-13 19:21:55,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 109 transitions, 638 flow [2025-04-13 19:21:55,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 602 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:55,568 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 344 flow [2025-04-13 19:21:55,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2025-04-13 19:21:55,569 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2025-04-13 19:21:55,569 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 72 transitions, 344 flow [2025-04-13 19:21:55,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-04-13 19:21:55,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:55,569 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:55,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 19:21:55,569 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 19:21:55,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1358587036, now seen corresponding path program 1 times [2025-04-13 19:21:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:55,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739412674] [2025-04-13 19:21:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:55,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:21:55,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:21:55,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:55,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:55,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739412674] [2025-04-13 19:21:55,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739412674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:21:55,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821244625] [2025-04-13 19:21:55,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:55,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:21:55,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:21:55,649 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-04-13 19:21:55,651 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-04-13 19:21:55,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:21:55,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:21:55,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:55,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:55,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 19:21:55,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:21:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:55,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:21:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:55,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821244625] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:21:55,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:21:55,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-04-13 19:21:55,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319923815] [2025-04-13 19:21:55,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:21:55,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 19:21:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:55,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 19:21:55,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:21:55,896 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-04-13 19:21:55,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 72 transitions, 344 flow. Second operand has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 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-04-13 19:21:55,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:55,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-04-13 19:21:55,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:58,457 INFO L116 PetriNetUnfolderBase]: 22949/41057 cut-off events. [2025-04-13 19:21:58,458 INFO L117 PetriNetUnfolderBase]: For 21741/21743 co-relation queries the response was YES. [2025-04-13 19:21:58,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110284 conditions, 41057 events. 22949/41057 cut-off events. For 21741/21743 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 365665 event pairs, 3724 based on Foata normal form. 240/41286 useless extension candidates. Maximal degree in co-relation 110264. Up to 13797 conditions per place. [2025-04-13 19:21:58,804 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 71 selfloop transitions, 55 changer transitions 0/141 dead transitions. [2025-04-13 19:21:58,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 920 flow [2025-04-13 19:21:58,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:21:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:21:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2025-04-13 19:21:58,806 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44948453608247424 [2025-04-13 19:21:58,806 INFO L175 Difference]: Start difference. First operand has 62 places, 72 transitions, 344 flow. Second operand 5 states and 218 transitions. [2025-04-13 19:21:58,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 920 flow [2025-04-13 19:21:58,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 141 transitions, 920 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:21:58,830 INFO L231 Difference]: Finished difference. Result has 67 places, 96 transitions, 636 flow [2025-04-13 19:21:58,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=636, PETRI_PLACES=67, PETRI_TRANSITIONS=96} [2025-04-13 19:21:58,831 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2025-04-13 19:21:58,831 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 96 transitions, 636 flow [2025-04-13 19:21:58,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 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-04-13 19:21:58,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:58,831 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:58,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:21:59,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:21:59,032 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 19:21:59,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1168020503, now seen corresponding path program 1 times [2025-04-13 19:21:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:59,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677290538] [2025-04-13 19:21:59,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:59,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:59,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:21:59,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:21:59,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:59,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:59,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:21:59,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:21:59,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:21:59,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:59,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:59,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:21:59,049 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:21:59,049 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-13 19:21:59,049 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2025-04-13 19:21:59,049 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 9 remaining) [2025-04-13 19:21:59,049 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-04-13 19:21:59,050 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2025-04-13 19:21:59,050 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2025-04-13 19:21:59,050 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2025-04-13 19:21:59,050 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-04-13 19:21:59,050 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-04-13 19:21:59,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 19:21:59,050 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-13 19:21:59,050 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:21:59,050 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-13 19:21:59,085 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:59,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 112 transitions, 364 flow [2025-04-13 19:21:59,091 INFO L116 PetriNetUnfolderBase]: 8/75 cut-off events. [2025-04-13 19:21:59,091 INFO L117 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-04-13 19:21:59,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 75 events. 8/75 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 112. Up to 8 conditions per place. [2025-04-13 19:21:59,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 112 transitions, 364 flow [2025-04-13 19:21:59,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 63 transitions, 199 flow [2025-04-13 19:21:59,093 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:59,094 INFO L340 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=LoopHeads, 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;@498b22e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:59,094 INFO L341 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-04-13 19:21:59,094 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:59,094 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 19:21:59,094 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:21:59,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:59,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:59,095 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 19:21:59,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:59,095 INFO L85 PathProgramCache]: Analyzing trace with hash 608947943, now seen corresponding path program 1 times [2025-04-13 19:21:59,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:59,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115420454] [2025-04-13 19:21:59,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:59,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:59,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:59,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:59,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:59,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:59,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:59,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115420454] [2025-04-13 19:21:59,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115420454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:59,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:59,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295800334] [2025-04-13 19:21:59,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:59,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:59,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:59,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:59,117 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 112 [2025-04-13 19:21:59,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-04-13 19:21:59,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:59,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 112 [2025-04-13 19:21:59,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand