/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-three-array-min.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:33:43,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:33:43,582 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 01:33:43,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:33:43,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:33:43,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:33:43,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:33:43,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:33:43,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:33:43,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:33:43,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:33:43,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:33:43,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:33:43,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:33:43,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:33:43,610 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:43,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:43,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:33:43,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:33:43,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:33:43,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:33:43,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:33:43,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:33:43,611 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 01:33:43,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:33:43,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:33:43,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:33:43,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:33:43,846 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:33:43,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2025-04-14 01:33:45,141 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3126bd61c/c44fc1b475794a708d8fd0cea280e42f/FLAG277e47c8a [2025-04-14 01:33:45,358 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:33:45,359 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2025-04-14 01:33:45,365 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3126bd61c/c44fc1b475794a708d8fd0cea280e42f/FLAG277e47c8a [2025-04-14 01:33:46,291 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3126bd61c/c44fc1b475794a708d8fd0cea280e42f [2025-04-14 01:33:46,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:33:46,294 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:33:46,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:33:46,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:33:46,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:33:46,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e0ec04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46, skipping insertion in model container [2025-04-14 01:33:46,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:33:46,483 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-three-array-min.wvr.c[2854,2867] [2025-04-14 01:33:46,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:33:46,501 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:33:46,522 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-three-array-min.wvr.c[2854,2867] [2025-04-14 01:33:46,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:33:46,535 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:33:46,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46 WrapperNode [2025-04-14 01:33:46,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:33:46,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:33:46,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:33:46,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:33:46,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,573 INFO L138 Inliner]: procedures = 25, calls = 42, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 210 [2025-04-14 01:33:46,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:33:46,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:33:46,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:33:46,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:33:46,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,609 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 01:33:46,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:33:46,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:33:46,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:33:46,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:33:46,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (1/1) ... [2025-04-14 01:33:46,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:46,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:46,654 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 01:33:46,655 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 01:33:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:33:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:33:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:33:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:33:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:33:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:33:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:33:46,671 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 01:33:46,747 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:33:46,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:33:47,094 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:33:47,095 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:33:47,095 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:33:47,382 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:33:47,384 WARN L179 LargeBlockEncoding]: Complex 3:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:33:47,390 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:33:47,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:33:47 BoogieIcfgContainer [2025-04-14 01:33:47,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:33:47,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:33:47,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:33:47,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:33:47,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:33:46" (1/3) ... [2025-04-14 01:33:47,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d898522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:33:47, skipping insertion in model container [2025-04-14 01:33:47,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:46" (2/3) ... [2025-04-14 01:33:47,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d898522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:33:47, skipping insertion in model container [2025-04-14 01:33:47,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:33:47" (3/3) ... [2025-04-14 01:33:47,398 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-04-14 01:33:47,409 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:33:47,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 29 locations, 35 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 01:33:47,410 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:33:47,459 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:33:47,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 38 transitions, 97 flow [2025-04-14 01:33:47,512 INFO L116 PetriNetUnfolderBase]: 10/35 cut-off events. [2025-04-14 01:33:47,513 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:33:47,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 10/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2025-04-14 01:33:47,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 38 transitions, 97 flow [2025-04-14 01:33:47,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 34 transitions, 86 flow [2025-04-14 01:33:47,528 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:33:47,538 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;@1746efb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:33:47,538 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:33:47,553 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:33:47,553 INFO L116 PetriNetUnfolderBase]: 10/33 cut-off events. [2025-04-14 01:33:47,553 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:33:47,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:47,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:47,554 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:47,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:47,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1825209572, now seen corresponding path program 1 times [2025-04-14 01:33:47,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:47,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526254053] [2025-04-14 01:33:47,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:47,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:33:47,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:33:47,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:47,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:47,899 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:33:47,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:47,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526254053] [2025-04-14 01:33:47,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526254053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:47,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:47,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:33:47,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791972972] [2025-04-14 01:33:47,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:47,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:33:47,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:47,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:33:47,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:33:47,928 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:47,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:47,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:47,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:47,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:48,102 INFO L116 PetriNetUnfolderBase]: 531/737 cut-off events. [2025-04-14 01:33:48,102 INFO L117 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-04-14 01:33:48,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 737 events. 531/737 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2104 event pairs, 280 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 1278. Up to 713 conditions per place. [2025-04-14 01:33:48,112 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-04-14 01:33:48,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 156 flow [2025-04-14 01:33:48,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:33:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:33:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-14 01:33:48,121 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2025-04-14 01:33:48,122 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 86 flow. Second operand 3 states and 47 transitions. [2025-04-14 01:33:48,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 156 flow [2025-04-14 01:33:48,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 144 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:33:48,129 INFO L231 Difference]: Finished difference. Result has 31 places, 35 transitions, 86 flow [2025-04-14 01:33:48,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=35} [2025-04-14 01:33:48,135 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-04-14 01:33:48,135 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 35 transitions, 86 flow [2025-04-14 01:33:48,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:48,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:48,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:48,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:33:48,135 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:48,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash -318354418, now seen corresponding path program 1 times [2025-04-14 01:33:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:48,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725940494] [2025-04-14 01:33:48,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:48,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:33:48,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:33:48,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:48,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:33:48,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:48,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725940494] [2025-04-14 01:33:48,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725940494] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:48,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:48,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:33:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689079080] [2025-04-14 01:33:48,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:48,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:48,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:48,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:48,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:48,338 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:48,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 35 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:33:48,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:48,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:48,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:48,468 INFO L116 PetriNetUnfolderBase]: 531/739 cut-off events. [2025-04-14 01:33:48,469 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 01:33:48,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 739 events. 531/739 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2104 event pairs, 280 based on Foata normal form. 0/517 useless extension candidates. Maximal degree in co-relation 1468. Up to 712 conditions per place. [2025-04-14 01:33:48,474 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 30 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2025-04-14 01:33:48,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 162 flow [2025-04-14 01:33:48,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-14 01:33:48,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2025-04-14 01:33:48,476 INFO L175 Difference]: Start difference. First operand has 31 places, 35 transitions, 86 flow. Second operand 4 states and 54 transitions. [2025-04-14 01:33:48,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 162 flow [2025-04-14 01:33:48,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 158 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:48,477 INFO L231 Difference]: Finished difference. Result has 34 places, 37 transitions, 110 flow [2025-04-14 01:33:48,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=34, PETRI_TRANSITIONS=37} [2025-04-14 01:33:48,478 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-04-14 01:33:48,478 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 37 transitions, 110 flow [2025-04-14 01:33:48,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:33:48,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:48,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:48,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:33:48,478 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:48,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash 933143429, now seen corresponding path program 1 times [2025-04-14 01:33:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:48,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229124554] [2025-04-14 01:33:48,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:48,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:48,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:33:48,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:33:48,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:48,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:33:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:48,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229124554] [2025-04-14 01:33:48,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229124554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:48,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:48,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:33:48,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830876211] [2025-04-14 01:33:48,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:48,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:33:48,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:48,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:33:48,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:33:48,626 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:48,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:48,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:48,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:48,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:48,770 INFO L116 PetriNetUnfolderBase]: 788/1113 cut-off events. [2025-04-14 01:33:48,771 INFO L117 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-04-14 01:33:48,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2209 conditions, 1113 events. 788/1113 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3440 event pairs, 226 based on Foata normal form. 1/799 useless extension candidates. Maximal degree in co-relation 2189. Up to 551 conditions per place. [2025-04-14 01:33:48,776 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 47 selfloop transitions, 2 changer transitions 3/53 dead transitions. [2025-04-14 01:33:48,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 249 flow [2025-04-14 01:33:48,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:33:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:33:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-04-14 01:33:48,778 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2025-04-14 01:33:48,778 INFO L175 Difference]: Start difference. First operand has 34 places, 37 transitions, 110 flow. Second operand 3 states and 62 transitions. [2025-04-14 01:33:48,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 249 flow [2025-04-14 01:33:48,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 53 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:48,781 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 119 flow [2025-04-14 01:33:48,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2025-04-14 01:33:48,781 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-04-14 01:33:48,781 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 119 flow [2025-04-14 01:33:48,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:48,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:48,781 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] [2025-04-14 01:33:48,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:33:48,782 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:48,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:48,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1753195531, now seen corresponding path program 1 times [2025-04-14 01:33:48,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:48,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882527995] [2025-04-14 01:33:48,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:48,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:33:48,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:33:48,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:48,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:33:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:48,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882527995] [2025-04-14 01:33:48,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882527995] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:48,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:48,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:33:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484859473] [2025-04-14 01:33:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:48,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:33:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:48,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:33:48,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:33:48,858 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:48,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 119 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:33:48,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:48,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:48,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:49,016 INFO L116 PetriNetUnfolderBase]: 869/1266 cut-off events. [2025-04-14 01:33:49,016 INFO L117 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-04-14 01:33:49,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2634 conditions, 1266 events. 869/1266 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4506 event pairs, 442 based on Foata normal form. 8/946 useless extension candidates. Maximal degree in co-relation 2612. Up to 970 conditions per place. [2025-04-14 01:33:49,022 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 50 selfloop transitions, 1 changer transitions 2/54 dead transitions. [2025-04-14 01:33:49,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 270 flow [2025-04-14 01:33:49,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:33:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:33:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-14 01:33:49,023 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5350877192982456 [2025-04-14 01:33:49,023 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 119 flow. Second operand 3 states and 61 transitions. [2025-04-14 01:33:49,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 270 flow [2025-04-14 01:33:49,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:49,024 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 122 flow [2025-04-14 01:33:49,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-04-14 01:33:49,025 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2025-04-14 01:33:49,025 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 122 flow [2025-04-14 01:33:49,025 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:33:49,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:49,025 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] [2025-04-14 01:33:49,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:33:49,025 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:49,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:49,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1298437801, now seen corresponding path program 2 times [2025-04-14 01:33:49,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:49,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249295152] [2025-04-14 01:33:49,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:49,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:49,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:33:49,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 25 statements. [2025-04-14 01:33:49,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:33:49,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:33:49,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:49,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249295152] [2025-04-14 01:33:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249295152] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:49,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:33:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462447080] [2025-04-14 01:33:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:49,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:49,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:49,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:49,107 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:49,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:33:49,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:49,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:49,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:49,270 INFO L116 PetriNetUnfolderBase]: 748/1090 cut-off events. [2025-04-14 01:33:49,271 INFO L117 PetriNetUnfolderBase]: For 288/288 co-relation queries the response was YES. [2025-04-14 01:33:49,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1090 events. 748/1090 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3523 event pairs, 88 based on Foata normal form. 49/911 useless extension candidates. Maximal degree in co-relation 2243. Up to 629 conditions per place. [2025-04-14 01:33:49,278 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 53 selfloop transitions, 5 changer transitions 2/61 dead transitions. [2025-04-14 01:33:49,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 61 transitions, 297 flow [2025-04-14 01:33:49,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-04-14 01:33:49,282 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:33:49,282 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 122 flow. Second operand 4 states and 76 transitions. [2025-04-14 01:33:49,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 61 transitions, 297 flow [2025-04-14 01:33:49,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 294 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:49,284 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 149 flow [2025-04-14 01:33:49,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2025-04-14 01:33:49,284 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2025-04-14 01:33:49,284 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 149 flow [2025-04-14 01:33:49,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:33:49,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:49,284 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:33:49,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:33:49,285 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:49,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1927016704, now seen corresponding path program 1 times [2025-04-14 01:33:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:49,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648774268] [2025-04-14 01:33:49,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:49,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:49,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:33:49,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:33:49,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:49,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:49,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:49,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648774268] [2025-04-14 01:33:49,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648774268] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:49,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795577909] [2025-04-14 01:33:49,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:49,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:49,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:49,416 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:33:49,417 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:33:49,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:33:49,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:33:49,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:49,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:49,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:33:49,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:49,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:49,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795577909] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:49,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:49,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-14 01:33:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873437047] [2025-04-14 01:33:49,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:49,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:33:49,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:49,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:33:49,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:33:49,619 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:49,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 149 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:49,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:49,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:49,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:49,871 INFO L116 PetriNetUnfolderBase]: 748/1100 cut-off events. [2025-04-14 01:33:49,871 INFO L117 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2025-04-14 01:33:49,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 1100 events. 748/1100 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3425 event pairs, 403 based on Foata normal form. 20/916 useless extension candidates. Maximal degree in co-relation 2475. Up to 995 conditions per place. [2025-04-14 01:33:49,875 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 33 selfloop transitions, 9 changer transitions 23/66 dead transitions. [2025-04-14 01:33:49,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 375 flow [2025-04-14 01:33:49,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:33:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:33:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2025-04-14 01:33:49,877 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3092105263157895 [2025-04-14 01:33:49,877 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 149 flow. Second operand 8 states and 94 transitions. [2025-04-14 01:33:49,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 375 flow [2025-04-14 01:33:49,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 371 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:49,878 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 201 flow [2025-04-14 01:33:49,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-04-14 01:33:49,879 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2025-04-14 01:33:49,879 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 201 flow [2025-04-14 01:33:49,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:49,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:49,879 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:49,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:33:50,084 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,SelfDestructingSolverStorable5 [2025-04-14 01:33:50,084 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:50,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2070279823, now seen corresponding path program 2 times [2025-04-14 01:33:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:50,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497024769] [2025-04-14 01:33:50,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:50,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-14 01:33:50,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-04-14 01:33:50,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:33:50,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:33:50,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:50,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497024769] [2025-04-14 01:33:50,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497024769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:50,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:33:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059482821] [2025-04-14 01:33:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:50,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:50,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:50,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:50,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:50,159 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:50,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 201 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:33:50,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:50,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:50,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:50,367 INFO L116 PetriNetUnfolderBase]: 1199/1715 cut-off events. [2025-04-14 01:33:50,367 INFO L117 PetriNetUnfolderBase]: For 516/516 co-relation queries the response was YES. [2025-04-14 01:33:50,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 1715 events. 1199/1715 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6446 event pairs, 393 based on Foata normal form. 39/1400 useless extension candidates. Maximal degree in co-relation 4037. Up to 1001 conditions per place. [2025-04-14 01:33:50,376 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 79 selfloop transitions, 3 changer transitions 4/87 dead transitions. [2025-04-14 01:33:50,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 87 transitions, 516 flow [2025-04-14 01:33:50,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-14 01:33:50,378 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5592105263157895 [2025-04-14 01:33:50,378 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 201 flow. Second operand 4 states and 85 transitions. [2025-04-14 01:33:50,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 87 transitions, 516 flow [2025-04-14 01:33:50,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 87 transitions, 488 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-14 01:33:50,383 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 203 flow [2025-04-14 01:33:50,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-04-14 01:33:50,383 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2025-04-14 01:33:50,383 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 203 flow [2025-04-14 01:33:50,383 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:33:50,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:50,385 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:50,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:33:50,386 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:50,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:50,386 INFO L85 PathProgramCache]: Analyzing trace with hash 807180457, now seen corresponding path program 3 times [2025-04-14 01:33:50,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:50,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175389434] [2025-04-14 01:33:50,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:33:50,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:50,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-04-14 01:33:50,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-04-14 01:33:50,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:33:50,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:33:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:50,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175389434] [2025-04-14 01:33:50,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175389434] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:50,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:50,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:33:50,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832814847] [2025-04-14 01:33:50,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:50,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:33:50,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:50,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:33:50,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:33:50,490 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:50,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:33:50,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:50,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:50,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:50,802 INFO L116 PetriNetUnfolderBase]: 2220/3139 cut-off events. [2025-04-14 01:33:50,802 INFO L117 PetriNetUnfolderBase]: For 2044/2044 co-relation queries the response was YES. [2025-04-14 01:33:50,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8317 conditions, 3139 events. 2220/3139 cut-off events. For 2044/2044 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12601 event pairs, 255 based on Foata normal form. 104/2710 useless extension candidates. Maximal degree in co-relation 8283. Up to 1724 conditions per place. [2025-04-14 01:33:50,817 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 97 selfloop transitions, 12 changer transitions 1/111 dead transitions. [2025-04-14 01:33:50,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 111 transitions, 662 flow [2025-04-14 01:33:50,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:33:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:33:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-04-14 01:33:50,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2025-04-14 01:33:50,820 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 203 flow. Second operand 6 states and 112 transitions. [2025-04-14 01:33:50,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 111 transitions, 662 flow [2025-04-14 01:33:50,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 111 transitions, 644 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:50,822 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 283 flow [2025-04-14 01:33:50,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2025-04-14 01:33:50,826 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2025-04-14 01:33:50,826 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 283 flow [2025-04-14 01:33:50,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:33:50,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:50,826 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:50,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:33:50,828 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:50,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:50,828 INFO L85 PathProgramCache]: Analyzing trace with hash 881947659, now seen corresponding path program 4 times [2025-04-14 01:33:50,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:50,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979255511] [2025-04-14 01:33:50,828 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:33:50,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:50,839 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-14 01:33:50,841 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-14 01:33:50,841 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:33:50,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:33:50,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:50,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979255511] [2025-04-14 01:33:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979255511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:50,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:50,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:33:50,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843311349] [2025-04-14 01:33:50,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:50,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:50,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:50,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:50,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:50,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 283 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:33:50,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:50,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:50,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:51,142 INFO L116 PetriNetUnfolderBase]: 2027/2838 cut-off events. [2025-04-14 01:33:51,142 INFO L117 PetriNetUnfolderBase]: For 4119/4119 co-relation queries the response was YES. [2025-04-14 01:33:51,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8752 conditions, 2838 events. 2027/2838 cut-off events. For 4119/4119 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10789 event pairs, 612 based on Foata normal form. 104/2453 useless extension candidates. Maximal degree in co-relation 8715. Up to 1725 conditions per place. [2025-04-14 01:33:51,157 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 83 selfloop transitions, 13 changer transitions 1/98 dead transitions. [2025-04-14 01:33:51,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 98 transitions, 674 flow [2025-04-14 01:33:51,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-04-14 01:33:51,158 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5328947368421053 [2025-04-14 01:33:51,158 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 283 flow. Second operand 4 states and 81 transitions. [2025-04-14 01:33:51,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 98 transitions, 674 flow [2025-04-14 01:33:51,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 660 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 01:33:51,162 INFO L231 Difference]: Finished difference. Result has 57 places, 59 transitions, 347 flow [2025-04-14 01:33:51,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=57, PETRI_TRANSITIONS=59} [2025-04-14 01:33:51,163 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2025-04-14 01:33:51,163 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 347 flow [2025-04-14 01:33:51,163 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:33:51,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:51,163 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:51,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:33:51,163 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:51,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash 956925820, now seen corresponding path program 1 times [2025-04-14 01:33:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:51,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425563284] [2025-04-14 01:33:51,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:51,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:51,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:33:51,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:33:51,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:51,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:53,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:53,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425563284] [2025-04-14 01:33:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425563284] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:53,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554742361] [2025-04-14 01:33:53,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:53,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:53,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:53,496 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:33:53,498 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:33:53,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:33:53,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:33:53,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:53,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:53,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 01:33:53,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:54,038 INFO L325 Elim1Store]: treesize reduction 80, result has 60.2 percent of original size [2025-04-14 01:33:54,039 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 171