./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/14_spin2003.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/14_spin2003.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:02:50,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:02:51,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:02:51,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:02:51,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:02:51,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:02:51,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:02:51,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:02:51,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:02:51,065 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:02:51,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:02:51,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:02:51,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:02:51,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:02:51,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:02:51,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:02:51,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:02:51,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:02:51,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:02:51,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:02:51,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:02:51,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:02:51,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:02:51,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:02:51,069 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:02:51,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:02:51,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:02:51,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:02:51,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:02:51,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:02:51,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:02:51,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:02:51,069 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 [2025-03-04 02:02:51,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:02:51,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:02:51,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:02:51,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:02:51,295 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:02:51,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/14_spin2003.i [2025-03-04 02:02:52,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30941e2b7/9875477f0b6e43c594f8325b11c0e5a8/FLAGa809f79ba [2025-03-04 02:02:52,665 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:02:52,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.i [2025-03-04 02:02:52,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30941e2b7/9875477f0b6e43c594f8325b11c0e5a8/FLAGa809f79ba [2025-03-04 02:02:52,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30941e2b7/9875477f0b6e43c594f8325b11c0e5a8 [2025-03-04 02:02:52,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:02:52,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:02:52,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:02:52,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:02:52,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:02:52,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:52,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31696c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52, skipping insertion in model container [2025-03-04 02:02:52,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:52,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:02:52,891 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.i[30419,30432] [2025-03-04 02:02:52,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:02:52,911 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:02:52,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.i[30419,30432] [2025-03-04 02:02:52,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:02:52,958 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:02:52,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52 WrapperNode [2025-03-04 02:02:52,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:02:52,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:02:52,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:02:52,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:02:52,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:52,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:52,986 INFO L138 Inliner]: procedures = 161, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2025-03-04 02:02:52,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:02:52,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:02:52,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:02:52,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:02:52,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:52,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:52,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:53,001 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-03-04 02:02:53,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:53,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:53,005 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:53,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:53,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:53,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:53,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:02:53,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:02:53,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:02:53,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:02:53,008 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (1/1) ... [2025-03-04 02:02:53,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:02:53,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:53,030 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-03-04 02:02:53,032 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-03-04 02:02:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 02:02:53,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 02:02:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:02:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:02:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:02:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:02:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:02:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:02:53,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:02:53,050 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:02:53,138 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:02:53,140 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:02:53,240 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:02:53,240 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:02:53,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:02:53,302 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:02:53,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:53 BoogieIcfgContainer [2025-03-04 02:02:53,303 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:02:53,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:02:53,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:02:53,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:02:53,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:02:52" (1/3) ... [2025-03-04 02:02:53,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500782a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:02:53, skipping insertion in model container [2025-03-04 02:02:53,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:52" (2/3) ... [2025-03-04 02:02:53,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500782a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:02:53, skipping insertion in model container [2025-03-04 02:02:53,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:53" (3/3) ... [2025-03-04 02:02:53,312 INFO L128 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2025-03-04 02:02:53,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:02:53,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 14_spin2003.i that has 2 procedures, 13 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 02:02:53,322 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:02:53,356 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:53,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 14 transitions, 32 flow [2025-03-04 02:02:53,405 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-03-04 02:02:53,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:02:53,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 16 events. 1/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-03-04 02:02:53,411 INFO L82 GeneralOperation]: Start removeDead. Operand has 16 places, 14 transitions, 32 flow [2025-03-04 02:02:53,413 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 16 places, 14 transitions, 32 flow [2025-03-04 02:02:53,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:53,424 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3022a028, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:53,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:02:53,430 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:53,430 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-04 02:02:53,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:02:53,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:53,431 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 02:02:53,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:02:53,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash 98583939, now seen corresponding path program 1 times [2025-03-04 02:02:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474997779] [2025-03-04 02:02:53,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:53,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 02:02:53,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 02:02:53,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:53,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:53,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:53,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 02:02:53,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 02:02:53,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:53,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:53,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:53,536 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:53,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-04 02:02:53,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-04 02:02:53,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-04 02:02:53,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:02:53,540 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-04 02:02:53,544 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:02:53,544 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 02:02:53,558 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:53,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 58 flow [2025-03-04 02:02:53,567 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2025-03-04 02:02:53,567 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:02:53,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 28 events. 2/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2025-03-04 02:02:53,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 24 transitions, 58 flow [2025-03-04 02:02:53,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 24 transitions, 58 flow [2025-03-04 02:02:53,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:53,569 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3022a028, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:53,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:02:53,574 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:53,574 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 02:02:53,575 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:02:53,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:53,575 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2025-03-04 02:02:53,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 02:02:53,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash 793464581, now seen corresponding path program 1 times [2025-03-04 02:02:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838400617] [2025-03-04 02:02:53,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:53,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:53,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 02:02:53,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 02:02:53,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:53,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:53,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:53,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 02:02:53,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 02:02:53,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:53,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:53,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:53,612 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:53,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-04 02:02:53,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-04 02:02:53,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-04 02:02:53,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-04 02:02:53,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:02:53,613 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-04 02:02:53,613 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:02:53,613 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 02:02:53,628 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:53,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 34 transitions, 86 flow [2025-03-04 02:02:53,642 INFO L124 PetriNetUnfolderBase]: 3/40 cut-off events. [2025-03-04 02:02:53,642 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:02:53,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 3/40 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 99 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2025-03-04 02:02:53,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 34 transitions, 86 flow [2025-03-04 02:02:53,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 34 transitions, 86 flow [2025-03-04 02:02:53,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:53,647 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3022a028, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:53,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:02:53,656 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:53,656 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-03-04 02:02:53,656 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:02:53,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:53,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:53,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:02:53,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash -660816358, now seen corresponding path program 1 times [2025-03-04 02:02:53,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:53,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082819506] [2025-03-04 02:02:53,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:53,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:53,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:02:53,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:02:53,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:53,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:53,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:53,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082819506] [2025-03-04 02:02:53,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082819506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:53,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:53,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:02:53,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644693047] [2025-03-04 02:02:53,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:53,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:53,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:53,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:53,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:53,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-04 02:02:53,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:53,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:53,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-04 02:02:53,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:53,956 INFO L124 PetriNetUnfolderBase]: 564/973 cut-off events. [2025-03-04 02:02:53,957 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2025-03-04 02:02:53,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1971 conditions, 973 events. 564/973 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4927 event pairs, 564 based on Foata normal form. 172/1132 useless extension candidates. Maximal degree in co-relation 425. Up to 876 conditions per place. [2025-03-04 02:02:53,969 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 16 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2025-03-04 02:02:53,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 100 flow [2025-03-04 02:02:53,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-03-04 02:02:53,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:02:53,981 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 86 flow. Second operand 3 states and 51 transitions. [2025-03-04 02:02:53,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 100 flow [2025-03-04 02:02:53,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 98 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:53,987 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 66 flow [2025-03-04 02:02:53,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2025-03-04 02:02:53,991 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2025-03-04 02:02:53,991 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 66 flow [2025-03-04 02:02:53,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:53,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:53,992 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-03-04 02:02:53,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:02:53,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:02:53,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash 634467364, now seen corresponding path program 1 times [2025-03-04 02:02:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:53,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648185298] [2025-03-04 02:02:53,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:54,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:02:54,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:02:54,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:54,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:54,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:54,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:02:54,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:02:54,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:54,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:54,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:54,026 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:54,027 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 02:02:54,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-04 02:02:54,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-04 02:02:54,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-04 02:02:54,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-04 02:02:54,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:02:54,027 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 02:02:54,028 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:02:54,028 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 02:02:54,044 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:54,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 116 flow [2025-03-04 02:02:54,052 INFO L124 PetriNetUnfolderBase]: 4/52 cut-off events. [2025-03-04 02:02:54,052 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 02:02:54,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 52 events. 4/52 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 51. Up to 5 conditions per place. [2025-03-04 02:02:54,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 116 flow [2025-03-04 02:02:54,053 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 44 transitions, 116 flow [2025-03-04 02:02:54,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:54,054 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3022a028, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:54,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:02:54,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:54,058 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-03-04 02:02:54,058 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:02:54,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:54,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:54,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:02:54,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:54,059 INFO L85 PathProgramCache]: Analyzing trace with hash 676806522, now seen corresponding path program 1 times [2025-03-04 02:02:54,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:54,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113133544] [2025-03-04 02:02:54,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:54,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:54,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:02:54,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:02:54,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:54,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:54,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113133544] [2025-03-04 02:02:54,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113133544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:54,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:54,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:02:54,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560594489] [2025-03-04 02:02:54,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:54,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:54,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:54,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:54,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:54,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-03-04 02:02:54,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:54,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:54,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-03-04 02:02:54,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:54,551 INFO L124 PetriNetUnfolderBase]: 4064/6083 cut-off events. [2025-03-04 02:02:54,551 INFO L125 PetriNetUnfolderBase]: For 1719/1719 co-relation queries the response was YES. [2025-03-04 02:02:54,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12457 conditions, 6083 events. 4064/6083 cut-off events. For 1719/1719 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 35200 event pairs, 4064 based on Foata normal form. 1172/7194 useless extension candidates. Maximal degree in co-relation 1995. Up to 5626 conditions per place. [2025-03-04 02:02:54,579 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 21 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2025-03-04 02:02:54,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 134 flow [2025-03-04 02:02:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-04 02:02:54,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:02:54,581 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 116 flow. Second operand 3 states and 66 transitions. [2025-03-04 02:02:54,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 134 flow [2025-03-04 02:02:54,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 128 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:54,584 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 86 flow [2025-03-04 02:02:54,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2025-03-04 02:02:54,585 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2025-03-04 02:02:54,586 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 86 flow [2025-03-04 02:02:54,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:54,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:54,586 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:54,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:02:54,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:02:54,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1491132960, now seen corresponding path program 1 times [2025-03-04 02:02:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:54,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748126477] [2025-03-04 02:02:54,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:54,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:54,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:02:54,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:02:54,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:54,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:54,602 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:54,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:02:54,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:02:54,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:54,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:54,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:54,621 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:54,621 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-04 02:02:54,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-04 02:02:54,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-04 02:02:54,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-04 02:02:54,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-04 02:02:54,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-04 02:02:54,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:02:54,622 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 02:02:54,622 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:02:54,625 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-04 02:02:54,647 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:54,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 54 transitions, 148 flow [2025-03-04 02:02:54,656 INFO L124 PetriNetUnfolderBase]: 5/64 cut-off events. [2025-03-04 02:02:54,656 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 02:02:54,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 64 events. 5/64 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 187 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 69. Up to 6 conditions per place. [2025-03-04 02:02:54,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 54 transitions, 148 flow [2025-03-04 02:02:54,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 54 transitions, 148 flow [2025-03-04 02:02:54,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:54,659 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3022a028, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:54,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:02:54,662 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:54,662 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-03-04 02:02:54,662 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 02:02:54,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:54,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:54,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-04 02:02:54,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1468544440, now seen corresponding path program 1 times [2025-03-04 02:02:54,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:54,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155735516] [2025-03-04 02:02:54,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:54,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:54,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:02:54,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:02:54,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:54,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:54,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:54,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155735516] [2025-03-04 02:02:54,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155735516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:54,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:54,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:02:54,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932926776] [2025-03-04 02:02:54,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:54,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:54,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:54,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:54,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:54,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 02:02:54,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:54,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:54,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 02:02:54,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:56,874 INFO L124 PetriNetUnfolderBase]: 26564/36649 cut-off events. [2025-03-04 02:02:56,874 INFO L125 PetriNetUnfolderBase]: For 13590/13590 co-relation queries the response was YES. [2025-03-04 02:02:56,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75524 conditions, 36649 events. 26564/36649 cut-off events. For 13590/13590 co-relation queries the response was YES. Maximal size of possible extension queue 1322. Compared 229747 event pairs, 26564 based on Foata normal form. 7422/43770 useless extension candidates. Maximal degree in co-relation 12605. Up to 34376 conditions per place. [2025-03-04 02:02:57,059 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 26 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-03-04 02:02:57,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 170 flow [2025-03-04 02:02:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-04 02:02:57,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:02:57,062 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 148 flow. Second operand 3 states and 81 transitions. [2025-03-04 02:02:57,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 170 flow [2025-03-04 02:02:57,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 38 transitions, 158 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:57,070 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 106 flow [2025-03-04 02:02:57,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-03-04 02:02:57,071 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2025-03-04 02:02:57,071 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 106 flow [2025-03-04 02:02:57,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:57,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:57,071 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:57,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:02:57,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-04 02:02:57,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1983285703, now seen corresponding path program 1 times [2025-03-04 02:02:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:57,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296800584] [2025-03-04 02:02:57,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:57,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:02:57,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:02:57,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:57,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:57,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:57,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:02:57,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:02:57,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:57,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:57,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:57,100 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:57,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-04 02:02:57,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-04 02:02:57,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-03-04 02:02:57,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-03-04 02:02:57,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-04 02:02:57,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-04 02:02:57,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-04 02:02:57,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:02:57,101 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 02:02:57,101 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:02:57,101 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-04 02:02:57,127 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:57,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 182 flow [2025-03-04 02:02:57,134 INFO L124 PetriNetUnfolderBase]: 6/76 cut-off events. [2025-03-04 02:02:57,135 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-04 02:02:57,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 76 events. 6/76 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 220 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 88. Up to 7 conditions per place. [2025-03-04 02:02:57,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 64 transitions, 182 flow [2025-03-04 02:02:57,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 64 transitions, 182 flow [2025-03-04 02:02:57,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:57,137 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3022a028, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:57,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 02:02:57,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:57,139 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-03-04 02:02:57,139 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:02:57,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:57,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:57,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:02:57,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1518831583, now seen corresponding path program 1 times [2025-03-04 02:02:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306628335] [2025-03-04 02:02:57,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:57,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:02:57,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:02:57,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:57,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:57,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:57,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306628335] [2025-03-04 02:02:57,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306628335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:57,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:57,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:02:57,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582371150] [2025-03-04 02:02:57,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:57,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:57,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:57,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:57,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:57,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2025-03-04 02:02:57,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:57,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:57,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2025-03-04 02:02:57,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:03:07,087 INFO L124 PetriNetUnfolderBase]: 164064/214479 cut-off events. [2025-03-04 02:03:07,088 INFO L125 PetriNetUnfolderBase]: For 98095/98095 co-relation queries the response was YES. [2025-03-04 02:03:07,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443980 conditions, 214479 events. 164064/214479 cut-off events. For 98095/98095 co-relation queries the response was YES. Maximal size of possible extension queue 6190. Compared 1414776 event pairs, 164064 based on Foata normal form. 44922/257900 useless extension candidates. Maximal degree in co-relation 76296. Up to 203126 conditions per place. [2025-03-04 02:03:08,571 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 31 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-03-04 02:03:08,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 208 flow [2025-03-04 02:03:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:03:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:03:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-04 02:03:08,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:03:08,573 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 182 flow. Second operand 3 states and 96 transitions. [2025-03-04 02:03:08,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 208 flow [2025-03-04 02:03:08,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 45 transitions, 188 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-03-04 02:03:08,605 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 126 flow [2025-03-04 02:03:08,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2025-03-04 02:03:08,606 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -11 predicate places. [2025-03-04 02:03:08,606 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 126 flow [2025-03-04 02:03:08,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:03:08,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:03:08,606 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:03:08,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:03:08,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:03:08,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:03:08,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1773813167, now seen corresponding path program 1 times [2025-03-04 02:03:08,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:03:08,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720669698] [2025-03-04 02:03:08,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:03:08,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:03:08,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:03:08,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:03:08,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:03:08,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:03:08,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:03:08,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:03:08,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:03:08,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:03:08,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:03:08,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:03:08,630 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:03:08,630 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-04 02:03:08,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-04 02:03:08,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-04 02:03:08,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-04 02:03:08,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-04 02:03:08,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-04 02:03:08,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-03-04 02:03:08,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-03-04 02:03:08,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:03:08,631 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 02:03:08,631 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:03:08,632 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-04 02:03:08,659 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:03:08,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 74 transitions, 218 flow [2025-03-04 02:03:08,667 INFO L124 PetriNetUnfolderBase]: 7/88 cut-off events. [2025-03-04 02:03:08,667 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-04 02:03:08,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 88 events. 7/88 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 268 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 108. Up to 8 conditions per place. [2025-03-04 02:03:08,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 74 transitions, 218 flow [2025-03-04 02:03:08,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 74 transitions, 218 flow [2025-03-04 02:03:08,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:03:08,671 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3022a028, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:03:08,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 02:03:08,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:03:08,672 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-03-04 02:03:08,673 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 02:03:08,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:03:08,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:03:08,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-03-04 02:03:08,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:03:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1066177489, now seen corresponding path program 1 times [2025-03-04 02:03:08,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:03:08,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760955499] [2025-03-04 02:03:08,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:03:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:03:08,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:03:08,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:03:08,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:03:08,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:03:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:03:08,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:03:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760955499] [2025-03-04 02:03:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760955499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:03:08,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:03:08,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:03:08,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577411791] [2025-03-04 02:03:08,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:03:08,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:03:08,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:03:08,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:03:08,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:03:08,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 74 [2025-03-04 02:03:08,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:03:08,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:03:08,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 74 [2025-03-04 02:03:08,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand