/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-1.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:20:58,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:20:58,831 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:20:58,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:20:58,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:20:58,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:20:58,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:20:58,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:20:58,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:20:58,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:20:58,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:20:58,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:20:58,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:20:58,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:20:58,858 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:20:58,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:20:58,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:20:58,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:20:58,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:20:58,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:20:58,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:20:58,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:20:58,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:20:58,860 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:20:59,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:20:59,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:20:59,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:20:59,094 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:20:59,096 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:20:59,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2025-04-13 20:21:00,361 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a134a809/e5e3c93b9e384e6b8a93a6077e57f228/FLAGaa0edbb3a [2025-04-13 20:21:00,540 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:21:00,541 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2025-04-13 20:21:00,546 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a134a809/e5e3c93b9e384e6b8a93a6077e57f228/FLAGaa0edbb3a [2025-04-13 20:21:01,363 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a134a809/e5e3c93b9e384e6b8a93a6077e57f228 [2025-04-13 20:21:01,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:21:01,366 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:21:01,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:21:01,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:21:01,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:21:01,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:21:01" (1/1) ... [2025-04-13 20:21:01,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2ebb35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:01, skipping insertion in model container [2025-04-13 20:21:01,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:21:01" (1/1) ... [2025-04-13 20:21:01,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:21:01,551 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-1.wvr-bad.c[5161,5174] [2025-04-13 20:21:01,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:21:01,566 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:21:01,597 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-1.wvr-bad.c[5161,5174] [2025-04-13 20:21:01,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:21:01,609 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:21:01,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:01 WrapperNode [2025-04-13 20:21:01,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:21:01,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:21:01,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:21:01,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:21:01,614 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:01" (1/1) ... [2025-04-13 20:21:01,621 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:01" (1/1) ... [2025-04-13 20:21:01,646 INFO L138 Inliner]: procedures = 24, calls = 53, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 325 [2025-04-13 20:21:01,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:21:01,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:21:01,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:21:01,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:21:01,660 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:01" (1/1) ... [2025-04-13 20:21:01,660 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:01" (1/1) ... [2025-04-13 20:21:01,668 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:01" (1/1) ... [2025-04-13 20:21:01,689 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 20:21:01,689 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:01" (1/1) ... [2025-04-13 20:21:01,689 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:01" (1/1) ... [2025-04-13 20:21:01,702 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:01" (1/1) ... [2025-04-13 20:21:01,703 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:01" (1/1) ... [2025-04-13 20:21:01,705 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:01" (1/1) ... [2025-04-13 20:21:01,706 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:01" (1/1) ... [2025-04-13 20:21:01,707 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:01" (1/1) ... [2025-04-13 20:21:01,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:21:01,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:21:01,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:21:01,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:21:01,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:01" (1/1) ... [2025-04-13 20:21:01,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:21:01,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:21:01,743 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:01,745 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:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:21:01,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:21:01,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:21:01,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:21:01,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:21:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:21:01,763 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:01,844 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:21:01,845 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:21:02,184 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:21:02,185 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:21:02,185 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:21:02,515 INFO L313 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-13 20:21:02,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:21:02 BoogieIcfgContainer [2025-04-13 20:21:02,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:21:02,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:21:02,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:21:02,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:21:02,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:21:01" (1/3) ... [2025-04-13 20:21:02,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737ed7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:21:02, skipping insertion in model container [2025-04-13 20:21:02,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:21:01" (2/3) ... [2025-04-13 20:21:02,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737ed7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:21:02, skipping insertion in model container [2025-04-13 20:21:02,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:21:02" (3/3) ... [2025-04-13 20:21:02,522 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-04-13 20:21:02,533 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:21:02,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 30 locations, 40 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 20:21:02,535 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:21:02,582 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:21:02,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 43 transitions, 107 flow [2025-04-13 20:21:02,623 INFO L116 PetriNetUnfolderBase]: 14/40 cut-off events. [2025-04-13 20:21:02,625 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:21:02,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 14/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 49 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 31. Up to 6 conditions per place. [2025-04-13 20:21:02,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 43 transitions, 107 flow [2025-04-13 20:21:02,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 39 transitions, 96 flow [2025-04-13 20:21:02,663 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:21:02,675 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;@2e4eefe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:21:02,675 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:21:02,685 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:21:02,686 INFO L116 PetriNetUnfolderBase]: 14/38 cut-off events. [2025-04-13 20:21:02,686 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:21:02,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:02,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:02,687 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 1 more)] === [2025-04-13 20:21:02,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash -120944188, now seen corresponding path program 1 times [2025-04-13 20:21:02,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:02,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745444405] [2025-04-13 20:21:02,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:02,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:02,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:21:02,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:21:02,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:02,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:03,034 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:03,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:03,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745444405] [2025-04-13 20:21:03,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745444405] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:03,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:03,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:21:03,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9095180] [2025-04-13 20:21:03,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:03,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:03,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:03,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:03,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:03,063 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:03,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 39 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:03,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:03,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:03,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:03,375 INFO L116 PetriNetUnfolderBase]: 2056/2607 cut-off events. [2025-04-13 20:21:03,376 INFO L117 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-04-13 20:21:03,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5383 conditions, 2607 events. 2056/2607 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 8699 event pairs, 466 based on Foata normal form. 1/1483 useless extension candidates. Maximal degree in co-relation 5016. Up to 1502 conditions per place. [2025-04-13 20:21:03,393 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 63 selfloop transitions, 5 changer transitions 1/69 dead transitions. [2025-04-13 20:21:03,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 69 transitions, 309 flow [2025-04-13 20:21:03,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-04-13 20:21:03,401 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6124031007751938 [2025-04-13 20:21:03,402 INFO L175 Difference]: Start difference. First operand has 35 places, 39 transitions, 96 flow. Second operand 3 states and 79 transitions. [2025-04-13 20:21:03,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 69 transitions, 309 flow [2025-04-13 20:21:03,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 69 transitions, 287 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:21:03,414 INFO L231 Difference]: Finished difference. Result has 32 places, 43 transitions, 117 flow [2025-04-13 20:21:03,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=32, PETRI_TRANSITIONS=43} [2025-04-13 20:21:03,419 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-04-13 20:21:03,419 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 43 transitions, 117 flow [2025-04-13 20:21:03,419 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:03,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:03,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:03,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:21:03,420 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 1 more)] === [2025-04-13 20:21:03,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash 408722560, now seen corresponding path program 1 times [2025-04-13 20:21:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:03,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668206313] [2025-04-13 20:21:03,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:03,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:21:03,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:21:03,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:03,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:03,528 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:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:03,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668206313] [2025-04-13 20:21:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668206313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:03,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:21:03,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260138190] [2025-04-13 20:21:03,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:03,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:03,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:03,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:03,530 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:03,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 43 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:03,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:03,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:03,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:03,918 INFO L116 PetriNetUnfolderBase]: 3884/4946 cut-off events. [2025-04-13 20:21:03,918 INFO L117 PetriNetUnfolderBase]: For 632/632 co-relation queries the response was YES. [2025-04-13 20:21:03,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10944 conditions, 4946 events. 3884/4946 cut-off events. For 632/632 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 18203 event pairs, 1136 based on Foata normal form. 164/2893 useless extension candidates. Maximal degree in co-relation 4405. Up to 2770 conditions per place. [2025-04-13 20:21:03,939 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 69 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-04-13 20:21:03,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 72 transitions, 335 flow [2025-04-13 20:21:03,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-04-13 20:21:03,941 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5968992248062015 [2025-04-13 20:21:03,941 INFO L175 Difference]: Start difference. First operand has 32 places, 43 transitions, 117 flow. Second operand 3 states and 77 transitions. [2025-04-13 20:21:03,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 72 transitions, 335 flow [2025-04-13 20:21:03,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 72 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:03,943 INFO L231 Difference]: Finished difference. Result has 34 places, 45 transitions, 137 flow [2025-04-13 20:21:03,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=34, PETRI_TRANSITIONS=45} [2025-04-13 20:21:03,943 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-04-13 20:21:03,943 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 45 transitions, 137 flow [2025-04-13 20:21:03,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:03,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:03,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:03,947 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:21:03,947 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 1 more)] === [2025-04-13 20:21:03,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash 865636986, now seen corresponding path program 1 times [2025-04-13 20:21:03,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:03,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707902731] [2025-04-13 20:21:03,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:03,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:03,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:21:03,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:21:03,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:03,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:04,042 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:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:04,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707902731] [2025-04-13 20:21:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707902731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:04,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:04,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:21:04,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239295368] [2025-04-13 20:21:04,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:04,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:04,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:04,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:04,044 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:04,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 45 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:04,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:04,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:04,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:04,579 INFO L116 PetriNetUnfolderBase]: 7384/9456 cut-off events. [2025-04-13 20:21:04,579 INFO L117 PetriNetUnfolderBase]: For 1872/1872 co-relation queries the response was YES. [2025-04-13 20:21:04,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21804 conditions, 9456 events. 7384/9456 cut-off events. For 1872/1872 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 39911 event pairs, 2128 based on Foata normal form. 244/5345 useless extension candidates. Maximal degree in co-relation 9497. Up to 5093 conditions per place. [2025-04-13 20:21:04,619 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 78 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2025-04-13 20:21:04,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 80 transitions, 404 flow [2025-04-13 20:21:04,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-04-13 20:21:04,621 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6124031007751938 [2025-04-13 20:21:04,621 INFO L175 Difference]: Start difference. First operand has 34 places, 45 transitions, 137 flow. Second operand 3 states and 79 transitions. [2025-04-13 20:21:04,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 80 transitions, 404 flow [2025-04-13 20:21:04,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 80 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:04,624 INFO L231 Difference]: Finished difference. Result has 36 places, 46 transitions, 148 flow [2025-04-13 20:21:04,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=36, PETRI_TRANSITIONS=46} [2025-04-13 20:21:04,625 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2025-04-13 20:21:04,625 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 46 transitions, 148 flow [2025-04-13 20:21:04,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:04,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:04,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:21:04,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:21:04,626 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 1 more)] === [2025-04-13 20:21:04,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:04,627 INFO L85 PathProgramCache]: Analyzing trace with hash 843255928, now seen corresponding path program 1 times [2025-04-13 20:21:04,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:04,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131528356] [2025-04-13 20:21:04,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:04,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:04,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:21:04,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:21:04,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:04,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:04,677 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:04,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:04,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131528356] [2025-04-13 20:21:04,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131528356] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:04,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:04,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:21:04,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468357982] [2025-04-13 20:21:04,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:04,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:04,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:04,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:04,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:04,679 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:04,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 46 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:04,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:04,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:04,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:05,120 INFO L116 PetriNetUnfolderBase]: 7272/9401 cut-off events. [2025-04-13 20:21:05,120 INFO L117 PetriNetUnfolderBase]: For 2443/2443 co-relation queries the response was YES. [2025-04-13 20:21:05,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22023 conditions, 9401 events. 7272/9401 cut-off events. For 2443/2443 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 39835 event pairs, 2962 based on Foata normal form. 0/5232 useless extension candidates. Maximal degree in co-relation 10195. Up to 6222 conditions per place. [2025-04-13 20:21:05,153 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 67 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2025-04-13 20:21:05,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 73 transitions, 384 flow [2025-04-13 20:21:05,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-04-13 20:21:05,156 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5658914728682171 [2025-04-13 20:21:05,156 INFO L175 Difference]: Start difference. First operand has 36 places, 46 transitions, 148 flow. Second operand 3 states and 73 transitions. [2025-04-13 20:21:05,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 73 transitions, 384 flow [2025-04-13 20:21:05,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 73 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:05,158 INFO L231 Difference]: Finished difference. Result has 39 places, 47 transitions, 178 flow [2025-04-13 20:21:05,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=39, PETRI_TRANSITIONS=47} [2025-04-13 20:21:05,160 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2025-04-13 20:21:05,161 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 47 transitions, 178 flow [2025-04-13 20:21:05,161 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:05,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:05,161 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] [2025-04-13 20:21:05,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:21:05,161 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 1 more)] === [2025-04-13 20:21:05,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1536165568, now seen corresponding path program 1 times [2025-04-13 20:21:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:05,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035418478] [2025-04-13 20:21:05,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:05,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:21:05,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:21:05,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:05,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:05,233 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:05,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:05,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035418478] [2025-04-13 20:21:05,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035418478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:05,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:21:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324026870] [2025-04-13 20:21:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:05,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:05,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:05,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:05,234 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:05,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 47 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:05,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:05,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:05,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:05,657 INFO L116 PetriNetUnfolderBase]: 5244/6921 cut-off events. [2025-04-13 20:21:05,657 INFO L117 PetriNetUnfolderBase]: For 4058/4058 co-relation queries the response was YES. [2025-04-13 20:21:05,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18175 conditions, 6921 events. 5244/6921 cut-off events. For 4058/4058 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 28900 event pairs, 2270 based on Foata normal form. 0/4661 useless extension candidates. Maximal degree in co-relation 6680. Up to 4926 conditions per place. [2025-04-13 20:21:05,684 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 68 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2025-04-13 20:21:05,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 74 transitions, 424 flow [2025-04-13 20:21:05,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-04-13 20:21:05,685 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-04-13 20:21:05,685 INFO L175 Difference]: Start difference. First operand has 39 places, 47 transitions, 178 flow. Second operand 3 states and 75 transitions. [2025-04-13 20:21:05,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 74 transitions, 424 flow [2025-04-13 20:21:05,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 74 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:21:05,694 INFO L231 Difference]: Finished difference. Result has 41 places, 48 transitions, 198 flow [2025-04-13 20:21:05,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=41, PETRI_TRANSITIONS=48} [2025-04-13 20:21:05,697 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2025-04-13 20:21:05,697 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 48 transitions, 198 flow [2025-04-13 20:21:05,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:05,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:05,697 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] [2025-04-13 20:21:05,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:21:05,698 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 1 more)] === [2025-04-13 20:21:05,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:05,698 INFO L85 PathProgramCache]: Analyzing trace with hash 585472668, now seen corresponding path program 1 times [2025-04-13 20:21:05,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:05,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820024910] [2025-04-13 20:21:05,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:05,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:21:05,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:21:05,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:05,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:05,845 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:05,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:05,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820024910] [2025-04-13 20:21:05,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820024910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:05,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:05,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:21:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034037832] [2025-04-13 20:21:05,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:05,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:21:05,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:05,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:21:05,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:21:05,846 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:05,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 48 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:05,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:05,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:05,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:06,205 INFO L116 PetriNetUnfolderBase]: 6515/8743 cut-off events. [2025-04-13 20:21:06,205 INFO L117 PetriNetUnfolderBase]: For 5491/5491 co-relation queries the response was YES. [2025-04-13 20:21:06,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23801 conditions, 8743 events. 6515/8743 cut-off events. For 5491/5491 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 38858 event pairs, 4082 based on Foata normal form. 184/6649 useless extension candidates. Maximal degree in co-relation 12875. Up to 6922 conditions per place. [2025-04-13 20:21:06,234 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 75 selfloop transitions, 3 changer transitions 4/82 dead transitions. [2025-04-13 20:21:06,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 82 transitions, 470 flow [2025-04-13 20:21:06,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:21:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:21:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-04-13 20:21:06,236 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2025-04-13 20:21:06,236 INFO L175 Difference]: Start difference. First operand has 41 places, 48 transitions, 198 flow. Second operand 4 states and 84 transitions. [2025-04-13 20:21:06,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 82 transitions, 470 flow [2025-04-13 20:21:06,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 82 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:21:06,245 INFO L231 Difference]: Finished difference. Result has 44 places, 50 transitions, 208 flow [2025-04-13 20:21:06,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=44, PETRI_TRANSITIONS=50} [2025-04-13 20:21:06,247 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2025-04-13 20:21:06,247 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 50 transitions, 208 flow [2025-04-13 20:21:06,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:06,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:06,247 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] [2025-04-13 20:21:06,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:21:06,247 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 1 more)] === [2025-04-13 20:21:06,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:06,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1071638438, now seen corresponding path program 1 times [2025-04-13 20:21:06,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:06,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740634883] [2025-04-13 20:21:06,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:06,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:06,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:21:06,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:21:06,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:06,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:06,308 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:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:06,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740634883] [2025-04-13 20:21:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740634883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:06,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:06,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:21:06,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462505086] [2025-04-13 20:21:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:06,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:06,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:06,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:06,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:06,309 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:06,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 50 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:06,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:06,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:06,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:06,531 INFO L116 PetriNetUnfolderBase]: 3971/5282 cut-off events. [2025-04-13 20:21:06,531 INFO L117 PetriNetUnfolderBase]: For 2826/2826 co-relation queries the response was YES. [2025-04-13 20:21:06,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13982 conditions, 5282 events. 3971/5282 cut-off events. For 2826/2826 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 20280 event pairs, 1258 based on Foata normal form. 0/3773 useless extension candidates. Maximal degree in co-relation 13404. Up to 2719 conditions per place. [2025-04-13 20:21:06,547 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 63 selfloop transitions, 5 changer transitions 1/69 dead transitions. [2025-04-13 20:21:06,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 407 flow [2025-04-13 20:21:06,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-13 20:21:06,548 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5503875968992248 [2025-04-13 20:21:06,548 INFO L175 Difference]: Start difference. First operand has 44 places, 50 transitions, 208 flow. Second operand 3 states and 71 transitions. [2025-04-13 20:21:06,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 407 flow [2025-04-13 20:21:06,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 403 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:06,551 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 206 flow [2025-04-13 20:21:06,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-04-13 20:21:06,552 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2025-04-13 20:21:06,552 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 206 flow [2025-04-13 20:21:06,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:06,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:06,552 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:06,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:21:06,552 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 1 more)] === [2025-04-13 20:21:06,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:06,552 INFO L85 PathProgramCache]: Analyzing trace with hash -660423485, now seen corresponding path program 1 times [2025-04-13 20:21:06,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:06,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812964363] [2025-04-13 20:21:06,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:06,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:21:06,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:21:06,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:06,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:21:07,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:07,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812964363] [2025-04-13 20:21:07,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812964363] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:21:07,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58222551] [2025-04-13 20:21:07,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:07,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:07,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:21:07,086 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:07,087 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:07,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:21:07,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:21:07,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:07,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:07,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:21:07,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:21:07,225 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 23 treesize of output 1 [2025-04-13 20:21:07,357 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:07,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:21:07,675 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:07,687 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:21:07,687 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:07,730 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:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58222551] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:21:07,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:21:07,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-04-13 20:21:07,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337160799] [2025-04-13 20:21:07,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:21:07,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:21:07,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:07,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:21:07,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:21:07,732 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:07,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 206 flow. Second operand has 17 states, 17 states have (on average 6.882352941176471) internal successors, (117), 17 states have internal predecessors, (117), 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:07,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:07,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:07,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:09,618 INFO L116 PetriNetUnfolderBase]: 20169/26547 cut-off events. [2025-04-13 20:21:09,618 INFO L117 PetriNetUnfolderBase]: For 19714/19714 co-relation queries the response was YES. [2025-04-13 20:21:09,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77127 conditions, 26547 events. 20169/26547 cut-off events. For 19714/19714 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 127942 event pairs, 1556 based on Foata normal form. 28/20905 useless extension candidates. Maximal degree in co-relation 50728. Up to 4839 conditions per place. [2025-04-13 20:21:09,718 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 251 selfloop transitions, 51 changer transitions 10/312 dead transitions. [2025-04-13 20:21:09,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 312 transitions, 1839 flow [2025-04-13 20:21:09,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:21:09,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:21:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 337 transitions. [2025-04-13 20:21:09,720 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46101231190150477 [2025-04-13 20:21:09,720 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 206 flow. Second operand 17 states and 337 transitions. [2025-04-13 20:21:09,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 312 transitions, 1839 flow [2025-04-13 20:21:09,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 312 transitions, 1785 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 20:21:09,739 INFO L231 Difference]: Finished difference. Result has 68 places, 98 transitions, 675 flow [2025-04-13 20:21:09,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=675, PETRI_PLACES=68, PETRI_TRANSITIONS=98} [2025-04-13 20:21:09,740 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 33 predicate places. [2025-04-13 20:21:09,740 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 98 transitions, 675 flow [2025-04-13 20:21:09,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.882352941176471) internal successors, (117), 17 states have internal predecessors, (117), 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:09,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:09,740 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:09,749 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:09,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:09,945 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 1 more)] === [2025-04-13 20:21:09,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1458739141, now seen corresponding path program 1 times [2025-04-13 20:21:09,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:09,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814310840] [2025-04-13 20:21:09,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:09,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:21:09,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:21:09,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:09,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:09,994 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:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:09,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814310840] [2025-04-13 20:21:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814310840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:09,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:09,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:21:09,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537400357] [2025-04-13 20:21:09,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:09,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:09,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:09,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:09,995 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:09,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 98 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:09,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:09,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:09,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:11,833 INFO L116 PetriNetUnfolderBase]: 27309/35795 cut-off events. [2025-04-13 20:21:11,833 INFO L117 PetriNetUnfolderBase]: For 63661/63661 co-relation queries the response was YES. [2025-04-13 20:21:11,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114720 conditions, 35795 events. 27309/35795 cut-off events. For 63661/63661 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 177658 event pairs, 8300 based on Foata normal form. 746/27314 useless extension candidates. Maximal degree in co-relation 82998. Up to 22307 conditions per place. [2025-04-13 20:21:12,045 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 138 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2025-04-13 20:21:12,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 140 transitions, 1228 flow [2025-04-13 20:21:12,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-04-13 20:21:12,046 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-04-13 20:21:12,046 INFO L175 Difference]: Start difference. First operand has 68 places, 98 transitions, 675 flow. Second operand 3 states and 75 transitions. [2025-04-13 20:21:12,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 140 transitions, 1228 flow [2025-04-13 20:21:12,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 140 transitions, 1170 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:12,115 INFO L231 Difference]: Finished difference. Result has 69 places, 95 transitions, 622 flow [2025-04-13 20:21:12,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=69, PETRI_TRANSITIONS=95} [2025-04-13 20:21:12,116 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2025-04-13 20:21:12,116 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 95 transitions, 622 flow [2025-04-13 20:21:12,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:12,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:12,116 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:12,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:21:12,116 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 1 more)] === [2025-04-13 20:21:12,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:12,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1551936557, now seen corresponding path program 1 times [2025-04-13 20:21:12,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:12,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260360409] [2025-04-13 20:21:12,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:12,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:21:12,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:21:12,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:12,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:21:12,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:12,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260360409] [2025-04-13 20:21:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260360409] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:12,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:12,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:21:12,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362239328] [2025-04-13 20:21:12,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:12,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:12,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:12,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:12,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:12,155 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:12,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 95 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:12,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:12,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:12,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:14,130 INFO L116 PetriNetUnfolderBase]: 24767/32488 cut-off events. [2025-04-13 20:21:14,131 INFO L117 PetriNetUnfolderBase]: For 53403/53403 co-relation queries the response was YES. [2025-04-13 20:21:14,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104561 conditions, 32488 events. 24767/32488 cut-off events. For 53403/53403 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 159704 event pairs, 10197 based on Foata normal form. 0/24533 useless extension candidates. Maximal degree in co-relation 75799. Up to 22280 conditions per place. [2025-04-13 20:21:14,264 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 113 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2025-04-13 20:21:14,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 125 transitions, 1066 flow [2025-04-13 20:21:14,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:21:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:21:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-13 20:21:14,265 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5503875968992248 [2025-04-13 20:21:14,266 INFO L175 Difference]: Start difference. First operand has 69 places, 95 transitions, 622 flow. Second operand 3 states and 71 transitions. [2025-04-13 20:21:14,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 125 transitions, 1066 flow [2025-04-13 20:21:14,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 125 transitions, 1064 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:21:14,317 INFO L231 Difference]: Finished difference. Result has 72 places, 96 transitions, 682 flow [2025-04-13 20:21:14,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=72, PETRI_TRANSITIONS=96} [2025-04-13 20:21:14,317 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-04-13 20:21:14,317 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 96 transitions, 682 flow [2025-04-13 20:21:14,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:14,317 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:21:14,318 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 1 more)] === [2025-04-13 20:21:14,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:14,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1912261896, now seen corresponding path program 1 times [2025-04-13 20:21:14,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:14,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087769345] [2025-04-13 20:21:14,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:14,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:14,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:21:14,355 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,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:14,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:21:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:14,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087769345] [2025-04-13 20:21:14,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087769345] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:21:14,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340283546] [2025-04-13 20:21:14,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:14,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:14,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:21:14,948 INFO L229 MonitoredProcess]: Starting monitored process 3 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:14,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:21:15,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:21:15,022 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,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:15,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:15,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 20:21:15,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:21:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:21:15,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:21:15,117 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:21:15,118 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2025-04-13 20:21:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:21:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340283546] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:21:15,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:21:15,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 11 [2025-04-13 20:21:15,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900590565] [2025-04-13 20:21:15,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:21:15,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:21:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:15,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:21:15,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:21:15,141 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:15,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 96 transitions, 682 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:15,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:15,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:15,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:17,417 INFO L116 PetriNetUnfolderBase]: 27795/36540 cut-off events. [2025-04-13 20:21:17,417 INFO L117 PetriNetUnfolderBase]: For 73985/73985 co-relation queries the response was YES. [2025-04-13 20:21:17,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126344 conditions, 36540 events. 27795/36540 cut-off events. For 73985/73985 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 179858 event pairs, 4887 based on Foata normal form. 3/29756 useless extension candidates. Maximal degree in co-relation 88817. Up to 28935 conditions per place. [2025-04-13 20:21:17,673 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 130 selfloop transitions, 51 changer transitions 19/200 dead transitions. [2025-04-13 20:21:17,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 200 transitions, 1616 flow [2025-04-13 20:21:17,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:21:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:21:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 175 transitions. [2025-04-13 20:21:17,675 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3391472868217054 [2025-04-13 20:21:17,675 INFO L175 Difference]: Start difference. First operand has 72 places, 96 transitions, 682 flow. Second operand 12 states and 175 transitions. [2025-04-13 20:21:17,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 200 transitions, 1616 flow [2025-04-13 20:21:17,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 200 transitions, 1574 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:21:17,790 INFO L231 Difference]: Finished difference. Result has 86 places, 119 transitions, 1079 flow [2025-04-13 20:21:17,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1079, PETRI_PLACES=86, PETRI_TRANSITIONS=119} [2025-04-13 20:21:17,791 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2025-04-13 20:21:17,791 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 119 transitions, 1079 flow [2025-04-13 20:21:17,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:17,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:17,791 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:17,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:21:17,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 20:21:17,992 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:21:17,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2135199257, now seen corresponding path program 1 times [2025-04-13 20:21:17,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:17,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853501605] [2025-04-13 20:21:17,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:17,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:18,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:21:18,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:21:18,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:18,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:21:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:18,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853501605] [2025-04-13 20:21:18,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853501605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:18,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:21:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454015531] [2025-04-13 20:21:18,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:18,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:21:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:18,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:21:18,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:21:18,095 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:18,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 119 transitions, 1079 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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:18,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:18,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:18,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:20,818 INFO L116 PetriNetUnfolderBase]: 28696/38001 cut-off events. [2025-04-13 20:21:20,818 INFO L117 PetriNetUnfolderBase]: For 82368/82368 co-relation queries the response was YES. [2025-04-13 20:21:20,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130872 conditions, 38001 events. 28696/38001 cut-off events. For 82368/82368 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 192772 event pairs, 16834 based on Foata normal form. 96/30559 useless extension candidates. Maximal degree in co-relation 125428. Up to 34011 conditions per place. [2025-04-13 20:21:21,098 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 96 selfloop transitions, 12 changer transitions 35/143 dead transitions. [2025-04-13 20:21:21,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 143 transitions, 1473 flow [2025-04-13 20:21:21,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:21:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:21:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-13 20:21:21,099 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2025-04-13 20:21:21,099 INFO L175 Difference]: Start difference. First operand has 86 places, 119 transitions, 1079 flow. Second operand 4 states and 75 transitions. [2025-04-13 20:21:21,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 143 transitions, 1473 flow [2025-04-13 20:21:21,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 143 transitions, 1402 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-04-13 20:21:21,204 INFO L231 Difference]: Finished difference. Result has 84 places, 108 transitions, 909 flow [2025-04-13 20:21:21,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=909, PETRI_PLACES=84, PETRI_TRANSITIONS=108} [2025-04-13 20:21:21,205 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2025-04-13 20:21:21,205 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 108 transitions, 909 flow [2025-04-13 20:21:21,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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:21,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:21,205 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:21,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:21:21,205 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:21:21,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1108911223, now seen corresponding path program 1 times [2025-04-13 20:21:21,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:21,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707322753] [2025-04-13 20:21:21,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:21,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:21,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:21:21,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:21:21,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:21,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:21:21,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:21,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707322753] [2025-04-13 20:21:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707322753] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:21:21,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374709218] [2025-04-13 20:21:21,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:21,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:21,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:21:21,538 INFO L229 MonitoredProcess]: Starting monitored process 4 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:21,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:21:21,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:21:21,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:21:21,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:21,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:21,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:21:21,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:21:21,650 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 23 treesize of output 1 [2025-04-13 20:21:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:21:21,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:21:21,986 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:21,995 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:21:21,995 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:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:21:22,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374709218] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:21:22,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:21:22,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-13 20:21:22,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695455532] [2025-04-13 20:21:22,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:21:22,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:21:22,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:22,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:21:22,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:21:22,031 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:22,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 108 transitions, 909 flow. Second operand has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 states have internal predecessors, (126), 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,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:22,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:22,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:32,661 INFO L116 PetriNetUnfolderBase]: 124518/162947 cut-off events. [2025-04-13 20:21:32,661 INFO L117 PetriNetUnfolderBase]: For 389819/389819 co-relation queries the response was YES. [2025-04-13 20:21:33,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573417 conditions, 162947 events. 124518/162947 cut-off events. For 389819/389819 co-relation queries the response was YES. Maximal size of possible extension queue 4262. Compared 957701 event pairs, 13421 based on Foata normal form. 105/129532 useless extension candidates. Maximal degree in co-relation 573348. Up to 33987 conditions per place. [2025-04-13 20:21:33,777 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 438 selfloop transitions, 84 changer transitions 27/549 dead transitions. [2025-04-13 20:21:33,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 549 transitions, 4977 flow [2025-04-13 20:21:33,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:21:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:21:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 394 transitions. [2025-04-13 20:21:33,779 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45813953488372094 [2025-04-13 20:21:33,779 INFO L175 Difference]: Start difference. First operand has 84 places, 108 transitions, 909 flow. Second operand 20 states and 394 transitions. [2025-04-13 20:21:33,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 549 transitions, 4977 flow [2025-04-13 20:21:34,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 549 transitions, 4912 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-04-13 20:21:34,299 INFO L231 Difference]: Finished difference. Result has 104 places, 171 transitions, 1926 flow [2025-04-13 20:21:34,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1926, PETRI_PLACES=104, PETRI_TRANSITIONS=171} [2025-04-13 20:21:34,299 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2025-04-13 20:21:34,300 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 171 transitions, 1926 flow [2025-04-13 20:21:34,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 states have internal predecessors, (126), 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,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:34,300 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:34,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:21:34,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:34,502 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:21:34,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:34,502 INFO L85 PathProgramCache]: Analyzing trace with hash -291941019, now seen corresponding path program 1 times [2025-04-13 20:21:34,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:34,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694045506] [2025-04-13 20:21:34,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:34,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:34,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:21:34,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:21:34,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:34,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:21:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:34,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694045506] [2025-04-13 20:21:34,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694045506] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:21:34,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352338428] [2025-04-13 20:21:34,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:34,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:34,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:21:34,598 INFO L229 MonitoredProcess]: Starting monitored process 5 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:34,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:21:34,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:21:34,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:21:34,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:34,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:34,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:21:34,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:21:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:21:34,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:21:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:21:34,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352338428] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:21:34,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:21:34,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 10 [2025-04-13 20:21:34,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206278657] [2025-04-13 20:21:34,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:21:34,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:21:34,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:34,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:21:34,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:21:34,806 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:34,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 171 transitions, 1926 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:34,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:34,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:21:46,635 INFO L116 PetriNetUnfolderBase]: 132286/174861 cut-off events. [2025-04-13 20:21:46,635 INFO L117 PetriNetUnfolderBase]: For 714956/714956 co-relation queries the response was YES. [2025-04-13 20:21:47,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645484 conditions, 174861 events. 132286/174861 cut-off events. For 714956/714956 co-relation queries the response was YES. Maximal size of possible extension queue 3865. Compared 1062721 event pairs, 34265 based on Foata normal form. 4224/142673 useless extension candidates. Maximal degree in co-relation 645417. Up to 49373 conditions per place. [2025-04-13 20:21:48,097 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 336 selfloop transitions, 41 changer transitions 19/396 dead transitions. [2025-04-13 20:21:48,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 396 transitions, 4617 flow [2025-04-13 20:21:48,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:21:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:21:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 234 transitions. [2025-04-13 20:21:48,098 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49471458773784355 [2025-04-13 20:21:48,098 INFO L175 Difference]: Start difference. First operand has 104 places, 171 transitions, 1926 flow. Second operand 11 states and 234 transitions. [2025-04-13 20:21:48,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 396 transitions, 4617 flow [2025-04-13 20:21:49,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 396 transitions, 4193 flow, removed 192 selfloop flow, removed 4 redundant places. [2025-04-13 20:21:49,496 INFO L231 Difference]: Finished difference. Result has 114 places, 164 transitions, 1900 flow [2025-04-13 20:21:49,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1900, PETRI_PLACES=114, PETRI_TRANSITIONS=164} [2025-04-13 20:21:49,497 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 79 predicate places. [2025-04-13 20:21:49,497 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 164 transitions, 1900 flow [2025-04-13 20:21:49,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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:49,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:49,497 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, 1, 1] [2025-04-13 20:21:49,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:21:49,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:49,698 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:21:49,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash -860465663, now seen corresponding path program 1 times [2025-04-13 20:21:49,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:49,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146200664] [2025-04-13 20:21:49,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:21:49,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:49,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 20:21:49,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 20:21:49,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:21:49,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:21:49,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:49,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146200664] [2025-04-13 20:21:49,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146200664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:21:49,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:21:49,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:21:49,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130080187] [2025-04-13 20:21:49,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:21:49,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:21:49,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:49,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:21:49,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:21:49,732 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:21:49,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 164 transitions, 1900 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:49,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:49,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:21:49,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:00,010 INFO L116 PetriNetUnfolderBase]: 113080/150851 cut-off events. [2025-04-13 20:22:00,011 INFO L117 PetriNetUnfolderBase]: For 586382/586382 co-relation queries the response was YES. [2025-04-13 20:22:00,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567232 conditions, 150851 events. 113080/150851 cut-off events. For 586382/586382 co-relation queries the response was YES. Maximal size of possible extension queue 2242. Compared 886681 event pairs, 49321 based on Foata normal form. 2964/124211 useless extension candidates. Maximal degree in co-relation 567157. Up to 105820 conditions per place. [2025-04-13 20:22:01,412 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 169 selfloop transitions, 18 changer transitions 5/192 dead transitions. [2025-04-13 20:22:01,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 192 transitions, 2512 flow [2025-04-13 20:22:01,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:22:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:22:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-13 20:22:01,413 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5503875968992248 [2025-04-13 20:22:01,413 INFO L175 Difference]: Start difference. First operand has 114 places, 164 transitions, 1900 flow. Second operand 3 states and 71 transitions. [2025-04-13 20:22:01,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 192 transitions, 2512 flow [2025-04-13 20:22:02,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 192 transitions, 2424 flow, removed 38 selfloop flow, removed 4 redundant places. [2025-04-13 20:22:02,337 INFO L231 Difference]: Finished difference. Result has 114 places, 153 transitions, 1735 flow [2025-04-13 20:22:02,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1735, PETRI_PLACES=114, PETRI_TRANSITIONS=153} [2025-04-13 20:22:02,337 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 79 predicate places. [2025-04-13 20:22:02,337 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 153 transitions, 1735 flow [2025-04-13 20:22:02,338 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:22:02,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:02,338 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 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:22:02,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:22:02,338 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:22:02,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash -903518325, now seen corresponding path program 2 times [2025-04-13 20:22:02,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:02,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703279847] [2025-04-13 20:22:02,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:22:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:02,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 20:22:02,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 20:22:02,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:22:02,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 20:22:02,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:02,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703279847] [2025-04-13 20:22:02,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703279847] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:22:02,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71894465] [2025-04-13 20:22:02,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:22:02,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:22:02,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:22:02,487 INFO L229 MonitoredProcess]: Starting monitored process 6 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:22:02,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:22:02,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 20:22:02,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 20:22:02,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:22:02,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:02,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:22:02,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:22:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:22:02,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:22:02,692 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:22:02,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2025-04-13 20:22:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 20:22:02,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71894465] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:22:02,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:22:02,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 4] total 9 [2025-04-13 20:22:02,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148679053] [2025-04-13 20:22:02,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:22:02,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:22:02,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:02,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:22:02,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:22:02,726 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:22:02,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 153 transitions, 1735 flow. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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:22:02,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:02,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:22:02,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:16,318 INFO L116 PetriNetUnfolderBase]: 150911/200371 cut-off events. [2025-04-13 20:22:16,318 INFO L117 PetriNetUnfolderBase]: For 790176/790176 co-relation queries the response was YES. [2025-04-13 20:22:17,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769659 conditions, 200371 events. 150911/200371 cut-off events. For 790176/790176 co-relation queries the response was YES. Maximal size of possible extension queue 3104. Compared 1199166 event pairs, 15803 based on Foata normal form. 59/163246 useless extension candidates. Maximal degree in co-relation 769585. Up to 92080 conditions per place. [2025-04-13 20:22:17,985 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 174 selfloop transitions, 97 changer transitions 9/280 dead transitions. [2025-04-13 20:22:17,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 280 transitions, 3354 flow [2025-04-13 20:22:17,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:22:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:22:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2025-04-13 20:22:17,987 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2025-04-13 20:22:17,987 INFO L175 Difference]: Start difference. First operand has 114 places, 153 transitions, 1735 flow. Second operand 9 states and 162 transitions. [2025-04-13 20:22:17,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 280 transitions, 3354 flow [2025-04-13 20:22:20,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 280 transitions, 3264 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-04-13 20:22:20,179 INFO L231 Difference]: Finished difference. Result has 122 places, 178 transitions, 2310 flow [2025-04-13 20:22:20,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2310, PETRI_PLACES=122, PETRI_TRANSITIONS=178} [2025-04-13 20:22:20,180 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 87 predicate places. [2025-04-13 20:22:20,180 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 178 transitions, 2310 flow [2025-04-13 20:22:20,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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:22:20,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:20,180 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:22:20,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:22:20,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 20:22:20,380 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:22:20,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash 737341487, now seen corresponding path program 3 times [2025-04-13 20:22:20,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:20,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839389205] [2025-04-13 20:22:20,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:22:20,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:20,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-04-13 20:22:20,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 20:22:20,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:22:20,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:22:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:20,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839389205] [2025-04-13 20:22:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839389205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:20,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:20,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:22:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324969551] [2025-04-13 20:22:20,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:20,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:22:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:20,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:22:20,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:22:20,452 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:22:20,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 178 transitions, 2310 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:22:20,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:20,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:22:20,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:34,245 INFO L116 PetriNetUnfolderBase]: 134507/182409 cut-off events. [2025-04-13 20:22:34,245 INFO L117 PetriNetUnfolderBase]: For 830883/830883 co-relation queries the response was YES. [2025-04-13 20:22:35,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711660 conditions, 182409 events. 134507/182409 cut-off events. For 830883/830883 co-relation queries the response was YES. Maximal size of possible extension queue 3044. Compared 1161620 event pairs, 58041 based on Foata normal form. 0/155325 useless extension candidates. Maximal degree in co-relation 711579. Up to 106853 conditions per place. [2025-04-13 20:22:35,713 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 211 selfloop transitions, 24 changer transitions 0/235 dead transitions. [2025-04-13 20:22:35,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 235 transitions, 3537 flow [2025-04-13 20:22:35,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:22:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:22:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-13 20:22:35,714 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5503875968992248 [2025-04-13 20:22:35,714 INFO L175 Difference]: Start difference. First operand has 122 places, 178 transitions, 2310 flow. Second operand 3 states and 71 transitions. [2025-04-13 20:22:35,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 235 transitions, 3537 flow [2025-04-13 20:22:38,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 235 transitions, 3402 flow, removed 53 selfloop flow, removed 2 redundant places. [2025-04-13 20:22:38,337 INFO L231 Difference]: Finished difference. Result has 122 places, 176 transitions, 2249 flow [2025-04-13 20:22:38,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2249, PETRI_PLACES=122, PETRI_TRANSITIONS=176} [2025-04-13 20:22:38,338 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 87 predicate places. [2025-04-13 20:22:38,338 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 176 transitions, 2249 flow [2025-04-13 20:22:38,338 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:22:38,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:38,338 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:22:38,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:22:38,338 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:22:38,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1312305512, now seen corresponding path program 2 times [2025-04-13 20:22:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:38,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853023618] [2025-04-13 20:22:38,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:22:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:38,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 20:22:38,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 20:22:38,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:22:38,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:22:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:38,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853023618] [2025-04-13 20:22:38,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853023618] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:38,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:38,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:22:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899352635] [2025-04-13 20:22:38,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:38,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:22:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:38,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:22:38,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:22:38,390 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:22:38,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 176 transitions, 2249 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:22:38,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:38,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:22:38,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:43,781 INFO L116 PetriNetUnfolderBase]: 48785/69754 cut-off events. [2025-04-13 20:22:43,782 INFO L117 PetriNetUnfolderBase]: For 357474/357474 co-relation queries the response was YES. [2025-04-13 20:22:44,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274266 conditions, 69754 events. 48785/69754 cut-off events. For 357474/357474 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 426229 event pairs, 12915 based on Foata normal form. 1312/67448 useless extension candidates. Maximal degree in co-relation 274187. Up to 35267 conditions per place. [2025-04-13 20:22:44,459 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 176 selfloop transitions, 39 changer transitions 0/215 dead transitions. [2025-04-13 20:22:44,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 215 transitions, 2798 flow [2025-04-13 20:22:44,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:22:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:22:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-13 20:22:44,460 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5069767441860465 [2025-04-13 20:22:44,460 INFO L175 Difference]: Start difference. First operand has 122 places, 176 transitions, 2249 flow. Second operand 5 states and 109 transitions. [2025-04-13 20:22:44,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 215 transitions, 2798 flow [2025-04-13 20:22:44,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 215 transitions, 2652 flow, removed 22 selfloop flow, removed 6 redundant places. [2025-04-13 20:22:44,874 INFO L231 Difference]: Finished difference. Result has 120 places, 145 transitions, 1740 flow [2025-04-13 20:22:44,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1740, PETRI_PLACES=120, PETRI_TRANSITIONS=145} [2025-04-13 20:22:44,874 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 85 predicate places. [2025-04-13 20:22:44,874 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 145 transitions, 1740 flow [2025-04-13 20:22:44,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:22:44,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:44,875 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1] [2025-04-13 20:22:44,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:22:44,875 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:22:44,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2133520732, now seen corresponding path program 1 times [2025-04-13 20:22:44,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:44,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818455705] [2025-04-13 20:22:44,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:44,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:44,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:22:44,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:22:44,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:44,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:22:45,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:45,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818455705] [2025-04-13 20:22:45,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818455705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:22:45,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878944974] [2025-04-13 20:22:45,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:45,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:22:45,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:22:45,333 INFO L229 MonitoredProcess]: Starting monitored process 7 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:22:45,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:22:45,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:22:45,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:22:45,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:45,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:45,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 20:22:45,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:22:45,640 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:22:45,640 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 20 [2025-04-13 20:22:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:22:45,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:22:45,703 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:22:45,703 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2025-04-13 20:22:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:22:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878944974] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:22:45,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:22:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-04-13 20:22:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580586811] [2025-04-13 20:22:45,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:22:45,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:22:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:45,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:22:45,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:22:45,941 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:22:45,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 145 transitions, 1740 flow. Second operand has 26 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 26 states have internal predecessors, (174), 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:22:45,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:45,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:22:45,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:03,105 INFO L116 PetriNetUnfolderBase]: 142040/201434 cut-off events. [2025-04-13 20:23:03,105 INFO L117 PetriNetUnfolderBase]: For 1306341/1306341 co-relation queries the response was YES. [2025-04-13 20:23:04,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836971 conditions, 201434 events. 142040/201434 cut-off events. For 1306341/1306341 co-relation queries the response was YES. Maximal size of possible extension queue 3168. Compared 1397757 event pairs, 18061 based on Foata normal form. 3281/196687 useless extension candidates. Maximal degree in co-relation 836891. Up to 29490 conditions per place. [2025-04-13 20:23:04,899 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 565 selfloop transitions, 140 changer transitions 19/724 dead transitions. [2025-04-13 20:23:04,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 724 transitions, 8930 flow [2025-04-13 20:23:04,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 20:23:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-13 20:23:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 497 transitions. [2025-04-13 20:23:04,901 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5025278058645096 [2025-04-13 20:23:04,901 INFO L175 Difference]: Start difference. First operand has 120 places, 145 transitions, 1740 flow. Second operand 23 states and 497 transitions. [2025-04-13 20:23:04,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 724 transitions, 8930 flow [2025-04-13 20:23:08,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 724 transitions, 8724 flow, removed 101 selfloop flow, removed 1 redundant places. [2025-04-13 20:23:08,121 INFO L231 Difference]: Finished difference. Result has 151 places, 246 transitions, 4162 flow [2025-04-13 20:23:08,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4162, PETRI_PLACES=151, PETRI_TRANSITIONS=246} [2025-04-13 20:23:08,121 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 116 predicate places. [2025-04-13 20:23:08,121 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 246 transitions, 4162 flow [2025-04-13 20:23:08,121 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 26 states have internal predecessors, (174), 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:23:08,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:08,121 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:23:08,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:23:08,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:08,322 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:08,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1849239629, now seen corresponding path program 1 times [2025-04-13 20:23:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:08,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803536271] [2025-04-13 20:23:08,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:08,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:08,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:23:08,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:23:08,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:08,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:23:08,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:08,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803536271] [2025-04-13 20:23:08,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803536271] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:08,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596200506] [2025-04-13 20:23:08,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:08,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:08,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:08,418 INFO L229 MonitoredProcess]: Starting monitored process 8 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:23:08,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:23:08,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:23:08,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:23:08,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:08,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:08,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:23:08,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:23:08,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:23:08,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596200506] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:08,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:08,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:23:08,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025731613] [2025-04-13 20:23:08,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:08,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:23:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:08,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:23:08,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:23:08,627 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:23:08,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 246 transitions, 4162 flow. Second operand has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 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:23:08,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:08,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:23:08,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:29,521 INFO L116 PetriNetUnfolderBase]: 141671/200863 cut-off events. [2025-04-13 20:23:29,521 INFO L117 PetriNetUnfolderBase]: For 2142079/2142079 co-relation queries the response was YES. [2025-04-13 20:23:31,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923153 conditions, 200863 events. 141671/200863 cut-off events. For 2142079/2142079 co-relation queries the response was YES. Maximal size of possible extension queue 3143. Compared 1426097 event pairs, 103934 based on Foata normal form. 42/192877 useless extension candidates. Maximal degree in co-relation 923060. Up to 198364 conditions per place. [2025-04-13 20:23:31,690 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 223 selfloop transitions, 3 changer transitions 54/280 dead transitions. [2025-04-13 20:23:31,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 280 transitions, 4866 flow [2025-04-13 20:23:31,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:23:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:23:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2025-04-13 20:23:31,691 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3682170542635659 [2025-04-13 20:23:31,691 INFO L175 Difference]: Start difference. First operand has 151 places, 246 transitions, 4162 flow. Second operand 6 states and 95 transitions. [2025-04-13 20:23:31,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 280 transitions, 4866 flow [2025-04-13 20:23:40,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 280 transitions, 4257 flow, removed 286 selfloop flow, removed 6 redundant places. [2025-04-13 20:23:40,723 INFO L231 Difference]: Finished difference. Result has 149 places, 226 transitions, 3321 flow [2025-04-13 20:23:40,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3543, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3321, PETRI_PLACES=149, PETRI_TRANSITIONS=226} [2025-04-13 20:23:40,724 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 114 predicate places. [2025-04-13 20:23:40,724 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 226 transitions, 3321 flow [2025-04-13 20:23:40,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 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:23:40,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:40,724 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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:23:40,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:23:40,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:40,925 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:23:40,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:40,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1745836244, now seen corresponding path program 2 times [2025-04-13 20:23:40,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:40,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551106443] [2025-04-13 20:23:40,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:23:40,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:40,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 20:23:40,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:23:40,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:23:40,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 20:23:40,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:40,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551106443] [2025-04-13 20:23:40,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551106443] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:40,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202522405] [2025-04-13 20:23:40,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:23:40,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:40,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:40,989 INFO L229 MonitoredProcess]: Starting monitored process 9 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:23:40,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:23:41,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 20:23:41,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:23:41,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:23:41,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:41,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:23:41,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 20:23:41,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 20:23:41,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202522405] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:41,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:41,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2025-04-13 20:23:41,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387220919] [2025-04-13 20:23:41,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:41,189 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:23:41,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:41,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:23:41,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:23:41,189 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2025-04-13 20:23:41,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 226 transitions, 3321 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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:23:41,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:41,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2025-04-13 20:23:41,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:24:18,770 INFO L116 PetriNetUnfolderBase]: 251220/355035 cut-off events. [2025-04-13 20:24:18,770 INFO L117 PetriNetUnfolderBase]: For 3665593/3665593 co-relation queries the response was YES. [2025-04-13 20:24:21,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574708 conditions, 355035 events. 251220/355035 cut-off events. For 3665593/3665593 co-relation queries the response was YES. Maximal size of possible extension queue 5927. Compared 2619869 event pairs, 98256 based on Foata normal form. 4860/345459 useless extension candidates. Maximal degree in co-relation 1574644. Up to 156784 conditions per place. [2025-04-13 20:24:22,508 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 438 selfloop transitions, 31 changer transitions 0/469 dead transitions. [2025-04-13 20:24:22,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 469 transitions, 8108 flow [2025-04-13 20:24:22,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:24:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:24:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-04-13 20:24:22,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5755813953488372 [2025-04-13 20:24:22,509 INFO L175 Difference]: Start difference. First operand has 149 places, 226 transitions, 3321 flow. Second operand 4 states and 99 transitions. [2025-04-13 20:24:22,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 469 transitions, 8108 flow