/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-commit-2.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:59:42,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:59:42,616 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:42,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:59:42,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:59:42,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:59:42,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:59:42,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:59:42,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:59:42,641 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:59:42,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:59:42,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:59:42,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:59:42,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:59:42,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:59:42,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:59:42,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:59:42,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:59:42,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:59:42,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:59:42,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:59:42,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:59:42,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:59:42,645 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:42,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:59:42,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:59:42,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:59:42,872 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:59:42,873 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:59:42,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2025-04-14 00:59:44,124 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72b9d410/40af239fad284f5f89a930e1b817899a/FLAGa073fd065 [2025-04-14 00:59:44,321 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:59:44,321 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2025-04-14 00:59:44,327 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72b9d410/40af239fad284f5f89a930e1b817899a/FLAGa073fd065 [2025-04-14 00:59:45,174 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72b9d410/40af239fad284f5f89a930e1b817899a [2025-04-14 00:59:45,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:59:45,178 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:59:45,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:59:45,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:59:45,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:59:45,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:59:45" (1/1) ... [2025-04-14 00:59:45,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438c6169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:45, skipping insertion in model container [2025-04-14 00:59:45,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:59:45" (1/1) ... [2025-04-14 00:59:45,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:59:45,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2025-04-14 00:59:45,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:59:45,408 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:59:45,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2025-04-14 00:59:45,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:59:45,475 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:59:45,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:45 WrapperNode [2025-04-14 00:59:45,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:59:45,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:59:45,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:59:45,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:59:45,480 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:45" (1/1) ... [2025-04-14 00:59:45,490 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:45" (1/1) ... [2025-04-14 00:59:45,521 INFO L138 Inliner]: procedures = 25, calls = 73, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 445 [2025-04-14 00:59:45,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:59:45,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:59:45,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:59:45,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:59:45,531 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:45" (1/1) ... [2025-04-14 00:59:45,531 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:45" (1/1) ... [2025-04-14 00:59:45,534 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:45" (1/1) ... [2025-04-14 00:59:45,547 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-14 00:59:45,547 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:45" (1/1) ... [2025-04-14 00:59:45,547 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:45" (1/1) ... [2025-04-14 00:59:45,563 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:45" (1/1) ... [2025-04-14 00:59:45,568 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:45" (1/1) ... [2025-04-14 00:59:45,569 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:45" (1/1) ... [2025-04-14 00:59:45,570 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:45" (1/1) ... [2025-04-14 00:59:45,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:59:45,578 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:59:45,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:59:45,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:59:45,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:45" (1/1) ... [2025-04-14 00:59:45,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:59:45,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:59:45,605 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:45,610 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:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:59:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:59:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:59:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:59:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:59:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:59:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:59:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 00:59:45,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 00:59:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:59:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:59:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:59:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:59:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:59:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:59:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:59:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:59:45,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:59:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:59:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:59:45,628 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:45,708 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:59:45,709 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:59:46,158 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:59:46,159 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:59:46,159 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:59:46,614 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:59:46,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:59:46 BoogieIcfgContainer [2025-04-14 00:59:46,615 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:59:46,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:59:46,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:59:46,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:59:46,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:59:45" (1/3) ... [2025-04-14 00:59:46,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7540cefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:59:46, skipping insertion in model container [2025-04-14 00:59:46,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:45" (2/3) ... [2025-04-14 00:59:46,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7540cefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:59:46, skipping insertion in model container [2025-04-14 00:59:46,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:59:46" (3/3) ... [2025-04-14 00:59:46,621 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2025-04-14 00:59:46,631 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:59:46,633 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-2.wvr-bad.c that has 5 procedures, 40 locations, 55 edges, 1 initial locations, 8 loop locations, and 1 error locations. [2025-04-14 00:59:46,633 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:59:46,692 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 00:59:46,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 59 transitions, 146 flow [2025-04-14 00:59:46,744 INFO L116 PetriNetUnfolderBase]: 20/55 cut-off events. [2025-04-14 00:59:46,746 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:59:46,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 20/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 68 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 47. Up to 8 conditions per place. [2025-04-14 00:59:46,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 59 transitions, 146 flow [2025-04-14 00:59:46,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 54 transitions, 132 flow [2025-04-14 00:59:46,760 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:59:46,768 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;@74d7e93b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:59:46,769 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 00:59:46,786 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:59:46,786 INFO L116 PetriNetUnfolderBase]: 20/53 cut-off events. [2025-04-14 00:59:46,787 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:59:46,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:46,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:46,788 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:46,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1590965766, now seen corresponding path program 1 times [2025-04-14 00:59:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:46,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787497426] [2025-04-14 00:59:46,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:46,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:46,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:59:46,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:59:46,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:46,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:47,210 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:47,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:47,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787497426] [2025-04-14 00:59:47,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787497426] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:47,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:47,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:59:47,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517317944] [2025-04-14 00:59:47,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:47,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:59:47,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:47,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:59:47,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:59:47,238 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 00:59:47,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:47,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:47,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 00:59:47,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:48,448 INFO L116 PetriNetUnfolderBase]: 15369/18265 cut-off events. [2025-04-14 00:59:48,448 INFO L117 PetriNetUnfolderBase]: For 434/434 co-relation queries the response was YES. [2025-04-14 00:59:48,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37380 conditions, 18265 events. 15369/18265 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 64298 event pairs, 3586 based on Foata normal form. 1/10068 useless extension candidates. Maximal degree in co-relation 35472. Up to 10608 conditions per place. [2025-04-14 00:59:48,540 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 89 selfloop transitions, 7 changer transitions 1/97 dead transitions. [2025-04-14 00:59:48,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 97 transitions, 433 flow [2025-04-14 00:59:48,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:59:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:59:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-04-14 00:59:48,554 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6214689265536724 [2025-04-14 00:59:48,556 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 132 flow. Second operand 3 states and 110 transitions. [2025-04-14 00:59:48,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 97 transitions, 433 flow [2025-04-14 00:59:48,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 97 transitions, 403 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-14 00:59:48,586 INFO L231 Difference]: Finished difference. Result has 42 places, 60 transitions, 163 flow [2025-04-14 00:59:48,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=42, PETRI_TRANSITIONS=60} [2025-04-14 00:59:48,592 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2025-04-14 00:59:48,592 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 60 transitions, 163 flow [2025-04-14 00:59:48,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:48,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:48,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:48,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:59:48,593 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:48,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:48,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1905050768, now seen corresponding path program 1 times [2025-04-14 00:59:48,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:48,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535789364] [2025-04-14 00:59:48,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:48,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:48,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:59:48,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:59:48,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:48,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:48,754 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:48,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:48,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535789364] [2025-04-14 00:59:48,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535789364] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:48,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:48,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:59:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310501931] [2025-04-14 00:59:48,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:48,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:59:48,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:48,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:59:48,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:59:48,755 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 00:59:48,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 60 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:48,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:48,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 00:59:48,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:50,466 INFO L116 PetriNetUnfolderBase]: 29635/35374 cut-off events. [2025-04-14 00:59:50,467 INFO L117 PetriNetUnfolderBase]: For 5205/5205 co-relation queries the response was YES. [2025-04-14 00:59:50,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78730 conditions, 35374 events. 29635/35374 cut-off events. For 5205/5205 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 134473 event pairs, 8121 based on Foata normal form. 1014/20038 useless extension candidates. Maximal degree in co-relation 30863. Up to 20106 conditions per place. [2025-04-14 00:59:50,621 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 98 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2025-04-14 00:59:50,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 102 transitions, 474 flow [2025-04-14 00:59:50,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:59:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:59:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-04-14 00:59:50,625 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6101694915254238 [2025-04-14 00:59:50,625 INFO L175 Difference]: Start difference. First operand has 42 places, 60 transitions, 163 flow. Second operand 3 states and 108 transitions. [2025-04-14 00:59:50,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 102 transitions, 474 flow [2025-04-14 00:59:50,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 102 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:59:50,629 INFO L231 Difference]: Finished difference. Result has 44 places, 63 transitions, 192 flow [2025-04-14 00:59:50,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=44, PETRI_TRANSITIONS=63} [2025-04-14 00:59:50,629 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2025-04-14 00:59:50,629 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 63 transitions, 192 flow [2025-04-14 00:59:50,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:50,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:50,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:50,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:59:50,631 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:50,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash -117153498, now seen corresponding path program 1 times [2025-04-14 00:59:50,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:50,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930411543] [2025-04-14 00:59:50,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:50,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:50,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:59:50,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:59:50,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:50,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:50,754 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:50,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:50,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930411543] [2025-04-14 00:59:50,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930411543] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:50,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:50,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:59:50,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696770133] [2025-04-14 00:59:50,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:50,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:59:50,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:50,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:59:50,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:59:50,756 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 00:59:50,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 63 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:50,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:50,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 00:59:50,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:53,462 INFO L116 PetriNetUnfolderBase]: 57689/69098 cut-off events. [2025-04-14 00:59:53,462 INFO L117 PetriNetUnfolderBase]: For 16904/16904 co-relation queries the response was YES. [2025-04-14 00:59:53,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161444 conditions, 69098 events. 57689/69098 cut-off events. For 16904/16904 co-relation queries the response was YES. Maximal size of possible extension queue 2040. Compared 290525 event pairs, 15999 based on Foata normal form. 1392/37898 useless extension candidates. Maximal degree in co-relation 67521. Up to 36031 conditions per place. [2025-04-14 00:59:53,707 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 112 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-04-14 00:59:53,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 114 transitions, 578 flow [2025-04-14 00:59:53,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:59:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:59:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-04-14 00:59:53,709 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6214689265536724 [2025-04-14 00:59:53,709 INFO L175 Difference]: Start difference. First operand has 44 places, 63 transitions, 192 flow. Second operand 3 states and 110 transitions. [2025-04-14 00:59:53,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 114 transitions, 578 flow [2025-04-14 00:59:53,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 114 transitions, 571 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:59:53,718 INFO L231 Difference]: Finished difference. Result has 46 places, 64 transitions, 202 flow [2025-04-14 00:59:53,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=46, PETRI_TRANSITIONS=64} [2025-04-14 00:59:53,719 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2025-04-14 00:59:53,719 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 64 transitions, 202 flow [2025-04-14 00:59:53,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:53,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:53,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:53,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:59:53,719 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:53,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash 3581158, now seen corresponding path program 1 times [2025-04-14 00:59:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:53,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202592482] [2025-04-14 00:59:53,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:53,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:59:53,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:59:53,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:53,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:53,827 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:53,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:53,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202592482] [2025-04-14 00:59:53,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202592482] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:53,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:53,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:59:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100909346] [2025-04-14 00:59:53,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:53,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:59:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:53,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:59:53,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:59:53,828 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 00:59:53,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 64 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:53,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:53,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 00:59:53,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:59,559 INFO L116 PetriNetUnfolderBase]: 111661/134218 cut-off events. [2025-04-14 00:59:59,559 INFO L117 PetriNetUnfolderBase]: For 38681/38681 co-relation queries the response was YES. [2025-04-14 00:59:59,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310994 conditions, 134218 events. 111661/134218 cut-off events. For 38681/38681 co-relation queries the response was YES. Maximal size of possible extension queue 3703. Compared 613006 event pairs, 31262 based on Foata normal form. 2656/72302 useless extension candidates. Maximal degree in co-relation 143407. Up to 70397 conditions per place. [2025-04-14 00:59:59,982 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 114 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2025-04-14 00:59:59,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 116 transitions, 600 flow [2025-04-14 00:59:59,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:59:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:59:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-04-14 00:59:59,983 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6214689265536724 [2025-04-14 00:59:59,983 INFO L175 Difference]: Start difference. First operand has 46 places, 64 transitions, 202 flow. Second operand 3 states and 110 transitions. [2025-04-14 00:59:59,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 116 transitions, 600 flow [2025-04-14 00:59:59,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 116 transitions, 597 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:59:59,992 INFO L231 Difference]: Finished difference. Result has 48 places, 65 transitions, 214 flow [2025-04-14 00:59:59,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=48, PETRI_TRANSITIONS=65} [2025-04-14 00:59:59,992 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2025-04-14 00:59:59,992 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 65 transitions, 214 flow [2025-04-14 00:59:59,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:59,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:59,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:59,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:59:59,993 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:59,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:59,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1891957272, now seen corresponding path program 1 times [2025-04-14 00:59:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:59,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765763130] [2025-04-14 00:59:59,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:59,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:00,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:00:00,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:00:00,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:00,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:00,045 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 01:00:00,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:00,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765763130] [2025-04-14 01:00:00,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765763130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:00:00,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:00:00,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:00:00,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270027504] [2025-04-14 01:00:00,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:00:00,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:00:00,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:00:00,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:00:00,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:00:00,046 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 01:00:00,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 65 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:00,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:00:00,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 01:00:00,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:00:05,352 INFO L116 PetriNetUnfolderBase]: 115243/139195 cut-off events. [2025-04-14 01:00:05,352 INFO L117 PetriNetUnfolderBase]: For 47320/47320 co-relation queries the response was YES. [2025-04-14 01:00:05,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329041 conditions, 139195 events. 115243/139195 cut-off events. For 47320/47320 co-relation queries the response was YES. Maximal size of possible extension queue 4172. Compared 632842 event pairs, 48079 based on Foata normal form. 0/73941 useless extension candidates. Maximal degree in co-relation 147602. Up to 95968 conditions per place. [2025-04-14 01:00:05,927 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 100 selfloop transitions, 6 changer transitions 0/106 dead transitions. [2025-04-14 01:00:05,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 106 transitions, 567 flow [2025-04-14 01:00:05,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:00:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:00:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-04-14 01:00:05,931 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2025-04-14 01:00:05,931 INFO L175 Difference]: Start difference. First operand has 48 places, 65 transitions, 214 flow. Second operand 3 states and 102 transitions. [2025-04-14 01:00:05,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 106 transitions, 567 flow [2025-04-14 01:00:05,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 106 transitions, 564 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:00:05,950 INFO L231 Difference]: Finished difference. Result has 51 places, 66 transitions, 244 flow [2025-04-14 01:00:05,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=51, PETRI_TRANSITIONS=66} [2025-04-14 01:00:05,951 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2025-04-14 01:00:05,951 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 66 transitions, 244 flow [2025-04-14 01:00:05,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:05,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:05,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:00:05,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:00:05,952 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 01:00:05,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash -686640146, now seen corresponding path program 1 times [2025-04-14 01:00:05,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:05,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885457634] [2025-04-14 01:00:05,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:05,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:05,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:00:05,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:00:05,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:05,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:06,003 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 01:00:06,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:06,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885457634] [2025-04-14 01:00:06,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885457634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:00:06,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:00:06,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:00:06,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539054191] [2025-04-14 01:00:06,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:00:06,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:00:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:00:06,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:00:06,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:00:06,004 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 01:00:06,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 66 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:06,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:00:06,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 01:00:06,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:00:11,763 INFO L116 PetriNetUnfolderBase]: 98020/119925 cut-off events. [2025-04-14 01:00:11,763 INFO L117 PetriNetUnfolderBase]: For 65729/65729 co-relation queries the response was YES. [2025-04-14 01:00:11,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305802 conditions, 119925 events. 98020/119925 cut-off events. For 65729/65729 co-relation queries the response was YES. Maximal size of possible extension queue 3594. Compared 580123 event pairs, 45256 based on Foata normal form. 0/73958 useless extension candidates. Maximal degree in co-relation 183808. Up to 91313 conditions per place. [2025-04-14 01:00:12,194 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 102 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2025-04-14 01:00:12,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 108 transitions, 606 flow [2025-04-14 01:00:12,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:00:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:00:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-04-14 01:00:12,196 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5988700564971752 [2025-04-14 01:00:12,196 INFO L175 Difference]: Start difference. First operand has 51 places, 66 transitions, 244 flow. Second operand 3 states and 106 transitions. [2025-04-14 01:00:12,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 108 transitions, 606 flow [2025-04-14 01:00:12,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 108 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:00:12,691 INFO L231 Difference]: Finished difference. Result has 53 places, 67 transitions, 264 flow [2025-04-14 01:00:12,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=53, PETRI_TRANSITIONS=67} [2025-04-14 01:00:12,691 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2025-04-14 01:00:12,691 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 67 transitions, 264 flow [2025-04-14 01:00:12,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:12,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:12,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:00:12,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:00:12,692 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 01:00:12,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2079923760, now seen corresponding path program 1 times [2025-04-14 01:00:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:12,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184042330] [2025-04-14 01:00:12,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:12,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:00:12,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:00:12,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:12,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:12,754 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 01:00:12,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:12,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184042330] [2025-04-14 01:00:12,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184042330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:00:12,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:00:12,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:00:12,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175500897] [2025-04-14 01:00:12,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:00:12,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:00:12,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:00:12,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:00:12,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:00:12,755 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 01:00:12,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 67 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:12,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:00:12,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 01:00:12,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:00:16,670 INFO L116 PetriNetUnfolderBase]: 80703/99758 cut-off events. [2025-04-14 01:00:16,670 INFO L117 PetriNetUnfolderBase]: For 70532/70532 co-relation queries the response was YES. [2025-04-14 01:00:16,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268093 conditions, 99758 events. 80703/99758 cut-off events. For 70532/70532 co-relation queries the response was YES. Maximal size of possible extension queue 2661. Compared 475167 event pairs, 36286 based on Foata normal form. 0/69081 useless extension candidates. Maximal degree in co-relation 147460. Up to 70590 conditions per place. [2025-04-14 01:00:17,272 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 102 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2025-04-14 01:00:17,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 637 flow [2025-04-14 01:00:17,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:00:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:00:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-04-14 01:00:17,274 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5875706214689266 [2025-04-14 01:00:17,274 INFO L175 Difference]: Start difference. First operand has 53 places, 67 transitions, 264 flow. Second operand 3 states and 104 transitions. [2025-04-14 01:00:17,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 637 flow [2025-04-14 01:00:17,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 108 transitions, 617 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:00:17,316 INFO L231 Difference]: Finished difference. Result has 55 places, 68 transitions, 284 flow [2025-04-14 01:00:17,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=55, PETRI_TRANSITIONS=68} [2025-04-14 01:00:17,316 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2025-04-14 01:00:17,317 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 68 transitions, 284 flow [2025-04-14 01:00:17,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:17,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:17,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:00:17,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:00:17,317 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 01:00:17,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash 688289230, now seen corresponding path program 1 times [2025-04-14 01:00:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:17,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96228160] [2025-04-14 01:00:17,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:17,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:00:17,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:00:17,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:17,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:17,368 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 01:00:17,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:17,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96228160] [2025-04-14 01:00:17,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96228160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:00:17,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:00:17,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:00:17,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363459842] [2025-04-14 01:00:17,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:00:17,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:00:17,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:00:17,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:00:17,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:00:17,370 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 01:00:17,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 68 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:17,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:00:17,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 01:00:17,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:00:20,522 INFO L116 PetriNetUnfolderBase]: 51125/62875 cut-off events. [2025-04-14 01:00:20,522 INFO L117 PetriNetUnfolderBase]: For 51764/51764 co-relation queries the response was YES. [2025-04-14 01:00:20,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177401 conditions, 62875 events. 51125/62875 cut-off events. For 51764/51764 co-relation queries the response was YES. Maximal size of possible extension queue 1546. Compared 278386 event pairs, 14260 based on Foata normal form. 0/47501 useless extension candidates. Maximal degree in co-relation 105321. Up to 42265 conditions per place. [2025-04-14 01:00:20,772 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 86 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2025-04-14 01:00:20,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 544 flow [2025-04-14 01:00:20,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:00:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:00:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-04-14 01:00:20,773 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5536723163841808 [2025-04-14 01:00:20,773 INFO L175 Difference]: Start difference. First operand has 55 places, 68 transitions, 284 flow. Second operand 3 states and 98 transitions. [2025-04-14 01:00:20,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 544 flow [2025-04-14 01:00:20,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:00:20,795 INFO L231 Difference]: Finished difference. Result has 57 places, 63 transitions, 268 flow [2025-04-14 01:00:20,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=57, PETRI_TRANSITIONS=63} [2025-04-14 01:00:20,795 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2025-04-14 01:00:20,795 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 63 transitions, 268 flow [2025-04-14 01:00:20,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:20,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:20,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:00:20,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:00:20,796 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:20,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash -806818874, now seen corresponding path program 1 times [2025-04-14 01:00:20,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:20,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686130714] [2025-04-14 01:00:20,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:20,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:20,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:00:20,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:00:20,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:20,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:00:20,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:20,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686130714] [2025-04-14 01:00:20,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686130714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:00:20,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:00:20,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:00:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756553851] [2025-04-14 01:00:20,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:00:20,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:00:20,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:00:20,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:00:20,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:00:20,858 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 01:00:20,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:20,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:00:20,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 01:00:20,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:00:25,055 INFO L116 PetriNetUnfolderBase]: 76963/94383 cut-off events. [2025-04-14 01:00:25,055 INFO L117 PetriNetUnfolderBase]: For 77938/77938 co-relation queries the response was YES. [2025-04-14 01:00:25,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281939 conditions, 94383 events. 76963/94383 cut-off events. For 77938/77938 co-relation queries the response was YES. Maximal size of possible extension queue 1937. Compared 422041 event pairs, 19927 based on Foata normal form. 1480/73795 useless extension candidates. Maximal degree in co-relation 110653. Up to 61489 conditions per place. [2025-04-14 01:00:25,461 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 103 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2025-04-14 01:00:25,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 105 transitions, 658 flow [2025-04-14 01:00:25,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:00:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:00:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-04-14 01:00:25,462 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5875706214689266 [2025-04-14 01:00:25,462 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 268 flow. Second operand 3 states and 104 transitions. [2025-04-14 01:00:25,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 105 transitions, 658 flow [2025-04-14 01:00:25,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:00:25,512 INFO L231 Difference]: Finished difference. Result has 58 places, 63 transitions, 266 flow [2025-04-14 01:00:25,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2025-04-14 01:00:25,513 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2025-04-14 01:00:25,513 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 266 flow [2025-04-14 01:00:25,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:25,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:25,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:00:25,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:00:25,513 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:25,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:25,513 INFO L85 PathProgramCache]: Analyzing trace with hash -416642466, now seen corresponding path program 1 times [2025-04-14 01:00:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:25,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940829456] [2025-04-14 01:00:25,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:25,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:25,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:00:25,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:00:25,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:25,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:25,628 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 01:00:25,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:25,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940829456] [2025-04-14 01:00:25,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940829456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:00:25,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:00:25,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:00:25,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234572415] [2025-04-14 01:00:25,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:00:25,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:00:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:00:25,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:00:25,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:00:25,629 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 01:00:25,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:25,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:00:25,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 01:00:25,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:00:30,385 INFO L116 PetriNetUnfolderBase]: 77522/95227 cut-off events. [2025-04-14 01:00:30,385 INFO L117 PetriNetUnfolderBase]: For 72829/72829 co-relation queries the response was YES. [2025-04-14 01:00:30,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283176 conditions, 95227 events. 77522/95227 cut-off events. For 72829/72829 co-relation queries the response was YES. Maximal size of possible extension queue 2029. Compared 432648 event pairs, 48437 based on Foata normal form. 67/71602 useless extension candidates. Maximal degree in co-relation 111576. Up to 94384 conditions per place. [2025-04-14 01:00:30,777 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 62 selfloop transitions, 2 changer transitions 27/91 dead transitions. [2025-04-14 01:00:30,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 520 flow [2025-04-14 01:00:30,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:00:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:00:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-04-14 01:00:30,779 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4194915254237288 [2025-04-14 01:00:30,779 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 266 flow. Second operand 4 states and 99 transitions. [2025-04-14 01:00:30,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 520 flow [2025-04-14 01:00:30,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:00:30,801 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 278 flow [2025-04-14 01:00:30,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2025-04-14 01:00:30,801 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2025-04-14 01:00:30,801 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 278 flow [2025-04-14 01:00:30,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:30,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:30,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:00:30,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:00:30,802 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:00:30,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash -210442779, now seen corresponding path program 1 times [2025-04-14 01:00:30,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:30,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616504406] [2025-04-14 01:00:30,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:30,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:30,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:00:30,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:00:30,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:30,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:00:31,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:31,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616504406] [2025-04-14 01:00:31,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616504406] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:00:31,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189492666] [2025-04-14 01:00:31,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:31,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:00:31,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:00:31,459 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 01:00:31,461 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 01:00:31,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:00:31,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:00:31,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:31,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:31,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 01:00:31,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:00:31,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:00:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:00:31,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:00:32,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-14 01:00:32,079 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 01:00:32,079 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-04-14 01:00:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:00:32,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189492666] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:00:32,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:00:32,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-04-14 01:00:32,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024659169] [2025-04-14 01:00:32,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:00:32,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:00:32,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:00:32,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:00:32,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:00:32,124 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 01:00:32,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 278 flow. Second operand has 18 states, 18 states have (on average 8.5) internal successors, (153), 18 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:32,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:00:32,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 01:00:32,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:00:56,747 INFO L116 PetriNetUnfolderBase]: 381202/467259 cut-off events. [2025-04-14 01:00:56,747 INFO L117 PetriNetUnfolderBase]: For 362783/362783 co-relation queries the response was YES. [2025-04-14 01:00:57,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392533 conditions, 467259 events. 381202/467259 cut-off events. For 362783/362783 co-relation queries the response was YES. Maximal size of possible extension queue 8371. Compared 2452309 event pairs, 33741 based on Foata normal form. 80/349200 useless extension candidates. Maximal degree in co-relation 1392503. Up to 105342 conditions per place. [2025-04-14 01:00:59,277 INFO L140 encePairwiseOnDemand]: 42/59 looper letters, 324 selfloop transitions, 48 changer transitions 31/403 dead transitions. [2025-04-14 01:00:59,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 403 transitions, 2390 flow [2025-04-14 01:00:59,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:00:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:00:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 426 transitions. [2025-04-14 01:00:59,279 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48135593220338985 [2025-04-14 01:00:59,279 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 278 flow. Second operand 15 states and 426 transitions. [2025-04-14 01:00:59,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 403 transitions, 2390 flow [2025-04-14 01:00:59,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 403 transitions, 2378 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 01:00:59,396 INFO L231 Difference]: Finished difference. Result has 79 places, 115 transitions, 763 flow [2025-04-14 01:00:59,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=763, PETRI_PLACES=79, PETRI_TRANSITIONS=115} [2025-04-14 01:00:59,397 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2025-04-14 01:00:59,397 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 115 transitions, 763 flow [2025-04-14 01:00:59,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.5) internal successors, (153), 18 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:59,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:59,397 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] [2025-04-14 01:00:59,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 01:00:59,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-14 01:00:59,598 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:00:59,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash 961168910, now seen corresponding path program 1 times [2025-04-14 01:00:59,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:59,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037411582] [2025-04-14 01:00:59,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:59,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:59,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:00:59,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:00:59,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:59,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:01:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:00,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037411582] [2025-04-14 01:01:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037411582] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:00,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297035025] [2025-04-14 01:01:00,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:00,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:00,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:00,410 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 01:01:00,413 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 01:01:00,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:01:00,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:01:00,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:00,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:00,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 01:01:00,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:01:00,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:00,621 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 01:01:00,622 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 01:01:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:01:00,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297035025] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:00,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:01:00,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 4] total 12 [2025-04-14 01:01:00,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719754696] [2025-04-14 01:01:00,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:00,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:01:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:00,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:01:00,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:01:00,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2025-04-14 01:01:00,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 115 transitions, 763 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:01:00,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:00,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2025-04-14 01:01:00,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand