/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:56:00,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:56:00,536 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 23:56:00,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:56:00,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:56:00,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:56:00,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:56:00,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:56:00,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:56:00,555 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:56:00,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:56:00,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:56:00,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:56:00,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:56:00,555 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:56:00,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:56:00,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:56:00,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:56:00,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:56:00,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:56:00,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:56:00,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:56:00,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:56:00,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:56:00,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:56:00,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:56:00,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:56:00,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:56:00,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:56:00,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:56:00,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:56:00,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:56:00,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:56:00,557 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:56:00,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:56:00,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:56:00,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:56:00,775 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:56:00,775 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:56:00,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-04-13 23:56:01,980 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af70b9876/7593cc339b7b408fb2a892e0bf5477de/FLAGe5b5a3dc6 [2025-04-13 23:56:02,212 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:56:02,212 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-04-13 23:56:02,220 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af70b9876/7593cc339b7b408fb2a892e0bf5477de/FLAGe5b5a3dc6 [2025-04-13 23:56:03,031 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af70b9876/7593cc339b7b408fb2a892e0bf5477de [2025-04-13 23:56:03,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:56:03,034 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:56:03,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:56:03,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:56:03,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:56:03,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f8dcfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03, skipping insertion in model container [2025-04-13 23:56:03,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:56:03,328 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/48_ticket_lock_low_contention_vs-pthread.i[30570,30583] [2025-04-13 23:56:03,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:56:03,351 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:56:03,400 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/48_ticket_lock_low_contention_vs-pthread.i[30570,30583] [2025-04-13 23:56:03,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:56:03,432 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:56:03,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03 WrapperNode [2025-04-13 23:56:03,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:56:03,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:56:03,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:56:03,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:56:03,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,455 INFO L138 Inliner]: procedures = 164, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2025-04-13 23:56:03,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:56:03,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:56:03,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:56:03,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:56:03,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,469 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 23:56:03,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:56:03,480 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:56:03,480 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:56:03,480 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:56:03,480 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (1/1) ... [2025-04-13 23:56:03,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:56:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:56:03,501 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 23:56:03,506 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 23:56:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 23:56:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 23:56:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:56:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:56:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:56:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:56:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:56:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:56:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:56:03,518 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:56:03,605 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:56:03,606 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:56:03,697 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:56:03,698 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:56:03,698 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:56:03,809 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:56:03,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:56:03 BoogieIcfgContainer [2025-04-13 23:56:03,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:56:03,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:56:03,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:56:03,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:56:03,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:56:03" (1/3) ... [2025-04-13 23:56:03,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c3c16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:56:03, skipping insertion in model container [2025-04-13 23:56:03,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:56:03" (2/3) ... [2025-04-13 23:56:03,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c3c16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:56:03, skipping insertion in model container [2025-04-13 23:56:03,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:56:03" (3/3) ... [2025-04-13 23:56:03,819 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2025-04-13 23:56:03,828 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:56:03,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-pthread.i that has 2 procedures, 16 locations, 15 edges, 1 initial locations, 1 loop locations, and 2 error locations. [2025-04-13 23:56:03,830 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:56:03,855 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:56:03,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 36 flow [2025-04-13 23:56:03,900 INFO L116 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-04-13 23:56:03,902 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:56:03,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 51 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 23:56:03,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 16 transitions, 36 flow [2025-04-13 23:56:03,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 16 transitions, 36 flow [2025-04-13 23:56:03,909 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:56:03,919 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;@6b337c3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:56:03,919 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:56:03,924 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:56:03,925 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:56:03,925 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:56:03,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:56:03,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:56:03,925 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:56:03,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:56:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash 5243047, now seen corresponding path program 1 times [2025-04-13 23:56:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:56:03,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326866811] [2025-04-13 23:56:03,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:56:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:56:03,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:56:04,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:56:04,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:04,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:56:04,104 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 23:56:04,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:56:04,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326866811] [2025-04-13 23:56:04,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326866811] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:56:04,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:56:04,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:56:04,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808201466] [2025-04-13 23:56:04,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:56:04,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:56:04,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:56:04,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:56:04,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:56:04,128 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2025-04-13 23:56:04,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 16 transitions, 36 flow. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 23:56:04,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:56:04,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2025-04-13 23:56:04,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:56:04,187 INFO L116 PetriNetUnfolderBase]: 24/69 cut-off events. [2025-04-13 23:56:04,187 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:56:04,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 69 events. 24/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 187 event pairs, 24 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 117. Up to 67 conditions per place. [2025-04-13 23:56:04,189 INFO L140 encePairwiseOnDemand]: 14/16 looper letters, 7 selfloop transitions, 0 changer transitions 5/14 dead transitions. [2025-04-13 23:56:04,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 14 transitions, 56 flow [2025-04-13 23:56:04,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:56:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:56:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 18 transitions. [2025-04-13 23:56:04,198 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-04-13 23:56:04,199 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 36 flow. Second operand 2 states and 18 transitions. [2025-04-13 23:56:04,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 14 transitions, 56 flow [2025-04-13 23:56:04,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 14 transitions, 56 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:56:04,204 INFO L231 Difference]: Finished difference. Result has 18 places, 9 transitions, 22 flow [2025-04-13 23:56:04,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=22, PETRI_PLACES=18, PETRI_TRANSITIONS=9} [2025-04-13 23:56:04,207 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2025-04-13 23:56:04,208 INFO L485 AbstractCegarLoop]: Abstraction has has 18 places, 9 transitions, 22 flow [2025-04-13 23:56:04,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 23:56:04,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:56:04,208 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-04-13 23:56:04,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:56:04,208 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:56:04,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:56:04,208 INFO L85 PathProgramCache]: Analyzing trace with hash 162520450, now seen corresponding path program 1 times [2025-04-13 23:56:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:56:04,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601142052] [2025-04-13 23:56:04,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:56:04,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:56:04,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:56:04,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:56:04,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:04,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:56:04,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:56:04,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:56:04,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:56:04,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:04,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:56:04,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:56:04,251 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:56:04,252 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 23:56:04,254 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 23:56:04,254 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 23:56:04,254 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:56:04,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:56:04,254 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:56:04,256 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:56:04,256 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:56:04,292 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:56:04,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 56 flow [2025-04-13 23:56:04,304 INFO L116 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-04-13 23:56:04,304 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:56:04,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 37 events. 0/37 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 109 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-04-13 23:56:04,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 23 transitions, 56 flow [2025-04-13 23:56:04,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 56 flow [2025-04-13 23:56:04,306 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:56:04,307 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;@6b337c3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:56:04,307 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:56:04,310 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:56:04,310 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:56:04,310 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:56:04,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:56:04,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:56:04,310 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:56:04,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:56:04,310 INFO L85 PathProgramCache]: Analyzing trace with hash 5951079, now seen corresponding path program 1 times [2025-04-13 23:56:04,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:56:04,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504141969] [2025-04-13 23:56:04,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:56:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:56:04,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:56:04,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:56:04,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:04,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:56: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 23:56:04,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:56:04,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504141969] [2025-04-13 23:56:04,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504141969] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:56:04,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:56:04,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:56:04,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258604610] [2025-04-13 23:56:04,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:56:04,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:56:04,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:56:04,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:56:04,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:56:04,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2025-04-13 23:56:04,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 23:56:04,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:56:04,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2025-04-13 23:56:04,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:56:04,477 INFO L116 PetriNetUnfolderBase]: 284/508 cut-off events. [2025-04-13 23:56:04,477 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-13 23:56:04,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 508 events. 284/508 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2197 event pairs, 284 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 675. Up to 502 conditions per place. [2025-04-13 23:56:04,482 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 12 selfloop transitions, 0 changer transitions 5/20 dead transitions. [2025-04-13 23:56:04,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 20 transitions, 84 flow [2025-04-13 23:56:04,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:56:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:56:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2025-04-13 23:56:04,483 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2025-04-13 23:56:04,483 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 56 flow. Second operand 2 states and 26 transitions. [2025-04-13 23:56:04,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 20 transitions, 84 flow [2025-04-13 23:56:04,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:56:04,484 INFO L231 Difference]: Finished difference. Result has 26 places, 15 transitions, 40 flow [2025-04-13 23:56:04,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2025-04-13 23:56:04,484 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2025-04-13 23:56:04,484 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 15 transitions, 40 flow [2025-04-13 23:56:04,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 23:56:04,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:56:04,485 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2025-04-13 23:56:04,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:56:04,485 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:56:04,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:56:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1187051064, now seen corresponding path program 1 times [2025-04-13 23:56:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:56:04,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712880965] [2025-04-13 23:56:04,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:56:04,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:56:04,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:56:04,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:56:04,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:04,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:56:04,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:56:04,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:56:04,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:56:04,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:04,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:56:04,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:56:04,514 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:56:04,514 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:56:04,514 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 23:56:04,514 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 23:56:04,514 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:56:04,514 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:56:04,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:56:04,515 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:56:04,516 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:56:04,516 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:56:04,532 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:56:04,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 78 flow [2025-04-13 23:56:04,538 INFO L116 PetriNetUnfolderBase]: 0/51 cut-off events. [2025-04-13 23:56:04,538 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:56:04,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 0/51 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 177 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-04-13 23:56:04,540 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 78 flow [2025-04-13 23:56:04,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2025-04-13 23:56:04,542 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:56:04,544 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;@6b337c3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:56:04,544 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:56:04,546 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:56:04,546 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:56:04,546 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:56:04,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:56:04,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:56:04,546 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 23:56:04,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:56:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash 6874599, now seen corresponding path program 1 times [2025-04-13 23:56:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:56:04,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404626930] [2025-04-13 23:56:04,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:56:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:56:04,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:56:04,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:56:04,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:04,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:56:04,585 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 23:56:04,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:56:04,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404626930] [2025-04-13 23:56:04,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404626930] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:56:04,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:56:04,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:56:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037753414] [2025-04-13 23:56:04,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:56:04,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:56:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:56:04,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:56:04,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:56:04,588 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2025-04-13 23:56:04,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 78 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 23:56:04,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:56:04,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2025-04-13 23:56:04,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:56:04,830 INFO L116 PetriNetUnfolderBase]: 2284/3397 cut-off events. [2025-04-13 23:56:04,831 INFO L117 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-04-13 23:56:04,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6895 conditions, 3397 events. 2284/3397 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 17183 event pairs, 2284 based on Foata normal form. 0/3221 useless extension candidates. Maximal degree in co-relation 2583. Up to 3377 conditions per place. [2025-04-13 23:56:04,843 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 17 selfloop transitions, 0 changer transitions 5/26 dead transitions. [2025-04-13 23:56:04,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 114 flow [2025-04-13 23:56:04,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:56:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:56:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2025-04-13 23:56:04,844 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-04-13 23:56:04,844 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 78 flow. Second operand 2 states and 34 transitions. [2025-04-13 23:56:04,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 114 flow [2025-04-13 23:56:04,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 112 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 23:56:04,847 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 58 flow [2025-04-13 23:56:04,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2025-04-13 23:56:04,848 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2025-04-13 23:56:04,848 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 58 flow [2025-04-13 23:56:04,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 23:56:04,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:56:04,848 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 23:56:04,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:56:04,849 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 23:56:04,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:56:04,849 INFO L85 PathProgramCache]: Analyzing trace with hash -866131646, now seen corresponding path program 1 times [2025-04-13 23:56:04,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:56:04,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431670008] [2025-04-13 23:56:04,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:56:04,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:56:04,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:56:04,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:56:04,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:04,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:56:04,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:56:04,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:56:04,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:56:04,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:04,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:56:04,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:56:04,876 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:56:04,876 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 23:56:04,876 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 23:56:04,876 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 23:56:04,876 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:56:04,876 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:56:04,878 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:56:04,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:56:04,879 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:56:04,879 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:56:04,879 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:56:04,897 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:56:04,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 102 flow [2025-04-13 23:56:04,904 INFO L116 PetriNetUnfolderBase]: 0/65 cut-off events. [2025-04-13 23:56:04,905 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:56:04,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 65 events. 0/65 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 233 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-04-13 23:56:04,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 37 transitions, 102 flow [2025-04-13 23:56:04,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 102 flow [2025-04-13 23:56:04,906 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:56:04,907 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;@6b337c3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:56:04,907 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:56:04,908 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:56:04,908 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:56:04,908 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:56:04,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:56:04,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:56:04,908 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:56:04,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:56:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash 8013607, now seen corresponding path program 1 times [2025-04-13 23:56:04,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:56:04,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388695645] [2025-04-13 23:56:04,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:56:04,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:56:04,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:56:04,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:56:04,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:04,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:56:04,956 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 23:56:04,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:56:04,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388695645] [2025-04-13 23:56:04,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388695645] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:56:04,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:56:04,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:56:04,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606046907] [2025-04-13 23:56:04,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:56:04,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:56:04,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:56:04,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:56:04,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:56:04,958 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2025-04-13 23:56:04,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 102 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 23:56:04,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:56:04,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2025-04-13 23:56:04,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:56:06,098 INFO L116 PetriNetUnfolderBase]: 15784/21350 cut-off events. [2025-04-13 23:56:06,098 INFO L117 PetriNetUnfolderBase]: For 1711/1711 co-relation queries the response was YES. [2025-04-13 23:56:06,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43349 conditions, 21350 events. 15784/21350 cut-off events. For 1711/1711 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 117960 event pairs, 15784 based on Foata normal form. 0/20479 useless extension candidates. Maximal degree in co-relation 6919. Up to 21252 conditions per place. [2025-04-13 23:56:06,169 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 22 selfloop transitions, 0 changer transitions 5/32 dead transitions. [2025-04-13 23:56:06,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 146 flow [2025-04-13 23:56:06,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:56:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:56:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2025-04-13 23:56:06,170 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-04-13 23:56:06,171 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 102 flow. Second operand 2 states and 42 transitions. [2025-04-13 23:56:06,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 146 flow [2025-04-13 23:56:06,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 140 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 23:56:06,174 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 76 flow [2025-04-13 23:56:06,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2025-04-13 23:56:06,175 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2025-04-13 23:56:06,175 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 76 flow [2025-04-13 23:56:06,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 23:56:06,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:56:06,175 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-04-13 23:56:06,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:56:06,175 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:56:06,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:56:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash 383827776, now seen corresponding path program 1 times [2025-04-13 23:56:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:56:06,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147247263] [2025-04-13 23:56:06,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:56:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:56:06,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:56:06,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:56:06,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:06,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:56:06,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:56:06,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:56:06,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:56:06,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:06,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:56:06,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:56:06,205 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:56:06,205 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 23:56:06,205 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 23:56:06,205 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 23:56:06,205 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 23:56:06,205 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 23:56:06,205 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 23:56:06,205 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 23:56:06,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:56:06,206 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:56:06,206 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:56:06,206 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 23:56:06,226 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:56:06,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 44 transitions, 128 flow [2025-04-13 23:56:06,232 INFO L116 PetriNetUnfolderBase]: 0/79 cut-off events. [2025-04-13 23:56:06,232 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:56:06,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 79 events. 0/79 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 298 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-04-13 23:56:06,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 44 transitions, 128 flow [2025-04-13 23:56:06,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 44 transitions, 128 flow [2025-04-13 23:56:06,234 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:56:06,235 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;@6b337c3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:56:06,235 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 23:56:06,237 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:56:06,237 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:56:06,237 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:56:06,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:56:06,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:56:06,238 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 23:56:06,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:56:06,238 INFO L85 PathProgramCache]: Analyzing trace with hash 9368103, now seen corresponding path program 1 times [2025-04-13 23:56:06,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:56:06,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473790636] [2025-04-13 23:56:06,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:56:06,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:56:06,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:56:06,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:56:06,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:06,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:56:06,271 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 23:56:06,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:56:06,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473790636] [2025-04-13 23:56:06,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473790636] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:56:06,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:56:06,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:56:06,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15086652] [2025-04-13 23:56:06,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:56:06,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:56:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:56:06,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:56:06,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:56:06,273 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-04-13 23:56:06,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 128 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 23:56:06,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:56:06,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-04-13 23:56:06,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:56:11,618 INFO L116 PetriNetUnfolderBase]: 100784/128615 cut-off events. [2025-04-13 23:56:11,619 INFO L117 PetriNetUnfolderBase]: For 13426/13426 co-relation queries the response was YES. [2025-04-13 23:56:11,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261240 conditions, 128615 events. 100784/128615 cut-off events. For 13426/13426 co-relation queries the response was YES. Maximal size of possible extension queue 3974. Compared 745966 event pairs, 100784 based on Foata normal form. 0/124269 useless extension candidates. Maximal degree in co-relation 43497. Up to 128127 conditions per place. [2025-04-13 23:56:12,307 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 27 selfloop transitions, 0 changer transitions 5/38 dead transitions. [2025-04-13 23:56:12,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 180 flow [2025-04-13 23:56:12,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:56:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:56:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2025-04-13 23:56:12,310 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2025-04-13 23:56:12,310 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 128 flow. Second operand 2 states and 50 transitions. [2025-04-13 23:56:12,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 180 flow [2025-04-13 23:56:12,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 168 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-13 23:56:12,316 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 94 flow [2025-04-13 23:56:12,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2025-04-13 23:56:12,318 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -5 predicate places. [2025-04-13 23:56:12,318 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 94 flow [2025-04-13 23:56:12,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 23:56:12,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:56:12,318 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:56:12,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:56:12,318 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 23:56:12,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:56:12,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1225158446, now seen corresponding path program 1 times [2025-04-13 23:56:12,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:56:12,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80621895] [2025-04-13 23:56:12,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:56:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:56:12,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 23:56:12,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 23:56:12,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:12,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:56:12,332 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:56:12,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 23:56:12,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 23:56:12,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:12,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:56:12,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:56:12,345 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:56:12,345 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-13 23:56:12,345 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-13 23:56:12,346 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 23:56:12,346 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 23:56:12,346 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 23:56:12,346 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 23:56:12,346 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-13 23:56:12,346 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-13 23:56:12,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:56:12,347 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:56:12,348 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:56:12,348 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 23:56:12,365 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:56:12,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 51 transitions, 156 flow [2025-04-13 23:56:12,372 INFO L116 PetriNetUnfolderBase]: 0/93 cut-off events. [2025-04-13 23:56:12,372 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-13 23:56:12,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 93 events. 0/93 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 361 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-04-13 23:56:12,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 51 transitions, 156 flow [2025-04-13 23:56:12,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 51 transitions, 156 flow [2025-04-13 23:56:12,373 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:56:12,373 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;@6b337c3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:56:12,373 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 23:56:12,373 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:56:12,374 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:56:12,374 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:56:12,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:56:12,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:56:12,374 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:56:12,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:56:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash 10938087, now seen corresponding path program 1 times [2025-04-13 23:56:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:56:12,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910705940] [2025-04-13 23:56:12,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:56:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:56:12,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:56:12,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:56:12,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:56:12,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:56:12,402 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 23:56:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:56:12,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910705940] [2025-04-13 23:56:12,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910705940] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:56:12,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:56:12,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:56:12,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848989861] [2025-04-13 23:56:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:56:12,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:56:12,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:56:12,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:56:12,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:56:12,404 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2025-04-13 23:56:12,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 156 flow. Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 23:56:12,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:56:12,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2025-04-13 23:56:12,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand