/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:59:09,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:59:09,483 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-14 00:59:09,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:59:09,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:59:09,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:59:09,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:59:09,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:59:09,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:59:09,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:59:09,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:59:09,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:59:09,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:59:09,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:59:09,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:59:09,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:59:09,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:59:09,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:59:09,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:59:09,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:59:09,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:59:09,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:59:09,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:59:09,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:59:09,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:59:09,745 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:59:09,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-04-14 00:59:11,003 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/793985faa/a8445e5a1c6c4aa79d6c591451720f06/FLAGb06badc1d [2025-04-14 00:59:11,210 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:59:11,210 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-04-14 00:59:11,216 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/793985faa/a8445e5a1c6c4aa79d6c591451720f06/FLAGb06badc1d [2025-04-14 00:59:12,053 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/793985faa/a8445e5a1c6c4aa79d6c591451720f06 [2025-04-14 00:59:12,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:59:12,056 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:59:12,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:59:12,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:59:12,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:59:12,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a3406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12, skipping insertion in model container [2025-04-14 00:59:12,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:59:12,263 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-buffer-mult-alt.wvr.c[4345,4358] [2025-04-14 00:59:12,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:59:12,291 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:59:12,335 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-buffer-mult-alt.wvr.c[4345,4358] [2025-04-14 00:59:12,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:59:12,360 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:59:12,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12 WrapperNode [2025-04-14 00:59:12,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:59:12,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:59:12,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:59:12,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:59:12,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,407 INFO L138 Inliner]: procedures = 25, calls = 59, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 293 [2025-04-14 00:59:12,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:59:12,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:59:12,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:59:12,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:59:12,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,437 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-14 00:59:12,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:59:12,452 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:59:12,452 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:59:12,452 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:59:12,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (1/1) ... [2025-04-14 00:59:12,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:59:12,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:59:12,482 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-14 00:59:12,484 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-14 00:59:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:59:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:59:12,500 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:59:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:59:12,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:59:12,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 00:59:12,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:59:12,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:59:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:59:12,502 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:59:12,597 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:59:12,598 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:59:12,956 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:59:12,957 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:59:12,957 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:59:13,307 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:59:13,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:59:13 BoogieIcfgContainer [2025-04-14 00:59:13,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:59:13,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:59:13,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:59:13,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:59:13,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:59:12" (1/3) ... [2025-04-14 00:59:13,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11102392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:59:13, skipping insertion in model container [2025-04-14 00:59:13,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:12" (2/3) ... [2025-04-14 00:59:13,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11102392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:59:13, skipping insertion in model container [2025-04-14 00:59:13,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:59:13" (3/3) ... [2025-04-14 00:59:13,315 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-04-14 00:59:13,326 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:59:13,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt.wvr.c that has 5 procedures, 44 locations, 45 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 00:59:13,327 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:59:13,400 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 00:59:13,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 126 flow [2025-04-14 00:59:13,458 INFO L116 PetriNetUnfolderBase]: 6/45 cut-off events. [2025-04-14 00:59:13,459 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:59:13,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 45 events. 6/45 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-14 00:59:13,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 49 transitions, 126 flow [2025-04-14 00:59:13,468 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 44 transitions, 112 flow [2025-04-14 00:59:13,476 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:59:13,487 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;@61a2896a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:59:13,487 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 00:59:13,509 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:59:13,509 INFO L116 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-04-14 00:59:13,509 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:59:13,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:13,510 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] [2025-04-14 00:59:13,510 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:59:13,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1160540058, now seen corresponding path program 1 times [2025-04-14 00:59:13,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:13,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558600473] [2025-04-14 00:59:13,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:13,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:59:13,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:59:13,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:13,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:14,070 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-14 00:59:14,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:14,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558600473] [2025-04-14 00:59:14,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558600473] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:14,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:14,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:59:14,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764623772] [2025-04-14 00:59:14,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:14,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:59:14,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:14,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:59:14,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:59:14,109 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 00:59:14,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-14 00:59:14,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:14,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 00:59:14,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:14,870 INFO L116 PetriNetUnfolderBase]: 5193/7239 cut-off events. [2025-04-14 00:59:14,870 INFO L117 PetriNetUnfolderBase]: For 267/267 co-relation queries the response was YES. [2025-04-14 00:59:14,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14494 conditions, 7239 events. 5193/7239 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 38022 event pairs, 359 based on Foata normal form. 212/7415 useless extension candidates. Maximal degree in co-relation 14263. Up to 4247 conditions per place. [2025-04-14 00:59:14,920 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 74 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2025-04-14 00:59:14,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 370 flow [2025-04-14 00:59:14,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:59:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:59:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-04-14 00:59:14,931 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5673469387755102 [2025-04-14 00:59:14,932 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 112 flow. Second operand 5 states and 139 transitions. [2025-04-14 00:59:14,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 370 flow [2025-04-14 00:59:14,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 342 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-14 00:59:14,945 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 112 flow [2025-04-14 00:59:14,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-04-14 00:59:14,949 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-04-14 00:59:14,949 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 112 flow [2025-04-14 00:59:14,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-14 00:59:14,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:14,950 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, 1, 1, 1] [2025-04-14 00:59:14,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:59:14,950 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:59:14,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash -283073235, now seen corresponding path program 1 times [2025-04-14 00:59:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:14,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076379003] [2025-04-14 00:59:14,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:14,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 00:59:14,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:59:14,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:14,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:59:15,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:15,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076379003] [2025-04-14 00:59:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076379003] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:15,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:15,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:59:15,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931622051] [2025-04-14 00:59:15,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:15,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:59:15,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:15,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:59:15,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:59:15,223 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 00:59:15,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-14 00:59:15,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:15,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 00:59:15,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:15,920 INFO L116 PetriNetUnfolderBase]: 6179/8619 cut-off events. [2025-04-14 00:59:15,920 INFO L117 PetriNetUnfolderBase]: For 1007/1007 co-relation queries the response was YES. [2025-04-14 00:59:15,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18009 conditions, 8619 events. 6179/8619 cut-off events. For 1007/1007 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 45516 event pairs, 821 based on Foata normal form. 374/8966 useless extension candidates. Maximal degree in co-relation 2621. Up to 4321 conditions per place. [2025-04-14 00:59:15,970 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 86 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2025-04-14 00:59:15,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 100 transitions, 423 flow [2025-04-14 00:59:15,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:59:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:59:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2025-04-14 00:59:15,972 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2025-04-14 00:59:15,972 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 112 flow. Second operand 6 states and 166 transitions. [2025-04-14 00:59:15,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 100 transitions, 423 flow [2025-04-14 00:59:15,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 100 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:59:15,974 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 141 flow [2025-04-14 00:59:15,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2025-04-14 00:59:15,975 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2025-04-14 00:59:15,975 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 141 flow [2025-04-14 00:59:15,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-14 00:59:15,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:15,975 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, 1, 1, 1] [2025-04-14 00:59:15,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:59:15,975 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:59:15,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1678029521, now seen corresponding path program 2 times [2025-04-14 00:59:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:15,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239338924] [2025-04-14 00:59:15,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:59:15,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:15,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-04-14 00:59:15,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:59:15,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:59:15,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:16,102 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-14 00:59:16,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:16,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239338924] [2025-04-14 00:59:16,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239338924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:16,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:16,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:59:16,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929700081] [2025-04-14 00:59:16,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:16,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:59:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:16,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:59:16,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:59:16,104 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 00:59:16,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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-14 00:59:16,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:16,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 00:59:16,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:16,868 INFO L116 PetriNetUnfolderBase]: 6693/9297 cut-off events. [2025-04-14 00:59:16,868 INFO L117 PetriNetUnfolderBase]: For 3086/3086 co-relation queries the response was YES. [2025-04-14 00:59:16,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21733 conditions, 9297 events. 6693/9297 cut-off events. For 3086/3086 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 49681 event pairs, 4961 based on Foata normal form. 201/9387 useless extension candidates. Maximal degree in co-relation 12896. Up to 8067 conditions per place. [2025-04-14 00:59:16,924 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 39 selfloop transitions, 2 changer transitions 22/71 dead transitions. [2025-04-14 00:59:16,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 326 flow [2025-04-14 00:59:16,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:59:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:59:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-04-14 00:59:16,927 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49387755102040815 [2025-04-14 00:59:16,927 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 141 flow. Second operand 5 states and 121 transitions. [2025-04-14 00:59:16,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 326 flow [2025-04-14 00:59:16,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:59:16,955 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 154 flow [2025-04-14 00:59:16,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2025-04-14 00:59:16,955 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2025-04-14 00:59:16,955 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 154 flow [2025-04-14 00:59:16,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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-14 00:59:16,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:16,956 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, 1, 1, 1, 1] [2025-04-14 00:59:16,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:59:16,956 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:59:16,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash -242648864, now seen corresponding path program 1 times [2025-04-14 00:59:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:16,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995915615] [2025-04-14 00:59:16,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:16,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:59:16,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:59:16,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:16,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:59:17,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:17,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995915615] [2025-04-14 00:59:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995915615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:17,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:17,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:59:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270576893] [2025-04-14 00:59:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:17,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:59:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:17,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:59:17,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:59:17,165 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 00:59:17,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-14 00:59:17,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:17,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 00:59:17,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:18,501 INFO L116 PetriNetUnfolderBase]: 14921/20455 cut-off events. [2025-04-14 00:59:18,501 INFO L117 PetriNetUnfolderBase]: For 8064/8064 co-relation queries the response was YES. [2025-04-14 00:59:18,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49234 conditions, 20455 events. 14921/20455 cut-off events. For 8064/8064 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 115597 event pairs, 2952 based on Foata normal form. 224/20524 useless extension candidates. Maximal degree in co-relation 49217. Up to 7064 conditions per place. [2025-04-14 00:59:18,604 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 104 selfloop transitions, 11 changer transitions 0/123 dead transitions. [2025-04-14 00:59:18,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 123 transitions, 605 flow [2025-04-14 00:59:18,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:59:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:59:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-04-14 00:59:18,606 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-04-14 00:59:18,606 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 154 flow. Second operand 6 states and 177 transitions. [2025-04-14 00:59:18,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 123 transitions, 605 flow [2025-04-14 00:59:18,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 123 transitions, 599 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:59:18,611 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 247 flow [2025-04-14 00:59:18,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2025-04-14 00:59:18,611 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2025-04-14 00:59:18,611 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 247 flow [2025-04-14 00:59:18,612 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-14 00:59:18,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:18,612 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:18,612 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:59:18,612 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:59:18,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:18,612 INFO L85 PathProgramCache]: Analyzing trace with hash -22159212, now seen corresponding path program 1 times [2025-04-14 00:59:18,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:18,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672555090] [2025-04-14 00:59:18,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:18,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:59:18,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:59:18,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:18,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:19,391 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-14 00:59:19,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:19,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672555090] [2025-04-14 00:59:19,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672555090] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:59:19,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38924951] [2025-04-14 00:59:19,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:19,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:59:19,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:59:19,395 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-14 00:59:19,400 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-14 00:59:19,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:59:19,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:59:19,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:19,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:19,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:59:19,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:59:19,578 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-14 00:59:19,897 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 15 treesize of output 7 [2025-04-14 00:59:19,911 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-14 00:59:19,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:59:20,456 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 39 treesize of output 35 [2025-04-14 00:59:20,465 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 35 [2025-04-14 00:59:20,530 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-14 00:59:20,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38924951] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:59:20,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:59:20,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-14 00:59:20,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506525950] [2025-04-14 00:59:20,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:59:20,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:59:20,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:20,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:59:20,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:59:20,532 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 00:59:20,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 247 flow. Second operand has 18 states, 18 states have (on average 16.333333333333332) internal successors, (294), 18 states have internal predecessors, (294), 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-14 00:59:20,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:20,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 00:59:20,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:26,000 INFO L116 PetriNetUnfolderBase]: 48402/67075 cut-off events. [2025-04-14 00:59:26,001 INFO L117 PetriNetUnfolderBase]: For 86913/86913 co-relation queries the response was YES. [2025-04-14 00:59:26,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192855 conditions, 67075 events. 48402/67075 cut-off events. For 86913/86913 co-relation queries the response was YES. Maximal size of possible extension queue 2526. Compared 445946 event pairs, 3018 based on Foata normal form. 74/67022 useless extension candidates. Maximal degree in co-relation 107017. Up to 24185 conditions per place. [2025-04-14 00:59:26,421 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 297 selfloop transitions, 55 changer transitions 7/367 dead transitions. [2025-04-14 00:59:26,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 367 transitions, 2129 flow [2025-04-14 00:59:26,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:59:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:59:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 547 transitions. [2025-04-14 00:59:26,424 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5875402792696026 [2025-04-14 00:59:26,424 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 247 flow. Second operand 19 states and 547 transitions. [2025-04-14 00:59:26,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 367 transitions, 2129 flow [2025-04-14 00:59:26,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 367 transitions, 2091 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-14 00:59:26,487 INFO L231 Difference]: Finished difference. Result has 87 places, 113 transitions, 702 flow [2025-04-14 00:59:26,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=702, PETRI_PLACES=87, PETRI_TRANSITIONS=113} [2025-04-14 00:59:26,487 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2025-04-14 00:59:26,487 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 113 transitions, 702 flow [2025-04-14 00:59:26,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 16.333333333333332) internal successors, (294), 18 states have internal predecessors, (294), 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-14 00:59:26,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:26,488 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, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:26,494 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-14 00:59:26,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:59:26,688 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:59:26,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:26,689 INFO L85 PathProgramCache]: Analyzing trace with hash -427167163, now seen corresponding path program 1 times [2025-04-14 00:59:26,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:26,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308764354] [2025-04-14 00:59:26,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:26,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:26,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:59:26,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:59:26,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:26,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:59:27,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:27,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308764354] [2025-04-14 00:59:27,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308764354] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:59:27,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514006692] [2025-04-14 00:59:27,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:27,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:59:27,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:59:27,683 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-14 00:59:27,684 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-14 00:59:27,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:59:27,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:59:27,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:27,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:27,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 00:59:27,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:59:27,992 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 25 treesize of output 7 [2025-04-14 00:59:27,998 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-14 00:59:27,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:59:28,102 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:59:28,102 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 26 treesize of output 18 [2025-04-14 00:59:28,261 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-14 00:59:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514006692] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:59:28,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:59:28,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 14 [2025-04-14 00:59:28,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453301038] [2025-04-14 00:59:28,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:59:28,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:59:28,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:28,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:59:28,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:59:28,263 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 00:59:28,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 113 transitions, 702 flow. Second operand has 16 states, 16 states have (on average 16.875) internal successors, (270), 16 states have internal predecessors, (270), 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-14 00:59:28,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:28,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 00:59:28,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:36,866 INFO L116 PetriNetUnfolderBase]: 77882/108349 cut-off events. [2025-04-14 00:59:36,867 INFO L117 PetriNetUnfolderBase]: For 213899/213899 co-relation queries the response was YES. [2025-04-14 00:59:37,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335725 conditions, 108349 events. 77882/108349 cut-off events. For 213899/213899 co-relation queries the response was YES. Maximal size of possible extension queue 3870. Compared 757967 event pairs, 3293 based on Foata normal form. 287/108498 useless extension candidates. Maximal degree in co-relation 280158. Up to 34310 conditions per place. [2025-04-14 00:59:37,705 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 192 selfloop transitions, 87 changer transitions 2/289 dead transitions. [2025-04-14 00:59:37,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 289 transitions, 2054 flow [2025-04-14 00:59:37,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:59:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:59:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 381 transitions. [2025-04-14 00:59:37,708 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48596938775510207 [2025-04-14 00:59:37,708 INFO L175 Difference]: Start difference. First operand has 87 places, 113 transitions, 702 flow. Second operand 16 states and 381 transitions. [2025-04-14 00:59:37,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 289 transitions, 2054 flow [2025-04-14 00:59:38,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 289 transitions, 2016 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-04-14 00:59:38,567 INFO L231 Difference]: Finished difference. Result has 106 places, 152 transitions, 1252 flow [2025-04-14 00:59:38,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1252, PETRI_PLACES=106, PETRI_TRANSITIONS=152} [2025-04-14 00:59:38,568 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 55 predicate places. [2025-04-14 00:59:38,568 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 152 transitions, 1252 flow [2025-04-14 00:59:38,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.875) internal successors, (270), 16 states have internal predecessors, (270), 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-14 00:59:38,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:38,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:38,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:59:38,772 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,SelfDestructingSolverStorable5 [2025-04-14 00:59:38,772 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:59:38,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash -631215924, now seen corresponding path program 1 times [2025-04-14 00:59:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:38,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239924492] [2025-04-14 00:59:38,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:38,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:38,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-14 00:59:38,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 00:59:38,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:38,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:59:38,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:38,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239924492] [2025-04-14 00:59:38,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239924492] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:38,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:38,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:59:38,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777757095] [2025-04-14 00:59:38,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:38,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:59:38,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:38,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:59:38,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:59:38,842 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 00:59:38,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 152 transitions, 1252 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-14 00:59:38,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:38,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 00:59:38,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:51,005 INFO L116 PetriNetUnfolderBase]: 100623/141450 cut-off events. [2025-04-14 00:59:51,005 INFO L117 PetriNetUnfolderBase]: For 483373/483373 co-relation queries the response was YES. [2025-04-14 00:59:51,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474369 conditions, 141450 events. 100623/141450 cut-off events. For 483373/483373 co-relation queries the response was YES. Maximal size of possible extension queue 4613. Compared 1046659 event pairs, 29709 based on Foata normal form. 3101/144489 useless extension candidates. Maximal degree in co-relation 436226. Up to 85520 conditions per place. [2025-04-14 00:59:52,395 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 216 selfloop transitions, 9 changer transitions 0/233 dead transitions. [2025-04-14 00:59:52,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 233 transitions, 2489 flow [2025-04-14 00:59:52,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:59:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:59:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-04-14 00:59:52,396 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2025-04-14 00:59:52,397 INFO L175 Difference]: Start difference. First operand has 106 places, 152 transitions, 1252 flow. Second operand 3 states and 96 transitions. [2025-04-14 00:59:52,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 233 transitions, 2489 flow [2025-04-14 00:59:54,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 233 transitions, 2425 flow, removed 28 selfloop flow, removed 3 redundant places. [2025-04-14 00:59:54,332 INFO L231 Difference]: Finished difference. Result has 106 places, 153 transitions, 1283 flow [2025-04-14 00:59:54,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1283, PETRI_PLACES=106, PETRI_TRANSITIONS=153} [2025-04-14 00:59:54,332 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 55 predicate places. [2025-04-14 00:59:54,332 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 153 transitions, 1283 flow [2025-04-14 00:59:54,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-14 00:59:54,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:54,333 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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, 1, 1] [2025-04-14 00:59:54,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:59:54,333 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:59:54,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1995676977, now seen corresponding path program 2 times [2025-04-14 00:59:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:54,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059899464] [2025-04-14 00:59:54,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:59:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:54,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-14 00:59:54,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 00:59:54,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:59:54,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:59:54,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:54,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059899464] [2025-04-14 00:59:54,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059899464] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:54,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:54,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:59:54,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913373541] [2025-04-14 00:59:54,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:54,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:59:54,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:54,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:59:54,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:59:54,555 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 00:59:54,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 153 transitions, 1283 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:54,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:54,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 00:59:54,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:00:09,377 INFO L116 PetriNetUnfolderBase]: 125305/176939 cut-off events. [2025-04-14 01:00:09,378 INFO L117 PetriNetUnfolderBase]: For 495181/495181 co-relation queries the response was YES. [2025-04-14 01:00:10,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595157 conditions, 176939 events. 125305/176939 cut-off events. For 495181/495181 co-relation queries the response was YES. Maximal size of possible extension queue 5043. Compared 1330052 event pairs, 24207 based on Foata normal form. 2132/178915 useless extension candidates. Maximal degree in co-relation 591926. Up to 80796 conditions per place. [2025-04-14 01:00:10,971 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 174 selfloop transitions, 46 changer transitions 0/228 dead transitions. [2025-04-14 01:00:10,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 228 transitions, 2154 flow [2025-04-14 01:00:10,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:00:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:00:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-04-14 01:00:10,973 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7244897959183674 [2025-04-14 01:00:10,973 INFO L175 Difference]: Start difference. First operand has 106 places, 153 transitions, 1283 flow. Second operand 4 states and 142 transitions. [2025-04-14 01:00:10,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 228 transitions, 2154 flow [2025-04-14 01:00:14,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 228 transitions, 2143 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:00:14,338 INFO L231 Difference]: Finished difference. Result has 110 places, 161 transitions, 1604 flow [2025-04-14 01:00:14,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1604, PETRI_PLACES=110, PETRI_TRANSITIONS=161} [2025-04-14 01:00:14,339 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 59 predicate places. [2025-04-14 01:00:14,339 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 161 transitions, 1604 flow [2025-04-14 01:00:14,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:14,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:14,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:00:14,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:00:14,339 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:00:14,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1326298659, now seen corresponding path program 1 times [2025-04-14 01:00:14,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:14,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600354078] [2025-04-14 01:00:14,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:14,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 01:00:14,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 01:00:14,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:14,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:00:14,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:14,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600354078] [2025-04-14 01:00:14,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600354078] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:00:14,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:00:14,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:00:14,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447253274] [2025-04-14 01:00:14,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:00:14,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:00:14,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:00:14,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:00:14,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:00:14,433 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-04-14 01:00:14,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 161 transitions, 1604 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-14 01:00:14,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:00:14,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-04-14 01:00:14,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:00:31,042 INFO L116 PetriNetUnfolderBase]: 138562/199561 cut-off events. [2025-04-14 01:00:31,042 INFO L117 PetriNetUnfolderBase]: For 705433/705433 co-relation queries the response was YES. [2025-04-14 01:00:32,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690602 conditions, 199561 events. 138562/199561 cut-off events. For 705433/705433 co-relation queries the response was YES. Maximal size of possible extension queue 5763. Compared 1590104 event pairs, 103837 based on Foata normal form. 5202/204646 useless extension candidates. Maximal degree in co-relation 656546. Up to 126609 conditions per place. [2025-04-14 01:00:32,996 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 190 selfloop transitions, 11 changer transitions 22/231 dead transitions. [2025-04-14 01:00:32,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 231 transitions, 2811 flow [2025-04-14 01:00:32,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:00:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:00:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-04-14 01:00:32,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.576530612244898 [2025-04-14 01:00:32,997 INFO L175 Difference]: Start difference. First operand has 110 places, 161 transitions, 1604 flow. Second operand 4 states and 113 transitions. [2025-04-14 01:00:32,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 231 transitions, 2811 flow [2025-04-14 01:00:39,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 231 transitions, 2745 flow, removed 26 selfloop flow, removed 1 redundant places. [2025-04-14 01:00:39,214 INFO L231 Difference]: Finished difference. Result has 113 places, 152 transitions, 1503 flow [2025-04-14 01:00:39,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1503, PETRI_PLACES=113, PETRI_TRANSITIONS=152} [2025-04-14 01:00:39,215 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 62 predicate places. [2025-04-14 01:00:39,215 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 152 transitions, 1503 flow [2025-04-14 01:00:39,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-14 01:00:39,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:39,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:00:39,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:00:39,215 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:00:39,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1701137293, now seen corresponding path program 1 times [2025-04-14 01:00:39,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:39,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457850588] [2025-04-14 01:00:39,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:39,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-14 01:00:39,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 01:00:39,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:39,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:00:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:39,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457850588] [2025-04-14 01:00:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457850588] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:00:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:00:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:00:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057776795] [2025-04-14 01:00:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:00:39,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:00:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:00:39,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:00:39,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:00:39,548 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-04-14 01:00:39,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 152 transitions, 1503 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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-14 01:00:39,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:00:39,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-04-14 01:00:39,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand