/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:21:07,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:21:07,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:21:07,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:21:07,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:21:07,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:21:07,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:21:07,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:21:07,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:21:07,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:21:07,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:21:07,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:21:07,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:21:07,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:21:07,464 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:21:07,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:21:07,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:21:07,465 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:21:07,466 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:21:07,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:21:07,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:21:07,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:21:07,467 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:21:07,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:21:07,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:21:07,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:21:07,704 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:21:07,704 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:21:07,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2025-04-13 20:21:08,928 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562709d1b/d69889f0f1004cb2812dab81b3d9dccd/FLAG37a52c90a [2025-04-13 20:21:09,131 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:21:09,132 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2025-04-13 20:21:09,137 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562709d1b/d69889f0f1004cb2812dab81b3d9dccd/FLAG37a52c90a [2025-04-13 20:21:09,930 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562709d1b/d69889f0f1004cb2812dab81b3d9dccd [2025-04-13 20:21:09,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:21:09,933 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:21:09,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:21:09,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:21:09,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:21:09,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:21:09" (1/1) ... [2025-04-13 20:21:09,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22013960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:09, skipping insertion in model container [2025-04-13 20:21:09,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:21:09" (1/1) ... [2025-04-13 20:21:09,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:21:10,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2025-04-13 20:21:10,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:21:10,174 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:21:10,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2025-04-13 20:21:10,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:21:10,224 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:21:10,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10 WrapperNode [2025-04-13 20:21:10,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:21:10,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:21:10,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:21:10,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:21:10,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,274 INFO L138 Inliner]: procedures = 25, calls = 73, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 445 [2025-04-13 20:21:10,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:21:10,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:21:10,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:21:10,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:21:10,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,316 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-13 20:21:10,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:21:10,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:21:10,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:21:10,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:21:10,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (1/1) ... [2025-04-13 20:21:10,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:21:10,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:21:10,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:21:10,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:21:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:21:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:21:10,391 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:21:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:21:10,391 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:21:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:21:10,391 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:21:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 20:21:10,391 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 20:21:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:21:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:21:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:21:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:21:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:21:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:21:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:21:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:21:10,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:21:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:21:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:21:10,393 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:21:10,478 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:21:10,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:21:10,931 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:21:10,931 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:21:10,932 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:21:11,350 INFO L313 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-13 20:21:11,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:21:11 BoogieIcfgContainer [2025-04-13 20:21:11,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:21:11,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:21:11,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:21:11,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:21:11,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:21:09" (1/3) ... [2025-04-13 20:21:11,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659ea5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:21:11, skipping insertion in model container [2025-04-13 20:21:11,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:10" (2/3) ... [2025-04-13 20:21:11,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659ea5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:21:11, skipping insertion in model container [2025-04-13 20:21:11,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:21:11" (3/3) ... [2025-04-13 20:21:11,357 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2025-04-13 20:21:11,367 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:21:11,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-2.wvr-bad.c that has 5 procedures, 40 locations, 55 edges, 1 initial locations, 8 loop locations, and 1 error locations. [2025-04-13 20:21:11,368 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:21:11,424 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 20:21:11,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 59 transitions, 146 flow [2025-04-13 20:21:11,471 INFO L116 PetriNetUnfolderBase]: 20/55 cut-off events. [2025-04-13 20:21:11,474 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:21:11,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 20/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 73 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 47. Up to 8 conditions per place. [2025-04-13 20:21:11,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 59 transitions, 146 flow [2025-04-13 20:21:11,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 54 transitions, 132 flow [2025-04-13 20:21:11,488 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:21:11,501 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6dd958d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:21:11,501 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 20:21:11,517 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:21:11,517 INFO L116 PetriNetUnfolderBase]: 20/53 cut-off events. [2025-04-13 20:21:11,517 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:21:11,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:11,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:11,518 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:11,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:11,522 INFO L85 PathProgramCache]: Analyzing trace with hash 858987692, now seen corresponding path program 1 times [2025-04-13 20:21:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:11,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431977831] [2025-04-13 20:21:11,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:11,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:21:11,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:21:11,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:11,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:11,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:11,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431977831] [2025-04-13 20:21:11,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431977831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:11,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:11,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:21:11,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008819268] [2025-04-13 20:21:11,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:11,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:11,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:11,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:11,931 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-13 20:21:11,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:11,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:11,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-13 20:21:11,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:13,159 INFO L116 PetriNetUnfolderBase]: 15369/18265 cut-off events. [2025-04-13 20:21:13,159 INFO L117 PetriNetUnfolderBase]: For 537/537 co-relation queries the response was YES. [2025-04-13 20:21:13,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37380 conditions, 18265 events. 15369/18265 cut-off events. For 537/537 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 63852 event pairs, 3586 based on Foata normal form. 1/10068 useless extension candidates. Maximal degree in co-relation 35472. Up to 10608 conditions per place. [2025-04-13 20:21:13,247 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 89 selfloop transitions, 7 changer transitions 1/97 dead transitions. [2025-04-13 20:21:13,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 97 transitions, 433 flow [2025-04-13 20:21:13,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-04-13 20:21:13,255 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6214689265536724 [2025-04-13 20:21:13,257 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 132 flow. Second operand 3 states and 110 transitions. [2025-04-13 20:21:13,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 97 transitions, 433 flow [2025-04-13 20:21:13,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 97 transitions, 403 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 20:21:13,278 INFO L231 Difference]: Finished difference. Result has 42 places, 60 transitions, 163 flow [2025-04-13 20:21:13,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=42, PETRI_TRANSITIONS=60} [2025-04-13 20:21:13,283 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2025-04-13 20:21:13,283 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 60 transitions, 163 flow [2025-04-13 20:21:13,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:13,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:13,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:13,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:21:13,284 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:13,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash 283577150, now seen corresponding path program 1 times [2025-04-13 20:21:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:13,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405376945] [2025-04-13 20:21:13,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:13,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:21:13,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:21:13,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:13,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:13,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:13,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405376945] [2025-04-13 20:21:13,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405376945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:13,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:13,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:21:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472130516] [2025-04-13 20:21:13,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:13,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:13,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:13,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:13,431 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-13 20:21:13,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 60 transitions, 163 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-04-13 20:21:13,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:13,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-13 20:21:13,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:14,290 INFO L116 PetriNetUnfolderBase]: 12321/14793 cut-off events. [2025-04-13 20:21:14,290 INFO L117 PetriNetUnfolderBase]: For 1722/1722 co-relation queries the response was YES. [2025-04-13 20:21:14,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32769 conditions, 14793 events. 12321/14793 cut-off events. For 1722/1722 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 52566 event pairs, 2791 based on Foata normal form. 0/8300 useless extension candidates. Maximal degree in co-relation 5558. Up to 8169 conditions per place. [2025-04-13 20:21:14,394 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 85 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2025-04-13 20:21:14,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 90 transitions, 412 flow [2025-04-13 20:21:14,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-04-13 20:21:14,396 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5875706214689266 [2025-04-13 20:21:14,396 INFO L175 Difference]: Start difference. First operand has 42 places, 60 transitions, 163 flow. Second operand 3 states and 104 transitions. [2025-04-13 20:21:14,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 90 transitions, 412 flow [2025-04-13 20:21:14,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 90 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:14,398 INFO L231 Difference]: Finished difference. Result has 45 places, 59 transitions, 184 flow [2025-04-13 20:21:14,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=45, PETRI_TRANSITIONS=59} [2025-04-13 20:21:14,398 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-04-13 20:21:14,398 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 59 transitions, 184 flow [2025-04-13 20:21:14,399 INFO L486 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-04-13 20:21:14,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:14,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:14,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:21:14,399 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:14,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash -287617222, now seen corresponding path program 1 times [2025-04-13 20:21:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:14,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426595871] [2025-04-13 20:21:14,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:14,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:14,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:21:14,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:21:14,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:14,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:14,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:14,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426595871] [2025-04-13 20:21:14,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426595871] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:14,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:14,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:21:14,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776500571] [2025-04-13 20:21:14,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:14,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:14,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:14,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:14,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:14,521 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-13 20:21:14,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 59 transitions, 184 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-04-13 20:21:14,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:14,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-13 20:21:14,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:15,573 INFO L116 PetriNetUnfolderBase]: 21331/25675 cut-off events. [2025-04-13 20:21:15,573 INFO L117 PetriNetUnfolderBase]: For 6449/6449 co-relation queries the response was YES. [2025-04-13 20:21:15,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60279 conditions, 25675 events. 21331/25675 cut-off events. For 6449/6449 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 94860 event pairs, 6100 based on Foata normal form. 594/15844 useless extension candidates. Maximal degree in co-relation 38556. Up to 14029 conditions per place. [2025-04-13 20:21:15,643 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 100 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2025-04-13 20:21:15,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 102 transitions, 517 flow [2025-04-13 20:21:15,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-04-13 20:21:15,645 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6214689265536724 [2025-04-13 20:21:15,645 INFO L175 Difference]: Start difference. First operand has 45 places, 59 transitions, 184 flow. Second operand 3 states and 110 transitions. [2025-04-13 20:21:15,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 102 transitions, 517 flow [2025-04-13 20:21:15,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 102 transitions, 501 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:21:15,716 INFO L231 Difference]: Finished difference. Result has 46 places, 59 transitions, 182 flow [2025-04-13 20:21:15,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=46, PETRI_TRANSITIONS=59} [2025-04-13 20:21:15,717 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2025-04-13 20:21:15,717 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 59 transitions, 182 flow [2025-04-13 20:21:15,717 INFO L486 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-04-13 20:21:15,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:15,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:15,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:21:15,718 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:15,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:15,718 INFO L85 PathProgramCache]: Analyzing trace with hash -380129802, now seen corresponding path program 1 times [2025-04-13 20:21:15,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:15,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218437147] [2025-04-13 20:21:15,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:15,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:15,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:21:15,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:21:15,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:15,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:15,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:15,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218437147] [2025-04-13 20:21:15,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218437147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:15,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:15,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:21:15,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396936450] [2025-04-13 20:21:15,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:15,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:15,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:15,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:15,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:15,826 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-13 20:21:15,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 59 transitions, 182 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-04-13 20:21:15,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:15,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-13 20:21:15,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:17,323 INFO L116 PetriNetUnfolderBase]: 26011/31470 cut-off events. [2025-04-13 20:21:17,323 INFO L117 PetriNetUnfolderBase]: For 6311/6311 co-relation queries the response was YES. [2025-04-13 20:21:17,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72511 conditions, 31470 events. 26011/31470 cut-off events. For 6311/6311 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 123339 event pairs, 4878 based on Foata normal form. 330/18683 useless extension candidates. Maximal degree in co-relation 44720. Up to 26342 conditions per place. [2025-04-13 20:21:17,409 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 86 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2025-04-13 20:21:17,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 90 transitions, 442 flow [2025-04-13 20:21:17,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-04-13 20:21:17,411 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5423728813559322 [2025-04-13 20:21:17,411 INFO L175 Difference]: Start difference. First operand has 46 places, 59 transitions, 182 flow. Second operand 3 states and 96 transitions. [2025-04-13 20:21:17,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 90 transitions, 442 flow [2025-04-13 20:21:17,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 90 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:17,414 INFO L231 Difference]: Finished difference. Result has 48 places, 62 transitions, 208 flow [2025-04-13 20:21:17,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=62} [2025-04-13 20:21:17,415 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2025-04-13 20:21:17,415 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 62 transitions, 208 flow [2025-04-13 20:21:17,415 INFO L486 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-04-13 20:21:17,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:17,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:17,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:21:17,415 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:17,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1996027142, now seen corresponding path program 1 times [2025-04-13 20:21:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:17,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675004163] [2025-04-13 20:21:17,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:17,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:21:17,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:21:17,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:17,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:17,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:17,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675004163] [2025-04-13 20:21:17,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675004163] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:17,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:17,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:21:17,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428484186] [2025-04-13 20:21:17,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:17,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:17,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:17,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:17,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:17,488 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-13 20:21:17,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 62 transitions, 208 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-04-13 20:21:17,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:17,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-13 20:21:17,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:19,284 INFO L116 PetriNetUnfolderBase]: 43099/52166 cut-off events. [2025-04-13 20:21:19,285 INFO L117 PetriNetUnfolderBase]: For 15030/15030 co-relation queries the response was YES. [2025-04-13 20:21:19,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127716 conditions, 52166 events. 43099/52166 cut-off events. For 15030/15030 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 208502 event pairs, 13654 based on Foata normal form. 1276/30929 useless extension candidates. Maximal degree in co-relation 104588. Up to 29434 conditions per place. [2025-04-13 20:21:19,461 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 102 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-04-13 20:21:19,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 104 transitions, 550 flow [2025-04-13 20:21:19,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-04-13 20:21:19,462 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6101694915254238 [2025-04-13 20:21:19,462 INFO L175 Difference]: Start difference. First operand has 48 places, 62 transitions, 208 flow. Second operand 3 states and 108 transitions. [2025-04-13 20:21:19,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 104 transitions, 550 flow [2025-04-13 20:21:19,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 104 transitions, 546 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:19,468 INFO L231 Difference]: Finished difference. Result has 50 places, 62 transitions, 212 flow [2025-04-13 20:21:19,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=50, PETRI_TRANSITIONS=62} [2025-04-13 20:21:19,469 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2025-04-13 20:21:19,469 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 62 transitions, 212 flow [2025-04-13 20:21:19,469 INFO L486 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-04-13 20:21:19,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:19,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:19,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:21:19,470 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:19,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1170427648, now seen corresponding path program 1 times [2025-04-13 20:21:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:19,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359482906] [2025-04-13 20:21:19,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:19,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:21:19,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:21:19,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:19,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:19,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:19,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359482906] [2025-04-13 20:21:19,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359482906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:19,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:19,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:21:19,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660831229] [2025-04-13 20:21:19,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:19,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:19,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:19,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:19,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-13 20:21:19,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 62 transitions, 212 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-04-13 20:21:19,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:19,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-13 20:21:19,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:22,537 INFO L116 PetriNetUnfolderBase]: 54985/66612 cut-off events. [2025-04-13 20:21:22,538 INFO L117 PetriNetUnfolderBase]: For 18938/18938 co-relation queries the response was YES. [2025-04-13 20:21:22,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164407 conditions, 66612 events. 54985/66612 cut-off events. For 18938/18938 co-relation queries the response was YES. Maximal size of possible extension queue 1825. Compared 280469 event pairs, 20156 based on Foata normal form. 0/37824 useless extension candidates. Maximal degree in co-relation 85616. Up to 38552 conditions per place. [2025-04-13 20:21:22,774 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 94 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2025-04-13 20:21:22,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 100 transitions, 549 flow [2025-04-13 20:21:22,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-04-13 20:21:22,775 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2025-04-13 20:21:22,775 INFO L175 Difference]: Start difference. First operand has 50 places, 62 transitions, 212 flow. Second operand 3 states and 102 transitions. [2025-04-13 20:21:22,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 100 transitions, 549 flow [2025-04-13 20:21:22,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 100 transitions, 546 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:22,784 INFO L231 Difference]: Finished difference. Result has 53 places, 63 transitions, 242 flow [2025-04-13 20:21:22,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=53, PETRI_TRANSITIONS=63} [2025-04-13 20:21:22,786 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2025-04-13 20:21:22,786 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 63 transitions, 242 flow [2025-04-13 20:21:22,786 INFO L486 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-04-13 20:21:22,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:22,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:22,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:21:22,787 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:22,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash 870747732, now seen corresponding path program 1 times [2025-04-13 20:21:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:22,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257808220] [2025-04-13 20:21:22,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:22,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:22,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:21:22,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:21:22,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:22,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:22,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:22,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257808220] [2025-04-13 20:21:22,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257808220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:22,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:22,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:21:22,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247455592] [2025-04-13 20:21:22,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:22,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:22,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:22,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:22,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:22,838 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-13 20:21:22,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 63 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:22,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:22,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-13 20:21:22,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:25,861 INFO L116 PetriNetUnfolderBase]: 55718/68047 cut-off events. [2025-04-13 20:21:25,861 INFO L117 PetriNetUnfolderBase]: For 43183/43183 co-relation queries the response was YES. [2025-04-13 20:21:25,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182760 conditions, 68047 events. 55718/68047 cut-off events. For 43183/43183 co-relation queries the response was YES. Maximal size of possible extension queue 1733. Compared 294099 event pairs, 21083 based on Foata normal form. 0/44750 useless extension candidates. Maximal degree in co-relation 92396. Up to 45931 conditions per place. [2025-04-13 20:21:26,100 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 97 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2025-04-13 20:21:26,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 587 flow [2025-04-13 20:21:26,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-04-13 20:21:26,101 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5875706214689266 [2025-04-13 20:21:26,101 INFO L175 Difference]: Start difference. First operand has 53 places, 63 transitions, 242 flow. Second operand 3 states and 104 transitions. [2025-04-13 20:21:26,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 101 transitions, 587 flow [2025-04-13 20:21:26,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:21:26,159 INFO L231 Difference]: Finished difference. Result has 55 places, 63 transitions, 250 flow [2025-04-13 20:21:26,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=55, PETRI_TRANSITIONS=63} [2025-04-13 20:21:26,159 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2025-04-13 20:21:26,159 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 63 transitions, 250 flow [2025-04-13 20:21:26,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:26,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:26,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:26,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:21:26,160 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:26,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1883738870, now seen corresponding path program 1 times [2025-04-13 20:21:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:26,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536888620] [2025-04-13 20:21:26,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:26,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:21:26,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:21:26,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:26,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:26,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536888620] [2025-04-13 20:21:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536888620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:26,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:26,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:21:26,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646509007] [2025-04-13 20:21:26,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:26,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:26,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:26,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:26,216 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-13 20:21:26,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 63 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:26,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:26,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-13 20:21:26,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:29,094 INFO L116 PetriNetUnfolderBase]: 51125/62875 cut-off events. [2025-04-13 20:21:29,094 INFO L117 PetriNetUnfolderBase]: For 43703/43703 co-relation queries the response was YES. [2025-04-13 20:21:29,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176553 conditions, 62875 events. 51125/62875 cut-off events. For 43703/43703 co-relation queries the response was YES. Maximal size of possible extension queue 1566. Compared 275351 event pairs, 20974 based on Foata normal form. 0/45717 useless extension candidates. Maximal degree in co-relation 105205. Up to 41779 conditions per place. [2025-04-13 20:21:29,362 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 96 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-04-13 20:21:29,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 100 transitions, 602 flow [2025-04-13 20:21:29,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-04-13 20:21:29,363 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2025-04-13 20:21:29,363 INFO L175 Difference]: Start difference. First operand has 55 places, 63 transitions, 250 flow. Second operand 3 states and 102 transitions. [2025-04-13 20:21:29,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 100 transitions, 602 flow [2025-04-13 20:21:29,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 100 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:21:29,388 INFO L231 Difference]: Finished difference. Result has 57 places, 63 transitions, 262 flow [2025-04-13 20:21:29,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=57, PETRI_TRANSITIONS=63} [2025-04-13 20:21:29,388 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2025-04-13 20:21:29,388 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 63 transitions, 262 flow [2025-04-13 20:21:29,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:29,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:29,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:29,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:21:29,389 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:29,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:29,389 INFO L85 PathProgramCache]: Analyzing trace with hash -485665766, now seen corresponding path program 1 times [2025-04-13 20:21:29,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:29,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926097927] [2025-04-13 20:21:29,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:29,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:29,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:21:29,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:21:29,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:29,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:29,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:29,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926097927] [2025-04-13 20:21:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926097927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:29,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:29,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:21:29,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702455373] [2025-04-13 20:21:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:29,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:21:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:29,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:21:29,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:21:29,509 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-13 20:21:29,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:29,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:29,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-13 20:21:29,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:32,267 INFO L116 PetriNetUnfolderBase]: 51684/63719 cut-off events. [2025-04-13 20:21:32,267 INFO L117 PetriNetUnfolderBase]: For 48133/48133 co-relation queries the response was YES. [2025-04-13 20:21:32,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187449 conditions, 63719 events. 51684/63719 cut-off events. For 48133/48133 co-relation queries the response was YES. Maximal size of possible extension queue 1551. Compared 281843 event pairs, 32468 based on Foata normal form. 67/50504 useless extension candidates. Maximal degree in co-relation 112775. Up to 62876 conditions per place. [2025-04-13 20:21:32,513 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 62 selfloop transitions, 2 changer transitions 27/91 dead transitions. [2025-04-13 20:21:32,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 91 transitions, 516 flow [2025-04-13 20:21:32,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:21:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:21:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-04-13 20:21:32,514 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4194915254237288 [2025-04-13 20:21:32,514 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 262 flow. Second operand 4 states and 99 transitions. [2025-04-13 20:21:32,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 91 transitions, 516 flow [2025-04-13 20:21:32,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 91 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:21:32,547 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 268 flow [2025-04-13 20:21:32,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2025-04-13 20:21:32,547 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2025-04-13 20:21:32,547 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 268 flow [2025-04-13 20:21:32,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:32,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:32,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:32,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:21:32,548 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:32,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash 845584123, now seen corresponding path program 1 times [2025-04-13 20:21:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:32,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910430494] [2025-04-13 20:21:32,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:32,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:32,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:21:32,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:21:32,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:32,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:33,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:33,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910430494] [2025-04-13 20:21:33,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910430494] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:21:33,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962882490] [2025-04-13 20:21:33,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:33,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:33,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:21:33,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:21:33,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:21:33,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:21:33,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:21:33,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:33,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:33,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 20:21:33,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:21:33,300 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:21:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:33,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:21:33,994 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 20:21:34,008 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:21:34,009 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-04-13 20:21:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:34,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962882490] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:21:34,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:21:34,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-04-13 20:21:34,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011909036] [2025-04-13 20:21:34,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:21:34,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:21:34,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:34,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:21:34,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:21:34,062 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-13 20:21:34,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 268 flow. Second operand has 18 states, 18 states have (on average 8.5) internal successors, (153), 18 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:34,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:34,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-13 20:21:34,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:52,140 INFO L116 PetriNetUnfolderBase]: 298378/366553 cut-off events. [2025-04-13 20:21:52,140 INFO L117 PetriNetUnfolderBase]: For 245906/245906 co-relation queries the response was YES. [2025-04-13 20:21:52,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1061405 conditions, 366553 events. 298378/366553 cut-off events. For 245906/245906 co-relation queries the response was YES. Maximal size of possible extension queue 7398. Compared 1904678 event pairs, 19954 based on Foata normal form. 100/281716 useless extension candidates. Maximal degree in co-relation 1061377. Up to 71762 conditions per place. [2025-04-13 20:21:53,911 INFO L140 encePairwiseOnDemand]: 40/59 looper letters, 382 selfloop transitions, 57 changer transitions 11/450 dead transitions. [2025-04-13 20:21:53,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 450 transitions, 2610 flow [2025-04-13 20:21:53,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:21:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:21:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 480 transitions. [2025-04-13 20:21:53,913 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4785643070787637 [2025-04-13 20:21:53,913 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 268 flow. Second operand 17 states and 480 transitions. [2025-04-13 20:21:53,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 450 transitions, 2610 flow [2025-04-13 20:21:54,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 450 transitions, 2598 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 20:21:54,031 INFO L231 Difference]: Finished difference. Result has 79 places, 123 transitions, 810 flow [2025-04-13 20:21:54,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=810, PETRI_PLACES=79, PETRI_TRANSITIONS=123} [2025-04-13 20:21:54,035 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2025-04-13 20:21:54,035 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 123 transitions, 810 flow [2025-04-13 20:21:54,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.5) internal successors, (153), 18 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:54,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:54,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:54,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:21:54,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 20:21:54,236 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:21:54,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:54,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1470031205, now seen corresponding path program 1 times [2025-04-13 20:21:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:54,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752210988] [2025-04-13 20:21:54,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:54,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:54,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:21:54,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:21:54,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:54,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:21:54,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:54,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752210988] [2025-04-13 20:21:54,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752210988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:54,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:21:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528748946] [2025-04-13 20:21:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:54,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:54,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:54,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:54,350 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-13 20:21:54,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 123 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:54,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:54,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-13 20:21:54,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand