./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/01b_inc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/01b_inc.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 f8560a665e9f795d0e42a91570dfb6029ba2a9fa9f17754a8891b62ccadb5cdc --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:26:35,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:26:36,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:26:36,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:26:36,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:26:36,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:26:36,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:26:36,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:26:36,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:26:36,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:26:36,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:26:36,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:26:36,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:26:36,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:26:36,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:26:36,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:26:36,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:26:36,044 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 -> f8560a665e9f795d0e42a91570dfb6029ba2a9fa9f17754a8891b62ccadb5cdc [2025-03-13 21:26:36,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:26:36,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:26:36,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:26:36,264 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:26:36,264 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:26:36,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/01b_inc.i [2025-03-13 21:26:37,389 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76612dbf8/a8371cbdf3c6470e95f121aa8c9e057c/FLAGf2fda6147 [2025-03-13 21:26:37,658 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:26:37,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/01b_inc.i [2025-03-13 21:26:37,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76612dbf8/a8371cbdf3c6470e95f121aa8c9e057c/FLAGf2fda6147 [2025-03-13 21:26:37,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76612dbf8/a8371cbdf3c6470e95f121aa8c9e057c [2025-03-13 21:26:37,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:26:37,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:26:37,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:26:37,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:26:37,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:26:37,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:26:37" (1/1) ... [2025-03-13 21:26:37,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f6fc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:37, skipping insertion in model container [2025-03-13 21:26:37,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:26:37" (1/1) ... [2025-03-13 21:26:38,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:26:38,240 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/01b_inc.i[30739,30752] [2025-03-13 21:26:38,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:26:38,261 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:26:38,297 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/01b_inc.i[30739,30752] [2025-03-13 21:26:38,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:26:38,321 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:26:38,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38 WrapperNode [2025-03-13 21:26:38,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:26:38,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:26:38,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:26:38,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:26:38,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,343 INFO L138 Inliner]: procedures = 163, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-03-13 21:26:38,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:26:38,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:26:38,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:26:38,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:26:38,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,356 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-13 21:26:38,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:26:38,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:26:38,366 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:26:38,367 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:26:38,367 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (1/1) ... [2025-03-13 21:26:38,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:26:38,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:38,394 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-13 21:26:38,396 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-13 21:26:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:26:38,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:26:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:26:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:26:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:26:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:26:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:26:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:26:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:26:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:26:38,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:26:38,413 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:26:38,481 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:26:38,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:26:38,572 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:26:38,573 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:26:38,573 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:26:38,668 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:26:38,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:38 BoogieIcfgContainer [2025-03-13 21:26:38,668 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:26:38,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:26:38,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:26:38,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:26:38,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:26:37" (1/3) ... [2025-03-13 21:26:38,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da852d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:26:38, skipping insertion in model container [2025-03-13 21:26:38,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:38" (2/3) ... [2025-03-13 21:26:38,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da852d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:26:38, skipping insertion in model container [2025-03-13 21:26:38,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:38" (3/3) ... [2025-03-13 21:26:38,678 INFO L128 eAbstractionObserver]: Analyzing ICFG 01b_inc.i [2025-03-13 21:26:38,688 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:26:38,690 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 01b_inc.i that has 2 procedures, 19 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-13 21:26:38,690 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:26:38,720 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:26:38,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 20 transitions, 44 flow [2025-03-13 21:26:38,765 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-03-13 21:26:38,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:26:38,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 22 events. 1/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-03-13 21:26:38,768 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 20 transitions, 44 flow [2025-03-13 21:26:38,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 20 transitions, 44 flow [2025-03-13 21:26:38,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:26:38,787 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;@2b6632ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:26:38,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:26:38,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:26:38,796 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-13 21:26:38,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:26:38,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:38,796 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-13 21:26:38,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-13 21:26:38,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:38,801 INFO L85 PathProgramCache]: Analyzing trace with hash -560916821, now seen corresponding path program 1 times [2025-03-13 21:26:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:38,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709533930] [2025-03-13 21:26:38,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:38,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:38,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-13 21:26:38,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-13 21:26:38,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:38,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:26:38,868 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:26:38,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-13 21:26:38,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-13 21:26:38,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:38,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:26:38,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:26:38,897 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:26:38,898 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-13 21:26:38,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-13 21:26:38,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-13 21:26:38,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:26:38,900 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-13 21:26:38,904 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:26:38,904 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:26:38,920 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:26:38,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 80 flow [2025-03-13 21:26:38,932 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-03-13 21:26:38,933 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:26:38,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 40 events. 2/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 31. Up to 3 conditions per place. [2025-03-13 21:26:38,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 80 flow [2025-03-13 21:26:38,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 35 transitions, 80 flow [2025-03-13 21:26:38,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:26:38,935 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;@2b6632ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:26:38,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:26:38,940 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:26:38,940 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-13 21:26:38,940 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:26:38,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:38,940 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-13 21:26:38,940 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-13 21:26:38,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:38,941 INFO L85 PathProgramCache]: Analyzing trace with hash 756201001, now seen corresponding path program 1 times [2025-03-13 21:26:38,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:38,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394855972] [2025-03-13 21:26:38,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:38,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:38,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:26:38,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:26:38,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:38,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:26:38,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:26:38,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:26:38,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:26:38,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:38,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:26:38,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:26:38,983 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:26:38,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-13 21:26:38,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-13 21:26:38,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-13 21:26:38,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-13 21:26:38,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:26:38,984 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-13 21:26:38,985 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:26:38,985 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:26:39,028 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:26:39,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 50 transitions, 118 flow [2025-03-13 21:26:39,044 INFO L124 PetriNetUnfolderBase]: 3/58 cut-off events. [2025-03-13 21:26:39,046 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:26:39,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 3/58 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 155 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2025-03-13 21:26:39,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 50 transitions, 118 flow [2025-03-13 21:26:39,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 118 flow [2025-03-13 21:26:39,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:26:39,049 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;@2b6632ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:26:39,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:26:39,056 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:26:39,058 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-13 21:26:39,058 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:26:39,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:39,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:39,058 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-13 21:26:39,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:39,059 INFO L85 PathProgramCache]: Analyzing trace with hash 163919601, now seen corresponding path program 1 times [2025-03-13 21:26:39,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:39,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945618746] [2025-03-13 21:26:39,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:39,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:39,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:26:39,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:26:39,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:39,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:39,299 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-13 21:26:39,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:39,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945618746] [2025-03-13 21:26:39,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945618746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:39,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:39,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:39,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766675916] [2025-03-13 21:26:39,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:39,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:26:39,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:39,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:26:39,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:26:39,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:26:39,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:39,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:39,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:26:39,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:40,708 INFO L124 PetriNetUnfolderBase]: 11367/19206 cut-off events. [2025-03-13 21:26:40,708 INFO L125 PetriNetUnfolderBase]: For 706/706 co-relation queries the response was YES. [2025-03-13 21:26:40,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35951 conditions, 19206 events. 11367/19206 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 156469 event pairs, 3321 based on Foata normal form. 0/16619 useless extension candidates. Maximal degree in co-relation 19822. Up to 7422 conditions per place. [2025-03-13 21:26:40,811 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 104 selfloop transitions, 12 changer transitions 0/129 dead transitions. [2025-03-13 21:26:40,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 129 transitions, 546 flow [2025-03-13 21:26:40,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:26:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:26:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2025-03-13 21:26:40,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-13 21:26:40,821 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 118 flow. Second operand 6 states and 205 transitions. [2025-03-13 21:26:40,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 129 transitions, 546 flow [2025-03-13 21:26:40,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 129 transitions, 536 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-13 21:26:40,830 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 205 flow [2025-03-13 21:26:40,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2025-03-13 21:26:40,834 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2025-03-13 21:26:40,834 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 205 flow [2025-03-13 21:26:40,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:40,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:40,834 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-13 21:26:40,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:26:40,835 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-13 21:26:40,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1387188054, now seen corresponding path program 1 times [2025-03-13 21:26:40,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:40,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866768007] [2025-03-13 21:26:40,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:40,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:26:40,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:26:40,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:40,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:26:40,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:26:40,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:26:40,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:26:40,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:40,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:26:40,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:26:40,863 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:26:40,863 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-13 21:26:40,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-13 21:26:40,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-13 21:26:40,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-13 21:26:40,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-13 21:26:40,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:26:40,864 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 21:26:40,865 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:26:40,865 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:26:40,885 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:26:40,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 65 transitions, 158 flow [2025-03-13 21:26:40,893 INFO L124 PetriNetUnfolderBase]: 4/76 cut-off events. [2025-03-13 21:26:40,893 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:26:40,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 76 events. 4/76 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 221 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 70. Up to 5 conditions per place. [2025-03-13 21:26:40,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 65 transitions, 158 flow [2025-03-13 21:26:40,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 65 transitions, 158 flow [2025-03-13 21:26:40,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:26:40,897 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;@2b6632ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:26:40,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:26:40,900 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:26:40,900 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-03-13 21:26:40,900 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:26:40,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:40,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:40,902 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-13 21:26:40,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:40,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1938756704, now seen corresponding path program 1 times [2025-03-13 21:26:40,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:40,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109476031] [2025-03-13 21:26:40,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:40,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:40,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:26:40,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:26:40,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:40,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:40,992 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-13 21:26:40,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109476031] [2025-03-13 21:26:40,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109476031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:40,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:40,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:40,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369632027] [2025-03-13 21:26:40,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:40,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:26:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:40,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:26:40,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:26:40,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 65 [2025-03-13 21:26:40,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:40,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:40,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 65 [2025-03-13 21:26:40,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:53,889 INFO L124 PetriNetUnfolderBase]: 207509/303710 cut-off events. [2025-03-13 21:26:53,889 INFO L125 PetriNetUnfolderBase]: For 16564/16564 co-relation queries the response was YES. [2025-03-13 21:26:54,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580116 conditions, 303710 events. 207509/303710 cut-off events. For 16564/16564 co-relation queries the response was YES. Maximal size of possible extension queue 12236. Compared 2720405 event pairs, 70548 based on Foata normal form. 0/257898 useless extension candidates. Maximal degree in co-relation 131702. Up to 133343 conditions per place. [2025-03-13 21:26:55,814 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 144 selfloop transitions, 15 changer transitions 0/176 dead transitions. [2025-03-13 21:26:55,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 176 transitions, 772 flow [2025-03-13 21:26:55,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:26:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:26:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 274 transitions. [2025-03-13 21:26:55,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7025641025641025 [2025-03-13 21:26:55,817 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 158 flow. Second operand 6 states and 274 transitions. [2025-03-13 21:26:55,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 176 transitions, 772 flow [2025-03-13 21:26:55,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 176 transitions, 742 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-03-13 21:26:55,832 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 268 flow [2025-03-13 21:26:55,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2025-03-13 21:26:55,833 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2025-03-13 21:26:55,833 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 268 flow [2025-03-13 21:26:55,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:55,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:55,833 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:55,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:26:55,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:26:55,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:55,834 INFO L85 PathProgramCache]: Analyzing trace with hash -31148365, now seen corresponding path program 1 times [2025-03-13 21:26:55,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:55,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832640063] [2025-03-13 21:26:55,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:55,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:55,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:26:55,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:26:55,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:55,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:55,936 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-13 21:26:55,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:55,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832640063] [2025-03-13 21:26:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832640063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:55,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:55,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:26:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125487022] [2025-03-13 21:26:55,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:55,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:26:55,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:55,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:26:55,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:26:55,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 65 [2025-03-13 21:26:55,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-13 21:26:55,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:55,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 65 [2025-03-13 21:26:55,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand