/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:40:31,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:40:31,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:40:31,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:40:31,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:40:31,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:40:31,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:40:31,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:40:31,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:40:31,603 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:40:31,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:40:31,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:40:31,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:40:31,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:40:31,604 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:40:31,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:40:31,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:40:31,604 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:40:31,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:40:31,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:40:31,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:40:31,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:40:31,606 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:40:31,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:40:31,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:40:31,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:40:31,814 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:40:31,815 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:40:31,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2025-04-13 20:40:33,110 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158916f13/74ab8976e9a946a1963da054c890fdc1/FLAGb93558046 [2025-04-13 20:40:33,346 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:40:33,347 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2025-04-13 20:40:33,354 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158916f13/74ab8976e9a946a1963da054c890fdc1/FLAGb93558046 [2025-04-13 20:40:34,110 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158916f13/74ab8976e9a946a1963da054c890fdc1 [2025-04-13 20:40:34,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:40:34,113 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:40:34,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:40:34,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:40:34,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:40:34,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b07ae19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34, skipping insertion in model container [2025-04-13 20:40:34,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:40:34,295 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-more-min-array-hom.wvr.c[2625,2638] [2025-04-13 20:40:34,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:40:34,313 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:40:34,346 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-more-min-array-hom.wvr.c[2625,2638] [2025-04-13 20:40:34,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:40:34,364 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:40:34,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34 WrapperNode [2025-04-13 20:40:34,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:40:34,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:40:34,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:40:34,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:40:34,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,395 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-04-13 20:40:34,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:40:34,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:40:34,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:40:34,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:40:34,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,423 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 20:40:34,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:40:34,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:40:34,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:40:34,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:40:34,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (1/1) ... [2025-04-13 20:40:34,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:40:34,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:34,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:40:34,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:40:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:40:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:40:34,476 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:40:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:40:34,476 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:40:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:40:34,476 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:40:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:40:34,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:40:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:40:34,478 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:40:34,557 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:40:34,558 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:40:34,757 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:40:34,758 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:40:34,758 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:40:34,934 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:40:34,937 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:40:34,939 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:40:34,942 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:40:34,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:40:34 BoogieIcfgContainer [2025-04-13 20:40:34,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:40:34,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:40:34,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:40:34,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:40:34,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:40:34" (1/3) ... [2025-04-13 20:40:34,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602babb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:40:34, skipping insertion in model container [2025-04-13 20:40:34,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:40:34" (2/3) ... [2025-04-13 20:40:34,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602babb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:40:34, skipping insertion in model container [2025-04-13 20:40:34,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:40:34" (3/3) ... [2025-04-13 20:40:34,950 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2025-04-13 20:40:34,962 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:40:34,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array-hom.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 20:40:34,965 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:40:35,010 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:40:35,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:40:35,070 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-13 20:40:35,071 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:40:35,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 7/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-13 20:40:35,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:40:35,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-13 20:40:35,079 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:40:35,087 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;@7f9e6a05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:40:35,088 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:40:35,099 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:40:35,099 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-13 20:40:35,099 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:40:35,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:35,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:35,100 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:35,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1547839771, now seen corresponding path program 1 times [2025-04-13 20:40:35,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:35,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138502102] [2025-04-13 20:40:35,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:35,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:35,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:40:35,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:40:35,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:35,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:35,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:35,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138502102] [2025-04-13 20:40:35,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138502102] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:35,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:35,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:40:35,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781229796] [2025-04-13 20:40:35,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:35,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:40:35,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:35,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:40:35,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:40:35,367 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:35,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:35,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:35,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:35,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:35,520 INFO L116 PetriNetUnfolderBase]: 511/703 cut-off events. [2025-04-13 20:40:35,520 INFO L117 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-04-13 20:40:35,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 703 events. 511/703 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1974 event pairs, 306 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 1304. Up to 701 conditions per place. [2025-04-13 20:40:35,530 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-04-13 20:40:35,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 126 flow [2025-04-13 20:40:35,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:40:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:40:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-13 20:40:35,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-13 20:40:35,543 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 3 states and 37 transitions. [2025-04-13 20:40:35,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 126 flow [2025-04-13 20:40:35,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:40:35,550 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 62 flow [2025-04-13 20:40:35,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-04-13 20:40:35,555 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2025-04-13 20:40:35,555 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 62 flow [2025-04-13 20:40:35,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:35,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:35,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:35,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:40:35,556 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:35,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1048591826, now seen corresponding path program 1 times [2025-04-13 20:40:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:35,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204720793] [2025-04-13 20:40:35,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:35,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:40:35,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:40:35,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:35,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:35,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:35,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204720793] [2025-04-13 20:40:35,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204720793] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:35,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:35,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:40:35,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279308228] [2025-04-13 20:40:35,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:35,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:40:35,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:35,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:40:35,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:40:35,633 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:35,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:35,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:35,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:35,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:35,743 INFO L116 PetriNetUnfolderBase]: 474/666 cut-off events. [2025-04-13 20:40:35,743 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 20:40:35,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 666 events. 474/666 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1869 event pairs, 306 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1347. Up to 664 conditions per place. [2025-04-13 20:40:35,746 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-04-13 20:40:35,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 112 flow [2025-04-13 20:40:35,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:40:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:40:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-13 20:40:35,747 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-13 20:40:35,747 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 62 flow. Second operand 3 states and 36 transitions. [2025-04-13 20:40:35,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 112 flow [2025-04-13 20:40:35,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 111 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:40:35,748 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 61 flow [2025-04-13 20:40:35,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2025-04-13 20:40:35,749 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-04-13 20:40:35,750 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 61 flow [2025-04-13 20:40:35,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:35,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:35,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:35,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:40:35,750 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:35,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:35,750 INFO L85 PathProgramCache]: Analyzing trace with hash 666538485, now seen corresponding path program 1 times [2025-04-13 20:40:35,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:35,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915108015] [2025-04-13 20:40:35,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:35,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:35,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:40:35,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:40:35,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:35,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:35,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:35,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915108015] [2025-04-13 20:40:35,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915108015] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:35,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:35,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:40:35,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183966924] [2025-04-13 20:40:35,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:35,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:40:35,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:35,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:40:35,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:40:35,847 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:35,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:35,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:35,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:35,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:35,933 INFO L116 PetriNetUnfolderBase]: 474/667 cut-off events. [2025-04-13 20:40:35,934 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 20:40:35,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 667 events. 474/667 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1874 event pairs, 306 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 1347. Up to 667 conditions per place. [2025-04-13 20:40:35,937 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-04-13 20:40:35,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 117 flow [2025-04-13 20:40:35,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:40:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:40:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-13 20:40:35,939 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-13 20:40:35,939 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 61 flow. Second operand 3 states and 37 transitions. [2025-04-13 20:40:35,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 117 flow [2025-04-13 20:40:35,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:40:35,940 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 72 flow [2025-04-13 20:40:35,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-04-13 20:40:35,941 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-04-13 20:40:35,941 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 72 flow [2025-04-13 20:40:35,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:35,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:35,941 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] [2025-04-13 20:40:35,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:40:35,942 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:35,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:35,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1457104603, now seen corresponding path program 1 times [2025-04-13 20:40:35,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:35,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112233670] [2025-04-13 20:40:35,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:35,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:35,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:40:35,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:35,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:35,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:36,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:36,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112233670] [2025-04-13 20:40:36,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112233670] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:36,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090342810] [2025-04-13 20:40:36,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:36,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:36,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:36,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:40:36,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:40:36,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:40:36,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:36,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:36,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:36,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:40:36,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:36,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:40:37,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 20:40:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:37,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:38,467 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2025-04-13 20:40:38,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2025-04-13 20:40:38,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2025-04-13 20:40:38,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 109 [2025-04-13 20:40:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:38,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090342810] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:38,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:38,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-04-13 20:40:38,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132054281] [2025-04-13 20:40:38,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:38,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:40:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:38,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:40:38,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:40:38,669 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:38,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 72 flow. Second operand has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 26 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:38,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:38,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:38,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:40,805 INFO L116 PetriNetUnfolderBase]: 1364/2009 cut-off events. [2025-04-13 20:40:40,805 INFO L117 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-04-13 20:40:40,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4102 conditions, 2009 events. 1364/2009 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8757 event pairs, 19 based on Foata normal form. 1/1669 useless extension candidates. Maximal degree in co-relation 4091. Up to 998 conditions per place. [2025-04-13 20:40:40,812 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 172 selfloop transitions, 120 changer transitions 1/293 dead transitions. [2025-04-13 20:40:40,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 293 transitions, 1250 flow [2025-04-13 20:40:40,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 20:40:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-13 20:40:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 421 transitions. [2025-04-13 20:40:40,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3373397435897436 [2025-04-13 20:40:40,815 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 72 flow. Second operand 39 states and 421 transitions. [2025-04-13 20:40:40,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 293 transitions, 1250 flow [2025-04-13 20:40:40,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 293 transitions, 1246 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:40:40,818 INFO L231 Difference]: Finished difference. Result has 85 places, 156 transitions, 757 flow [2025-04-13 20:40:40,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=757, PETRI_PLACES=85, PETRI_TRANSITIONS=156} [2025-04-13 20:40:40,819 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2025-04-13 20:40:40,819 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 156 transitions, 757 flow [2025-04-13 20:40:40,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 26 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:40,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:40,819 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] [2025-04-13 20:40:40,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:40:41,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:41,024 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:41,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1613284691, now seen corresponding path program 2 times [2025-04-13 20:40:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:41,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256296628] [2025-04-13 20:40:41,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:40:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:41,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:41,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:40:41,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:40:41,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:41,485 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-13 20:40:41,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:41,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256296628] [2025-04-13 20:40:41,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256296628] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:41,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:41,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:40:41,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097749655] [2025-04-13 20:40:41,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:41,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:40:41,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:41,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:40:41,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:40:41,486 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:41,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 156 transitions, 757 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:41,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:41,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:41,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:41,798 INFO L116 PetriNetUnfolderBase]: 1432/2128 cut-off events. [2025-04-13 20:40:41,799 INFO L117 PetriNetUnfolderBase]: For 5931/5931 co-relation queries the response was YES. [2025-04-13 20:40:41,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7738 conditions, 2128 events. 1432/2128 cut-off events. For 5931/5931 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9397 event pairs, 112 based on Foata normal form. 1/1951 useless extension candidates. Maximal degree in co-relation 7219. Up to 1862 conditions per place. [2025-04-13 20:40:41,811 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 54 changer transitions 1/216 dead transitions. [2025-04-13 20:40:41,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 216 transitions, 1468 flow [2025-04-13 20:40:41,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:40:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:40:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2025-04-13 20:40:41,813 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31875 [2025-04-13 20:40:41,813 INFO L175 Difference]: Start difference. First operand has 85 places, 156 transitions, 757 flow. Second operand 10 states and 102 transitions. [2025-04-13 20:40:41,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 216 transitions, 1468 flow [2025-04-13 20:40:41,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 216 transitions, 1460 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:40:41,835 INFO L231 Difference]: Finished difference. Result has 99 places, 190 transitions, 1132 flow [2025-04-13 20:40:41,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1132, PETRI_PLACES=99, PETRI_TRANSITIONS=190} [2025-04-13 20:40:41,836 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 68 predicate places. [2025-04-13 20:40:41,836 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 190 transitions, 1132 flow [2025-04-13 20:40:41,836 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:41,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:41,836 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] [2025-04-13 20:40:41,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:40:41,836 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:41,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:41,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1281555683, now seen corresponding path program 3 times [2025-04-13 20:40:41,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:41,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647782909] [2025-04-13 20:40:41,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:40:41,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:41,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:41,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:40:41,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:40:41,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:42,297 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-13 20:40:42,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:42,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647782909] [2025-04-13 20:40:42,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647782909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:42,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:42,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:40:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192837846] [2025-04-13 20:40:42,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:42,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:40:42,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:42,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:40:42,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:40:42,299 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:42,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 190 transitions, 1132 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:42,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:42,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:42,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:42,778 INFO L116 PetriNetUnfolderBase]: 1614/2406 cut-off events. [2025-04-13 20:40:42,778 INFO L117 PetriNetUnfolderBase]: For 8242/8242 co-relation queries the response was YES. [2025-04-13 20:40:42,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 2406 events. 1614/2406 cut-off events. For 8242/8242 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11026 event pairs, 105 based on Foata normal form. 1/2218 useless extension candidates. Maximal degree in co-relation 9094. Up to 2053 conditions per place. [2025-04-13 20:40:42,789 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 178 selfloop transitions, 105 changer transitions 4/287 dead transitions. [2025-04-13 20:40:42,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 287 transitions, 2276 flow [2025-04-13 20:40:42,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:40:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:40:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2025-04-13 20:40:42,790 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3385416666666667 [2025-04-13 20:40:42,790 INFO L175 Difference]: Start difference. First operand has 99 places, 190 transitions, 1132 flow. Second operand 12 states and 130 transitions. [2025-04-13 20:40:42,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 287 transitions, 2276 flow [2025-04-13 20:40:42,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 287 transitions, 2169 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-04-13 20:40:42,805 INFO L231 Difference]: Finished difference. Result has 116 places, 248 transitions, 1846 flow [2025-04-13 20:40:42,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1846, PETRI_PLACES=116, PETRI_TRANSITIONS=248} [2025-04-13 20:40:42,806 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2025-04-13 20:40:42,806 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 248 transitions, 1846 flow [2025-04-13 20:40:42,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:42,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:42,806 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] [2025-04-13 20:40:42,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:40:42,806 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:42,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:42,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2048337357, now seen corresponding path program 4 times [2025-04-13 20:40:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:42,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324161856] [2025-04-13 20:40:42,807 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:40:42,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:42,811 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:42,818 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:42,818 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:40:42,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:43,240 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-13 20:40:43,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:43,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324161856] [2025-04-13 20:40:43,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324161856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:43,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:43,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:40:43,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037302104] [2025-04-13 20:40:43,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:43,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:40:43,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:43,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:40:43,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:40:43,242 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:43,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 248 transitions, 1846 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:43,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:43,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:43,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:43,804 INFO L116 PetriNetUnfolderBase]: 1709/2553 cut-off events. [2025-04-13 20:40:43,805 INFO L117 PetriNetUnfolderBase]: For 10594/10594 co-relation queries the response was YES. [2025-04-13 20:40:43,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11232 conditions, 2553 events. 1709/2553 cut-off events. For 10594/10594 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 11757 event pairs, 175 based on Foata normal form. 1/2353 useless extension candidates. Maximal degree in co-relation 11114. Up to 2185 conditions per place. [2025-04-13 20:40:43,822 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 202 selfloop transitions, 126 changer transitions 4/332 dead transitions. [2025-04-13 20:40:43,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 332 transitions, 3061 flow [2025-04-13 20:40:43,823 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:40:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:40:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2025-04-13 20:40:43,824 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.328125 [2025-04-13 20:40:43,824 INFO L175 Difference]: Start difference. First operand has 116 places, 248 transitions, 1846 flow. Second operand 12 states and 126 transitions. [2025-04-13 20:40:43,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 332 transitions, 3061 flow [2025-04-13 20:40:43,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 332 transitions, 3010 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-04-13 20:40:43,862 INFO L231 Difference]: Finished difference. Result has 134 places, 294 transitions, 2666 flow [2025-04-13 20:40:43,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2666, PETRI_PLACES=134, PETRI_TRANSITIONS=294} [2025-04-13 20:40:43,863 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2025-04-13 20:40:43,863 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 294 transitions, 2666 flow [2025-04-13 20:40:43,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:43,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:43,863 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] [2025-04-13 20:40:43,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:40:43,863 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:43,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:43,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1621419195, now seen corresponding path program 5 times [2025-04-13 20:40:43,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:43,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192082568] [2025-04-13 20:40:43,864 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:40:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:43,871 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:43,877 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:43,877 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:43,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:44,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:44,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192082568] [2025-04-13 20:40:44,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192082568] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:44,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400307778] [2025-04-13 20:40:44,284 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:40:44,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:44,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:44,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:40:44,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:40:44,326 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:44,343 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:44,343 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:44,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:44,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:40:44,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:44,361 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:40:44,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 20:40:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:44,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:45,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2025-04-13 20:40:45,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 111 [2025-04-13 20:40:45,657 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 98 [2025-04-13 20:40:45,661 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 127 [2025-04-13 20:40:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400307778] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:45,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-04-13 20:40:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327606153] [2025-04-13 20:40:45,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:45,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:40:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:45,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:40:45,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:40:45,708 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:45,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 294 transitions, 2666 flow. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:45,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:45,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:45,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:48,007 INFO L116 PetriNetUnfolderBase]: 2122/3210 cut-off events. [2025-04-13 20:40:48,007 INFO L117 PetriNetUnfolderBase]: For 14989/14989 co-relation queries the response was YES. [2025-04-13 20:40:48,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15088 conditions, 3210 events. 2122/3210 cut-off events. For 14989/14989 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 15984 event pairs, 89 based on Foata normal form. 2/2941 useless extension candidates. Maximal degree in co-relation 14950. Up to 1735 conditions per place. [2025-04-13 20:40:48,029 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 180 selfloop transitions, 327 changer transitions 4/511 dead transitions. [2025-04-13 20:40:48,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 511 transitions, 5136 flow [2025-04-13 20:40:48,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 20:40:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-13 20:40:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 308 transitions. [2025-04-13 20:40:48,031 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30078125 [2025-04-13 20:40:48,031 INFO L175 Difference]: Start difference. First operand has 134 places, 294 transitions, 2666 flow. Second operand 32 states and 308 transitions. [2025-04-13 20:40:48,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 511 transitions, 5136 flow [2025-04-13 20:40:48,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 511 transitions, 4999 flow, removed 67 selfloop flow, removed 1 redundant places. [2025-04-13 20:40:48,088 INFO L231 Difference]: Finished difference. Result has 176 places, 426 transitions, 4691 flow [2025-04-13 20:40:48,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2549, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=4691, PETRI_PLACES=176, PETRI_TRANSITIONS=426} [2025-04-13 20:40:48,089 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2025-04-13 20:40:48,089 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 426 transitions, 4691 flow [2025-04-13 20:40:48,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:48,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:48,090 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] [2025-04-13 20:40:48,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:40:48,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-13 20:40:48,290 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:48,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1211397753, now seen corresponding path program 6 times [2025-04-13 20:40:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:48,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443080758] [2025-04-13 20:40:48,291 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:40:48,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:48,299 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:48,305 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:40:48,306 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:40:48,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:48,640 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-13 20:40:48,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:48,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443080758] [2025-04-13 20:40:48,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443080758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:48,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:48,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:40:48,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11014938] [2025-04-13 20:40:48,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:48,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:40:48,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:48,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:40:48,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:40:48,642 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:48,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 426 transitions, 4691 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:48,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:48,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:48,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:49,122 INFO L116 PetriNetUnfolderBase]: 2174/3309 cut-off events. [2025-04-13 20:40:49,122 INFO L117 PetriNetUnfolderBase]: For 18664/18664 co-relation queries the response was YES. [2025-04-13 20:40:49,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18311 conditions, 3309 events. 2174/3309 cut-off events. For 18664/18664 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16746 event pairs, 177 based on Foata normal form. 1/3045 useless extension candidates. Maximal degree in co-relation 18150. Up to 2979 conditions per place. [2025-04-13 20:40:49,148 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 344 selfloop transitions, 126 changer transitions 4/474 dead transitions. [2025-04-13 20:40:49,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 474 transitions, 5914 flow [2025-04-13 20:40:49,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:40:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:40:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2025-04-13 20:40:49,149 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34375 [2025-04-13 20:40:49,149 INFO L175 Difference]: Start difference. First operand has 176 places, 426 transitions, 4691 flow. Second operand 10 states and 110 transitions. [2025-04-13 20:40:49,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 474 transitions, 5914 flow [2025-04-13 20:40:49,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 474 transitions, 5445 flow, removed 179 selfloop flow, removed 5 redundant places. [2025-04-13 20:40:49,278 INFO L231 Difference]: Finished difference. Result has 183 places, 446 transitions, 4680 flow [2025-04-13 20:40:49,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4234, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4680, PETRI_PLACES=183, PETRI_TRANSITIONS=446} [2025-04-13 20:40:49,279 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2025-04-13 20:40:49,279 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 446 transitions, 4680 flow [2025-04-13 20:40:49,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:49,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:49,279 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] [2025-04-13 20:40:49,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:40:49,280 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:49,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:49,280 INFO L85 PathProgramCache]: Analyzing trace with hash -745350263, now seen corresponding path program 7 times [2025-04-13 20:40:49,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:49,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39578794] [2025-04-13 20:40:49,280 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:40:49,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:49,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:40:49,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:49,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:49,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:49,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:49,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39578794] [2025-04-13 20:40:49,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39578794] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:49,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710809751] [2025-04-13 20:40:49,705 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:40:49,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:49,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:49,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:40:49,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:40:49,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:40:49,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:49,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:49,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:49,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:40:49,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:49,787 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:40:49,929 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 20:40:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:49,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:51,043 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2025-04-13 20:40:51,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2025-04-13 20:40:51,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2025-04-13 20:40:51,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 109 [2025-04-13 20:40:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:51,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710809751] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:51,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:51,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2025-04-13 20:40:51,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186772890] [2025-04-13 20:40:51,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:51,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:40:51,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:51,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:40:51,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:40:51,138 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:51,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 446 transitions, 4680 flow. Second operand has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:51,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:51,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:51,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:52,806 INFO L116 PetriNetUnfolderBase]: 2494/3848 cut-off events. [2025-04-13 20:40:52,806 INFO L117 PetriNetUnfolderBase]: For 16772/16772 co-relation queries the response was YES. [2025-04-13 20:40:52,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20683 conditions, 3848 events. 2494/3848 cut-off events. For 16772/16772 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 20568 event pairs, 166 based on Foata normal form. 2/3531 useless extension candidates. Maximal degree in co-relation 20493. Up to 2233 conditions per place. [2025-04-13 20:40:52,832 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 272 selfloop transitions, 373 changer transitions 3/648 dead transitions. [2025-04-13 20:40:52,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 648 transitions, 7616 flow [2025-04-13 20:40:52,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 20:40:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 20:40:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 220 transitions. [2025-04-13 20:40:52,835 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-04-13 20:40:52,836 INFO L175 Difference]: Start difference. First operand has 183 places, 446 transitions, 4680 flow. Second operand 22 states and 220 transitions. [2025-04-13 20:40:52,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 648 transitions, 7616 flow [2025-04-13 20:40:52,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 648 transitions, 7451 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-04-13 20:40:52,971 INFO L231 Difference]: Finished difference. Result has 208 places, 570 transitions, 7067 flow [2025-04-13 20:40:52,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4532, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7067, PETRI_PLACES=208, PETRI_TRANSITIONS=570} [2025-04-13 20:40:52,973 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 177 predicate places. [2025-04-13 20:40:52,974 INFO L485 AbstractCegarLoop]: Abstraction has has 208 places, 570 transitions, 7067 flow [2025-04-13 20:40:52,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:52,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:52,974 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] [2025-04-13 20:40:52,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:40:53,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:53,175 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:53,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash -50316503, now seen corresponding path program 8 times [2025-04-13 20:40:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:53,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147538986] [2025-04-13 20:40:53,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:40:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:53,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:53,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:40:53,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:40:53,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:53,535 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-13 20:40:53,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:53,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147538986] [2025-04-13 20:40:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147538986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:53,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:53,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:40:53,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717818171] [2025-04-13 20:40:53,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:53,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:40:53,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:53,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:40:53,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:40:53,536 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:53,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 570 transitions, 7067 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:53,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:53,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:53,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:54,182 INFO L116 PetriNetUnfolderBase]: 2634/4091 cut-off events. [2025-04-13 20:40:54,183 INFO L117 PetriNetUnfolderBase]: For 23210/23210 co-relation queries the response was YES. [2025-04-13 20:40:54,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25098 conditions, 4091 events. 2634/4091 cut-off events. For 23210/23210 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 22333 event pairs, 203 based on Foata normal form. 1/3757 useless extension candidates. Maximal degree in co-relation 24879. Up to 3608 conditions per place. [2025-04-13 20:40:54,208 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 471 selfloop transitions, 166 changer transitions 8/645 dead transitions. [2025-04-13 20:40:54,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 645 transitions, 8966 flow [2025-04-13 20:40:54,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:40:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:40:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2025-04-13 20:40:54,209 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.365625 [2025-04-13 20:40:54,210 INFO L175 Difference]: Start difference. First operand has 208 places, 570 transitions, 7067 flow. Second operand 10 states and 117 transitions. [2025-04-13 20:40:54,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 645 transitions, 8966 flow [2025-04-13 20:40:54,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 645 transitions, 8602 flow, removed 145 selfloop flow, removed 5 redundant places. [2025-04-13 20:40:54,406 INFO L231 Difference]: Finished difference. Result has 215 places, 604 transitions, 7528 flow [2025-04-13 20:40:54,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6741, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7528, PETRI_PLACES=215, PETRI_TRANSITIONS=604} [2025-04-13 20:40:54,406 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 184 predicate places. [2025-04-13 20:40:54,407 INFO L485 AbstractCegarLoop]: Abstraction has has 215 places, 604 transitions, 7528 flow [2025-04-13 20:40:54,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:54,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:54,407 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] [2025-04-13 20:40:54,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:40:54,407 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:54,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:54,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1267302717, now seen corresponding path program 9 times [2025-04-13 20:40:54,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:54,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147636729] [2025-04-13 20:40:54,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:40:54,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:54,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:54,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:40:54,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:40:54,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:54,728 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-13 20:40:54,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:54,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147636729] [2025-04-13 20:40:54,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147636729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:54,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:54,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:40:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144163013] [2025-04-13 20:40:54,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:54,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:40:54,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:54,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:40:54,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:40:54,729 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:54,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 604 transitions, 7528 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:54,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:54,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:54,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:55,340 INFO L116 PetriNetUnfolderBase]: 2672/4137 cut-off events. [2025-04-13 20:40:55,340 INFO L117 PetriNetUnfolderBase]: For 25060/25060 co-relation queries the response was YES. [2025-04-13 20:40:55,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26121 conditions, 4137 events. 2672/4137 cut-off events. For 25060/25060 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 22575 event pairs, 233 based on Foata normal form. 1/3819 useless extension candidates. Maximal degree in co-relation 25890. Up to 3688 conditions per place. [2025-04-13 20:40:55,366 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 498 selfloop transitions, 155 changer transitions 5/658 dead transitions. [2025-04-13 20:40:55,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 658 transitions, 9260 flow [2025-04-13 20:40:55,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:40:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:40:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-04-13 20:40:55,369 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35625 [2025-04-13 20:40:55,369 INFO L175 Difference]: Start difference. First operand has 215 places, 604 transitions, 7528 flow. Second operand 10 states and 114 transitions. [2025-04-13 20:40:55,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 658 transitions, 9260 flow [2025-04-13 20:40:55,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 658 transitions, 9018 flow, removed 42 selfloop flow, removed 5 redundant places. [2025-04-13 20:40:55,551 INFO L231 Difference]: Finished difference. Result has 222 places, 623 transitions, 7928 flow [2025-04-13 20:40:55,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7286, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7928, PETRI_PLACES=222, PETRI_TRANSITIONS=623} [2025-04-13 20:40:55,552 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 191 predicate places. [2025-04-13 20:40:55,552 INFO L485 AbstractCegarLoop]: Abstraction has has 222 places, 623 transitions, 7928 flow [2025-04-13 20:40:55,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:55,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:55,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:55,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:40:55,552 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:55,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash 3905465, now seen corresponding path program 10 times [2025-04-13 20:40:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:55,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122831936] [2025-04-13 20:40:55,553 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:40:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:55,556 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:55,560 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:55,560 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:40:55,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:55,840 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-13 20:40:55,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:55,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122831936] [2025-04-13 20:40:55,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122831936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:55,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:55,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:40:55,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464319245] [2025-04-13 20:40:55,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:55,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:40:55,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:55,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:40:55,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:40:55,841 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:55,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 623 transitions, 7928 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:55,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:55,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:55,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:56,641 INFO L116 PetriNetUnfolderBase]: 2904/4479 cut-off events. [2025-04-13 20:40:56,641 INFO L117 PetriNetUnfolderBase]: For 28919/28919 co-relation queries the response was YES. [2025-04-13 20:40:56,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29349 conditions, 4479 events. 2904/4479 cut-off events. For 28919/28919 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 24673 event pairs, 189 based on Foata normal form. 1/4163 useless extension candidates. Maximal degree in co-relation 29108. Up to 3435 conditions per place. [2025-04-13 20:40:56,670 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 467 selfloop transitions, 298 changer transitions 4/769 dead transitions. [2025-04-13 20:40:56,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 769 transitions, 11052 flow [2025-04-13 20:40:56,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:40:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:40:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2025-04-13 20:40:56,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-13 20:40:56,671 INFO L175 Difference]: Start difference. First operand has 222 places, 623 transitions, 7928 flow. Second operand 12 states and 148 transitions. [2025-04-13 20:40:56,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 769 transitions, 11052 flow [2025-04-13 20:40:56,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 769 transitions, 10798 flow, removed 34 selfloop flow, removed 6 redundant places. [2025-04-13 20:40:56,901 INFO L231 Difference]: Finished difference. Result has 231 places, 703 transitions, 9648 flow [2025-04-13 20:40:56,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7687, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9648, PETRI_PLACES=231, PETRI_TRANSITIONS=703} [2025-04-13 20:40:56,902 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 200 predicate places. [2025-04-13 20:40:56,902 INFO L485 AbstractCegarLoop]: Abstraction has has 231 places, 703 transitions, 9648 flow [2025-04-13 20:40:56,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:56,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:56,902 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] [2025-04-13 20:40:56,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:40:56,902 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:56,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1722843817, now seen corresponding path program 11 times [2025-04-13 20:40:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:56,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229167590] [2025-04-13 20:40:56,902 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:40:56,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:56,906 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:56,911 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:56,911 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:56,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:57,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:57,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229167590] [2025-04-13 20:40:57,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229167590] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:57,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376414367] [2025-04-13 20:40:57,226 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:40:57,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:57,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:57,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:40:57,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:40:57,267 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:57,282 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:57,282 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:57,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:57,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:40:57,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:57,299 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:40:57,433 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:57,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2025-04-13 20:40:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:57,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:58,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2025-04-13 20:40:58,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 109 [2025-04-13 20:40:58,509 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2025-04-13 20:40:58,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2025-04-13 20:40:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:58,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376414367] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:58,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:58,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-04-13 20:40:58,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192295592] [2025-04-13 20:40:58,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:58,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:40:58,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:58,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:40:58,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:40:58,540 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:58,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 703 transitions, 9648 flow. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:58,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:58,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:58,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:03,255 INFO L116 PetriNetUnfolderBase]: 4664/7082 cut-off events. [2025-04-13 20:41:03,255 INFO L117 PetriNetUnfolderBase]: For 58810/58810 co-relation queries the response was YES. [2025-04-13 20:41:03,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50442 conditions, 7082 events. 4664/7082 cut-off events. For 58810/58810 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 41562 event pairs, 131 based on Foata normal form. 1/6623 useless extension candidates. Maximal degree in co-relation 50197. Up to 3150 conditions per place. [2025-04-13 20:41:03,382 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 285 selfloop transitions, 1130 changer transitions 5/1420 dead transitions. [2025-04-13 20:41:03,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 1420 transitions, 21092 flow [2025-04-13 20:41:03,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 20:41:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-04-13 20:41:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 635 transitions. [2025-04-13 20:41:03,385 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31005859375 [2025-04-13 20:41:03,385 INFO L175 Difference]: Start difference. First operand has 231 places, 703 transitions, 9648 flow. Second operand 64 states and 635 transitions. [2025-04-13 20:41:03,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 1420 transitions, 21092 flow [2025-04-13 20:41:03,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 1420 transitions, 20625 flow, removed 158 selfloop flow, removed 4 redundant places. [2025-04-13 20:41:04,005 INFO L231 Difference]: Finished difference. Result has 310 places, 1274 transitions, 20631 flow [2025-04-13 20:41:04,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9391, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=601, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=20631, PETRI_PLACES=310, PETRI_TRANSITIONS=1274} [2025-04-13 20:41:04,006 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 279 predicate places. [2025-04-13 20:41:04,006 INFO L485 AbstractCegarLoop]: Abstraction has has 310 places, 1274 transitions, 20631 flow [2025-04-13 20:41:04,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:04,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:04,007 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] [2025-04-13 20:41:04,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:41:04,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:04,207 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:04,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:04,208 INFO L85 PathProgramCache]: Analyzing trace with hash -293806475, now seen corresponding path program 12 times [2025-04-13 20:41:04,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:04,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465781170] [2025-04-13 20:41:04,208 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:41:04,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:04,212 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:41:04,219 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:41:04,219 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:41:04,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:04,557 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-13 20:41:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:04,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465781170] [2025-04-13 20:41:04,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465781170] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:04,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:04,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:41:04,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599639253] [2025-04-13 20:41:04,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:04,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:41:04,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:04,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:41:04,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:41:04,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:04,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 1274 transitions, 20631 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:04,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:04,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:04,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:06,075 INFO L116 PetriNetUnfolderBase]: 4667/7088 cut-off events. [2025-04-13 20:41:06,075 INFO L117 PetriNetUnfolderBase]: For 75924/75924 co-relation queries the response was YES. [2025-04-13 20:41:06,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58708 conditions, 7088 events. 4667/7088 cut-off events. For 75924/75924 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 41477 event pairs, 367 based on Foata normal form. 1/6649 useless extension candidates. Maximal degree in co-relation 58442. Up to 6789 conditions per place. [2025-04-13 20:41:06,144 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1140 selfloop transitions, 158 changer transitions 4/1302 dead transitions. [2025-04-13 20:41:06,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 1302 transitions, 23448 flow [2025-04-13 20:41:06,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:41:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:41:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2025-04-13 20:41:06,145 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2025-04-13 20:41:06,145 INFO L175 Difference]: Start difference. First operand has 310 places, 1274 transitions, 20631 flow. Second operand 11 states and 112 transitions. [2025-04-13 20:41:06,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 1302 transitions, 23448 flow [2025-04-13 20:41:07,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 1302 transitions, 21189 flow, removed 1036 selfloop flow, removed 9 redundant places. [2025-04-13 20:41:07,380 INFO L231 Difference]: Finished difference. Result has 315 places, 1284 transitions, 18913 flow [2025-04-13 20:41:07,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=18378, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18913, PETRI_PLACES=315, PETRI_TRANSITIONS=1284} [2025-04-13 20:41:07,381 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 284 predicate places. [2025-04-13 20:41:07,381 INFO L485 AbstractCegarLoop]: Abstraction has has 315 places, 1284 transitions, 18913 flow [2025-04-13 20:41:07,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:07,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:07,381 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] [2025-04-13 20:41:07,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:41:07,381 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:07,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:07,381 INFO L85 PathProgramCache]: Analyzing trace with hash 579934205, now seen corresponding path program 13 times [2025-04-13 20:41:07,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:07,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883056311] [2025-04-13 20:41:07,382 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:41:07,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:07,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:41:07,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:41:07,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:07,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:07,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:07,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883056311] [2025-04-13 20:41:07,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883056311] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:07,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329715820] [2025-04-13 20:41:07,853 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:41:07,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:07,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:07,857 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:07,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:41:07,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:41:07,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:41:07,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:07,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:41:07,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:07,953 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:41:08,120 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:08,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2025-04-13 20:41:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:08,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:09,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 98 [2025-04-13 20:41:09,341 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 127 [2025-04-13 20:41:09,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2025-04-13 20:41:09,397 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 111 [2025-04-13 20:41:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:09,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329715820] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:09,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:09,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-04-13 20:41:09,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718992145] [2025-04-13 20:41:09,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:09,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:41:09,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:09,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:41:09,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:41:09,483 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:09,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 1284 transitions, 18913 flow. Second operand has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 26 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:09,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:09,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:09,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:13,848 INFO L116 PetriNetUnfolderBase]: 5633/8538 cut-off events. [2025-04-13 20:41:13,848 INFO L117 PetriNetUnfolderBase]: For 64257/64257 co-relation queries the response was YES. [2025-04-13 20:41:13,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63493 conditions, 8538 events. 5633/8538 cut-off events. For 64257/64257 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 51660 event pairs, 197 based on Foata normal form. 2/8005 useless extension candidates. Maximal degree in co-relation 63231. Up to 3848 conditions per place. [2025-04-13 20:41:13,925 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 453 selfloop transitions, 1347 changer transitions 7/1807 dead transitions. [2025-04-13 20:41:13,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 1807 transitions, 29048 flow [2025-04-13 20:41:13,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 20:41:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-04-13 20:41:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 518 transitions. [2025-04-13 20:41:13,928 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3112980769230769 [2025-04-13 20:41:13,928 INFO L175 Difference]: Start difference. First operand has 315 places, 1284 transitions, 18913 flow. Second operand 52 states and 518 transitions. [2025-04-13 20:41:13,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 1807 transitions, 29048 flow [2025-04-13 20:41:14,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 1807 transitions, 28601 flow, removed 74 selfloop flow, removed 5 redundant places. [2025-04-13 20:41:14,790 INFO L231 Difference]: Finished difference. Result has 373 places, 1631 transitions, 27217 flow [2025-04-13 20:41:14,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=18572, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=27217, PETRI_PLACES=373, PETRI_TRANSITIONS=1631} [2025-04-13 20:41:14,791 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 342 predicate places. [2025-04-13 20:41:14,791 INFO L485 AbstractCegarLoop]: Abstraction has has 373 places, 1631 transitions, 27217 flow [2025-04-13 20:41:14,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 26 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:14,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:14,792 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] [2025-04-13 20:41:14,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:41:14,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 20:41:14,992 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:14,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:14,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1853586717, now seen corresponding path program 14 times [2025-04-13 20:41:14,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:14,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222795136] [2025-04-13 20:41:14,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:41:14,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:14,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:41:15,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:41:15,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:41:15,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:15,262 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-13 20:41:15,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:15,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222795136] [2025-04-13 20:41:15,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222795136] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:15,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:15,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:41:15,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91023063] [2025-04-13 20:41:15,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:15,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:41:15,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:15,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:41:15,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:41:15,264 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:15,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1631 transitions, 27217 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:15,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:15,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:15,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:17,459 INFO L116 PetriNetUnfolderBase]: 5694/8647 cut-off events. [2025-04-13 20:41:17,459 INFO L117 PetriNetUnfolderBase]: For 83310/83310 co-relation queries the response was YES. [2025-04-13 20:41:17,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71416 conditions, 8647 events. 5694/8647 cut-off events. For 83310/83310 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 52499 event pairs, 406 based on Foata normal form. 2/8112 useless extension candidates. Maximal degree in co-relation 71150. Up to 8264 conditions per place. [2025-04-13 20:41:17,532 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1530 selfloop transitions, 166 changer transitions 4/1700 dead transitions. [2025-04-13 20:41:17,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 1700 transitions, 31351 flow [2025-04-13 20:41:17,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:41:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:41:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 126 transitions. [2025-04-13 20:41:17,534 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30288461538461536 [2025-04-13 20:41:17,534 INFO L175 Difference]: Start difference. First operand has 373 places, 1631 transitions, 27217 flow. Second operand 13 states and 126 transitions. [2025-04-13 20:41:17,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 1700 transitions, 31351 flow [2025-04-13 20:41:18,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 1700 transitions, 30704 flow, removed 266 selfloop flow, removed 9 redundant places. [2025-04-13 20:41:18,974 INFO L231 Difference]: Finished difference. Result has 382 places, 1663 transitions, 27589 flow [2025-04-13 20:41:18,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=26597, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=27589, PETRI_PLACES=382, PETRI_TRANSITIONS=1663} [2025-04-13 20:41:18,976 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 351 predicate places. [2025-04-13 20:41:18,976 INFO L485 AbstractCegarLoop]: Abstraction has has 382 places, 1663 transitions, 27589 flow [2025-04-13 20:41:18,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:18,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:18,976 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] [2025-04-13 20:41:18,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:41:18,976 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:18,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:18,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1506182535, now seen corresponding path program 15 times [2025-04-13 20:41:18,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:18,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806913271] [2025-04-13 20:41:18,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:41:18,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:18,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:41:18,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:41:18,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:41:18,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:19,355 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-13 20:41:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:19,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806913271] [2025-04-13 20:41:19,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806913271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:19,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:19,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:41:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122109692] [2025-04-13 20:41:19,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:19,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:41:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:19,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:41:19,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:41:19,356 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:19,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1663 transitions, 27589 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:19,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:19,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:19,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:21,755 INFO L116 PetriNetUnfolderBase]: 5726/8693 cut-off events. [2025-04-13 20:41:21,755 INFO L117 PetriNetUnfolderBase]: For 80493/80493 co-relation queries the response was YES. [2025-04-13 20:41:21,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71708 conditions, 8693 events. 5726/8693 cut-off events. For 80493/80493 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 52943 event pairs, 416 based on Foata normal form. 2/8154 useless extension candidates. Maximal degree in co-relation 71441. Up to 8316 conditions per place. [2025-04-13 20:41:21,826 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1517 selfloop transitions, 186 changer transitions 6/1709 dead transitions. [2025-04-13 20:41:21,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 1709 transitions, 31293 flow [2025-04-13 20:41:21,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:41:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:41:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 139 transitions. [2025-04-13 20:41:21,827 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28958333333333336 [2025-04-13 20:41:21,827 INFO L175 Difference]: Start difference. First operand has 382 places, 1663 transitions, 27589 flow. Second operand 15 states and 139 transitions. [2025-04-13 20:41:21,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 1709 transitions, 31293 flow [2025-04-13 20:41:23,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 1709 transitions, 30980 flow, removed 56 selfloop flow, removed 5 redundant places. [2025-04-13 20:41:23,070 INFO L231 Difference]: Finished difference. Result has 395 places, 1679 transitions, 27897 flow [2025-04-13 20:41:23,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=27256, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=27897, PETRI_PLACES=395, PETRI_TRANSITIONS=1679} [2025-04-13 20:41:23,071 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 364 predicate places. [2025-04-13 20:41:23,071 INFO L485 AbstractCegarLoop]: Abstraction has has 395 places, 1679 transitions, 27897 flow [2025-04-13 20:41:23,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:23,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:23,071 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] [2025-04-13 20:41:23,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:41:23,071 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:23,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash 748410877, now seen corresponding path program 16 times [2025-04-13 20:41:23,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:23,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580135807] [2025-04-13 20:41:23,072 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:41:23,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:23,075 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:41:23,078 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:41:23,078 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:41:23,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:23,282 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-13 20:41:23,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:23,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580135807] [2025-04-13 20:41:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580135807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:23,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:41:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259105109] [2025-04-13 20:41:23,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:23,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:41:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:23,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:41:23,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:41:23,283 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:23,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 1679 transitions, 27897 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:23,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:23,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:23,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:25,343 INFO L116 PetriNetUnfolderBase]: 5727/8704 cut-off events. [2025-04-13 20:41:25,343 INFO L117 PetriNetUnfolderBase]: For 81660/81660 co-relation queries the response was YES. [2025-04-13 20:41:25,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72301 conditions, 8704 events. 5727/8704 cut-off events. For 81660/81660 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 53105 event pairs, 455 based on Foata normal form. 1/8228 useless extension candidates. Maximal degree in co-relation 72021. Up to 8403 conditions per place. [2025-04-13 20:41:25,434 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1565 selfloop transitions, 134 changer transitions 4/1703 dead transitions. [2025-04-13 20:41:25,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 1703 transitions, 31440 flow [2025-04-13 20:41:25,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:41:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:41:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2025-04-13 20:41:25,435 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.303125 [2025-04-13 20:41:25,435 INFO L175 Difference]: Start difference. First operand has 395 places, 1679 transitions, 27897 flow. Second operand 10 states and 97 transitions. [2025-04-13 20:41:25,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 1703 transitions, 31440 flow [2025-04-13 20:41:26,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 1703 transitions, 31176 flow, removed 60 selfloop flow, removed 7 redundant places. [2025-04-13 20:41:26,745 INFO L231 Difference]: Finished difference. Result has 399 places, 1685 transitions, 27998 flow [2025-04-13 20:41:26,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=27633, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=27998, PETRI_PLACES=399, PETRI_TRANSITIONS=1685} [2025-04-13 20:41:26,747 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 368 predicate places. [2025-04-13 20:41:26,747 INFO L485 AbstractCegarLoop]: Abstraction has has 399 places, 1685 transitions, 27998 flow [2025-04-13 20:41:26,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:26,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:26,747 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] [2025-04-13 20:41:26,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:41:26,747 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:26,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1312524225, now seen corresponding path program 17 times [2025-04-13 20:41:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:26,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537371549] [2025-04-13 20:41:26,748 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:41:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:26,752 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:41:26,755 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:41:26,755 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:26,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:27,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537371549] [2025-04-13 20:41:27,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537371549] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:27,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623108665] [2025-04-13 20:41:27,122 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:41:27,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:27,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:27,124 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:27,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:41:27,161 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:41:27,172 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:41:27,172 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:27,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:27,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:41:27,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:27,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:41:27,319 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 20:41:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:27,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:28,385 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2025-04-13 20:41:28,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 111 [2025-04-13 20:41:28,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 98 [2025-04-13 20:41:28,482 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 127 [2025-04-13 20:41:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:28,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623108665] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:28,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:28,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2025-04-13 20:41:28,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230451887] [2025-04-13 20:41:28,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:28,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:41:28,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:28,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:41:28,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:41:28,513 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:28,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 1685 transitions, 27998 flow. Second operand has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:28,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:28,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:28,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:32,106 INFO L116 PetriNetUnfolderBase]: 5814/8876 cut-off events. [2025-04-13 20:41:32,106 INFO L117 PetriNetUnfolderBase]: For 83308/83308 co-relation queries the response was YES. [2025-04-13 20:41:32,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73353 conditions, 8876 events. 5814/8876 cut-off events. For 83308/83308 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 54848 event pairs, 269 based on Foata normal form. 1/8394 useless extension candidates. Maximal degree in co-relation 73061. Up to 6229 conditions per place. [2025-04-13 20:41:32,193 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1099 selfloop transitions, 750 changer transitions 1/1850 dead transitions. [2025-04-13 20:41:32,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1850 transitions, 33164 flow [2025-04-13 20:41:32,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 20:41:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 20:41:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 294 transitions. [2025-04-13 20:41:32,194 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2963709677419355 [2025-04-13 20:41:32,194 INFO L175 Difference]: Start difference. First operand has 399 places, 1685 transitions, 27998 flow. Second operand 31 states and 294 transitions. [2025-04-13 20:41:32,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 1850 transitions, 33164 flow [2025-04-13 20:41:33,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 1850 transitions, 32946 flow, removed 27 selfloop flow, removed 5 redundant places. [2025-04-13 20:41:33,540 INFO L231 Difference]: Finished difference. Result has 428 places, 1739 transitions, 30237 flow [2025-04-13 20:41:33,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=27818, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=705, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=973, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=30237, PETRI_PLACES=428, PETRI_TRANSITIONS=1739} [2025-04-13 20:41:33,541 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 397 predicate places. [2025-04-13 20:41:33,541 INFO L485 AbstractCegarLoop]: Abstraction has has 428 places, 1739 transitions, 30237 flow [2025-04-13 20:41:33,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:33,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:33,542 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] [2025-04-13 20:41:33,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:41:33,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:33,742 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:33,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1659019609, now seen corresponding path program 18 times [2025-04-13 20:41:33,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:33,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551767076] [2025-04-13 20:41:33,743 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:41:33,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:33,748 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:41:33,753 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:41:33,753 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:41:33,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:34,305 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-13 20:41:34,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:34,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551767076] [2025-04-13 20:41:34,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551767076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:34,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:34,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:41:34,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108319972] [2025-04-13 20:41:34,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:34,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:41:34,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:34,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:41:34,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:41:34,306 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:34,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 1739 transitions, 30237 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:34,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:34,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:34,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:36,900 INFO L116 PetriNetUnfolderBase]: 5817/8888 cut-off events. [2025-04-13 20:41:36,901 INFO L117 PetriNetUnfolderBase]: For 92168/92168 co-relation queries the response was YES. [2025-04-13 20:41:36,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76807 conditions, 8888 events. 5817/8888 cut-off events. For 92168/92168 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 54955 event pairs, 436 based on Foata normal form. 1/8406 useless extension candidates. Maximal degree in co-relation 76515. Up to 8549 conditions per place. [2025-04-13 20:41:36,991 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1591 selfloop transitions, 175 changer transitions 5/1771 dead transitions. [2025-04-13 20:41:36,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1771 transitions, 33972 flow [2025-04-13 20:41:36,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:41:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:41:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2025-04-13 20:41:36,992 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28348214285714285 [2025-04-13 20:41:36,992 INFO L175 Difference]: Start difference. First operand has 428 places, 1739 transitions, 30237 flow. Second operand 14 states and 127 transitions. [2025-04-13 20:41:36,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1771 transitions, 33972 flow [2025-04-13 20:41:38,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 1771 transitions, 33124 flow, removed 104 selfloop flow, removed 12 redundant places. [2025-04-13 20:41:38,504 INFO L231 Difference]: Finished difference. Result has 431 places, 1745 transitions, 29894 flow [2025-04-13 20:41:38,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=29417, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=29894, PETRI_PLACES=431, PETRI_TRANSITIONS=1745} [2025-04-13 20:41:38,506 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 400 predicate places. [2025-04-13 20:41:38,506 INFO L485 AbstractCegarLoop]: Abstraction has has 431 places, 1745 transitions, 29894 flow [2025-04-13 20:41:38,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:38,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:38,506 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] [2025-04-13 20:41:38,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 20:41:38,506 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:38,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:38,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1358373243, now seen corresponding path program 19 times [2025-04-13 20:41:38,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:38,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637207870] [2025-04-13 20:41:38,507 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:41:38,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:38,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:41:38,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:41:38,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:38,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:39,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:39,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637207870] [2025-04-13 20:41:39,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637207870] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:39,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209356290] [2025-04-13 20:41:39,026 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:41:39,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:39,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:39,028 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:39,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:41:39,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:41:39,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:41:39,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:39,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:39,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:41:39,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:39,098 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:41:39,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 20:41:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:39,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:40,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 98 [2025-04-13 20:41:40,180 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 127 [2025-04-13 20:41:40,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2025-04-13 20:41:40,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 111 [2025-04-13 20:41:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:40,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209356290] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:40,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:40,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2025-04-13 20:41:40,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544993948] [2025-04-13 20:41:40,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:40,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:41:40,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:40,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:41:40,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:41:40,359 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:40,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 1745 transitions, 29894 flow. Second operand has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:40,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:40,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:40,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:44,351 INFO L116 PetriNetUnfolderBase]: 6509/9964 cut-off events. [2025-04-13 20:41:44,352 INFO L117 PetriNetUnfolderBase]: For 97679/97679 co-relation queries the response was YES. [2025-04-13 20:41:44,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84378 conditions, 9964 events. 6509/9964 cut-off events. For 97679/97679 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 62884 event pairs, 182 based on Foata normal form. 1/9414 useless extension candidates. Maximal degree in co-relation 84023. Up to 5125 conditions per place. [2025-04-13 20:41:44,452 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 990 selfloop transitions, 1103 changer transitions 8/2101 dead transitions. [2025-04-13 20:41:44,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 2101 transitions, 38887 flow [2025-04-13 20:41:44,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 20:41:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 20:41:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 249 transitions. [2025-04-13 20:41:44,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31125 [2025-04-13 20:41:44,453 INFO L175 Difference]: Start difference. First operand has 431 places, 1745 transitions, 29894 flow. Second operand 25 states and 249 transitions. [2025-04-13 20:41:44,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 2101 transitions, 38887 flow [2025-04-13 20:41:46,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 2101 transitions, 38534 flow, removed 20 selfloop flow, removed 10 redundant places. [2025-04-13 20:41:46,056 INFO L231 Difference]: Finished difference. Result has 454 places, 1963 transitions, 36466 flow [2025-04-13 20:41:46,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=29551, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=904, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=36466, PETRI_PLACES=454, PETRI_TRANSITIONS=1963} [2025-04-13 20:41:46,057 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 423 predicate places. [2025-04-13 20:41:46,057 INFO L485 AbstractCegarLoop]: Abstraction has has 454 places, 1963 transitions, 36466 flow [2025-04-13 20:41:46,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:46,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:46,057 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] [2025-04-13 20:41:46,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:41:46,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:46,258 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:46,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1292782407, now seen corresponding path program 20 times [2025-04-13 20:41:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:46,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077957804] [2025-04-13 20:41:46,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:41:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:46,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:41:46,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:41:46,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:41:46,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:46,698 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-13 20:41:46,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:46,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077957804] [2025-04-13 20:41:46,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077957804] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:46,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:46,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:41:46,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278424603] [2025-04-13 20:41:46,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:46,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:41:46,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:46,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:41:46,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:41:46,699 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:46,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 1963 transitions, 36466 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:46,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:46,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:46,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:50,034 INFO L116 PetriNetUnfolderBase]: 6801/10368 cut-off events. [2025-04-13 20:41:50,034 INFO L117 PetriNetUnfolderBase]: For 123776/123776 co-relation queries the response was YES. [2025-04-13 20:41:50,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97754 conditions, 10368 events. 6801/10368 cut-off events. For 123776/123776 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 65246 event pairs, 491 based on Foata normal form. 1/9798 useless extension candidates. Maximal degree in co-relation 97382. Up to 9574 conditions per place. [2025-04-13 20:41:50,142 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1719 selfloop transitions, 450 changer transitions 4/2173 dead transitions. [2025-04-13 20:41:50,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 2173 transitions, 44846 flow [2025-04-13 20:41:50,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:41:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:41:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 163 transitions. [2025-04-13 20:41:50,143 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.318359375 [2025-04-13 20:41:50,143 INFO L175 Difference]: Start difference. First operand has 454 places, 1963 transitions, 36466 flow. Second operand 16 states and 163 transitions. [2025-04-13 20:41:50,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 2173 transitions, 44846 flow [2025-04-13 20:41:52,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 2173 transitions, 43866 flow, removed 363 selfloop flow, removed 11 redundant places. [2025-04-13 20:41:52,457 INFO L231 Difference]: Finished difference. Result has 463 places, 2126 transitions, 40562 flow [2025-04-13 20:41:52,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=35672, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1963, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=40562, PETRI_PLACES=463, PETRI_TRANSITIONS=2126} [2025-04-13 20:41:52,458 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 432 predicate places. [2025-04-13 20:41:52,458 INFO L485 AbstractCegarLoop]: Abstraction has has 463 places, 2126 transitions, 40562 flow [2025-04-13 20:41:52,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:52,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:52,459 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] [2025-04-13 20:41:52,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 20:41:52,459 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:52,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:52,459 INFO L85 PathProgramCache]: Analyzing trace with hash 543117973, now seen corresponding path program 21 times [2025-04-13 20:41:52,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:52,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051355580] [2025-04-13 20:41:52,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:41:52,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:52,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:41:52,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:41:52,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:41:52,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:52,719 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-13 20:41:52,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:52,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051355580] [2025-04-13 20:41:52,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051355580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:52,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:52,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:41:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059821875] [2025-04-13 20:41:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:52,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:41:52,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:52,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:41:52,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:41:52,720 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:52,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 2126 transitions, 40562 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:52,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:52,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:52,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:56,251 INFO L116 PetriNetUnfolderBase]: 6867/10476 cut-off events. [2025-04-13 20:41:56,251 INFO L117 PetriNetUnfolderBase]: For 122585/122585 co-relation queries the response was YES. [2025-04-13 20:41:56,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99464 conditions, 10476 events. 6867/10476 cut-off events. For 122585/122585 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 66143 event pairs, 482 based on Foata normal form. 1/9887 useless extension candidates. Maximal degree in co-relation 99084. Up to 9264 conditions per place. [2025-04-13 20:41:56,374 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1593 selfloop transitions, 615 changer transitions 2/2210 dead transitions. [2025-04-13 20:41:56,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 2210 transitions, 46135 flow [2025-04-13 20:41:56,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:41:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:41:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 189 transitions. [2025-04-13 20:41:56,375 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31085526315789475 [2025-04-13 20:41:56,375 INFO L175 Difference]: Start difference. First operand has 463 places, 2126 transitions, 40562 flow. Second operand 19 states and 189 transitions. [2025-04-13 20:41:56,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 2210 transitions, 46135 flow [2025-04-13 20:41:58,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 2210 transitions, 45690 flow, removed 156 selfloop flow, removed 5 redundant places. [2025-04-13 20:41:58,799 INFO L231 Difference]: Finished difference. Result has 480 places, 2163 transitions, 42604 flow [2025-04-13 20:41:58,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=40123, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=590, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=42604, PETRI_PLACES=480, PETRI_TRANSITIONS=2163} [2025-04-13 20:41:58,800 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 449 predicate places. [2025-04-13 20:41:58,800 INFO L485 AbstractCegarLoop]: Abstraction has has 480 places, 2163 transitions, 42604 flow [2025-04-13 20:41:58,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:58,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:58,800 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] [2025-04-13 20:41:58,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 20:41:58,801 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:58,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1550215495, now seen corresponding path program 22 times [2025-04-13 20:41:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:58,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255987526] [2025-04-13 20:41:58,801 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:41:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:58,805 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:41:58,809 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:41:58,809 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:41:58,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:59,129 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-13 20:41:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:59,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255987526] [2025-04-13 20:41:59,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255987526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:59,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:41:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182316170] [2025-04-13 20:41:59,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:59,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:41:59,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:59,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:41:59,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:41:59,131 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:59,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 2163 transitions, 42604 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:59,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:59,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:59,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:02,399 INFO L116 PetriNetUnfolderBase]: 6889/10515 cut-off events. [2025-04-13 20:42:02,399 INFO L117 PetriNetUnfolderBase]: For 126909/126909 co-relation queries the response was YES. [2025-04-13 20:42:02,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101930 conditions, 10515 events. 6889/10515 cut-off events. For 126909/126909 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 66274 event pairs, 512 based on Foata normal form. 1/9924 useless extension candidates. Maximal degree in co-relation 101531. Up to 10212 conditions per place. [2025-04-13 20:42:02,508 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 2019 selfloop transitions, 163 changer transitions 4/2186 dead transitions. [2025-04-13 20:42:02,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 2186 transitions, 47146 flow [2025-04-13 20:42:02,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:42:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:42:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2025-04-13 20:42:02,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.315625 [2025-04-13 20:42:02,509 INFO L175 Difference]: Start difference. First operand has 480 places, 2163 transitions, 42604 flow. Second operand 10 states and 101 transitions. [2025-04-13 20:42:02,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 2186 transitions, 47146 flow [2025-04-13 20:42:05,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 2186 transitions, 46631 flow, removed 73 selfloop flow, removed 11 redundant places. [2025-04-13 20:42:05,065 INFO L231 Difference]: Finished difference. Result has 480 places, 2167 transitions, 42490 flow [2025-04-13 20:42:05,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=42089, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=42490, PETRI_PLACES=480, PETRI_TRANSITIONS=2167} [2025-04-13 20:42:05,067 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 449 predicate places. [2025-04-13 20:42:05,067 INFO L485 AbstractCegarLoop]: Abstraction has has 480 places, 2167 transitions, 42490 flow [2025-04-13 20:42:05,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:05,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:05,067 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] [2025-04-13 20:42:05,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 20:42:05,067 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:05,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:05,068 INFO L85 PathProgramCache]: Analyzing trace with hash 474504339, now seen corresponding path program 23 times [2025-04-13 20:42:05,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:05,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980416699] [2025-04-13 20:42:05,068 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:42:05,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:05,071 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:42:05,074 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:42:05,074 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:05,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:05,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:05,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980416699] [2025-04-13 20:42:05,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980416699] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:05,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385109207] [2025-04-13 20:42:05,371 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:42:05,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:05,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:05,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:42:05,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:42:05,412 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:42:05,426 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:42:05,426 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:42:05,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:05,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:42:05,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:05,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:42:05,572 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 20:42:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:05,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:06,812 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2025-04-13 20:42:06,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2025-04-13 20:42:06,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2025-04-13 20:42:06,844 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 109 [2025-04-13 20:42:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:06,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385109207] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:06,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:06,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2025-04-13 20:42:06,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55713696] [2025-04-13 20:42:06,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:06,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:42:06,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:06,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:42:06,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:42:06,914 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:06,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 2167 transitions, 42490 flow. Second operand has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:06,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:06,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:06,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:12,564 INFO L116 PetriNetUnfolderBase]: 7589/11584 cut-off events. [2025-04-13 20:42:12,564 INFO L117 PetriNetUnfolderBase]: For 146529/146529 co-relation queries the response was YES. [2025-04-13 20:42:12,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110884 conditions, 11584 events. 7589/11584 cut-off events. For 146529/146529 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 74430 event pairs, 321 based on Foata normal form. 1/10943 useless extension candidates. Maximal degree in co-relation 110414. Up to 7066 conditions per place. [2025-04-13 20:42:12,878 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1090 selfloop transitions, 1394 changer transitions 1/2485 dead transitions. [2025-04-13 20:42:12,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 2485 transitions, 52294 flow [2025-04-13 20:42:12,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 20:42:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 20:42:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 286 transitions. [2025-04-13 20:42:12,879 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31919642857142855 [2025-04-13 20:42:12,879 INFO L175 Difference]: Start difference. First operand has 480 places, 2167 transitions, 42490 flow. Second operand 28 states and 286 transitions. [2025-04-13 20:42:12,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 2485 transitions, 52294 flow [2025-04-13 20:42:15,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 2485 transitions, 51959 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-04-13 20:42:15,411 INFO L231 Difference]: Finished difference. Result has 511 places, 2399 transitions, 50658 flow [2025-04-13 20:42:15,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=42172, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=870, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=50658, PETRI_PLACES=511, PETRI_TRANSITIONS=2399} [2025-04-13 20:42:15,413 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 480 predicate places. [2025-04-13 20:42:15,413 INFO L485 AbstractCegarLoop]: Abstraction has has 511 places, 2399 transitions, 50658 flow [2025-04-13 20:42:15,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:15,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:15,413 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] [2025-04-13 20:42:15,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 20:42:15,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 20:42:15,614 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:15,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1654820493, now seen corresponding path program 24 times [2025-04-13 20:42:15,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:15,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566192029] [2025-04-13 20:42:15,615 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:42:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:15,618 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:42:15,622 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:42:15,622 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:42:15,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:15,889 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-13 20:42:15,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:15,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566192029] [2025-04-13 20:42:15,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566192029] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:42:15,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:42:15,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:42:15,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25088182] [2025-04-13 20:42:15,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:42:15,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:42:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:15,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:42:15,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:42:15,890 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:15,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 2399 transitions, 50658 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:15,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:15,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:15,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:20,914 INFO L116 PetriNetUnfolderBase]: 8919/13579 cut-off events. [2025-04-13 20:42:20,915 INFO L117 PetriNetUnfolderBase]: For 199867/199867 co-relation queries the response was YES. [2025-04-13 20:42:21,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142204 conditions, 13579 events. 8919/13579 cut-off events. For 199867/199867 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 88884 event pairs, 533 based on Foata normal form. 2/12861 useless extension candidates. Maximal degree in co-relation 141699. Up to 10866 conditions per place. [2025-04-13 20:42:21,071 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1918 selfloop transitions, 1036 changer transitions 4/2958 dead transitions. [2025-04-13 20:42:21,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 2958 transitions, 67591 flow [2025-04-13 20:42:21,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:42:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:42:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 214 transitions. [2025-04-13 20:42:21,072 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.334375 [2025-04-13 20:42:21,072 INFO L175 Difference]: Start difference. First operand has 511 places, 2399 transitions, 50658 flow. Second operand 20 states and 214 transitions. [2025-04-13 20:42:21,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 2958 transitions, 67591 flow [2025-04-13 20:42:25,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 2958 transitions, 66707 flow, removed 321 selfloop flow, removed 9 redundant places. [2025-04-13 20:42:25,851 INFO L231 Difference]: Finished difference. Result has 531 places, 2845 transitions, 63279 flow [2025-04-13 20:42:25,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=49954, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=629, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=63279, PETRI_PLACES=531, PETRI_TRANSITIONS=2845} [2025-04-13 20:42:25,853 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 500 predicate places. [2025-04-13 20:42:25,853 INFO L485 AbstractCegarLoop]: Abstraction has has 531 places, 2845 transitions, 63279 flow [2025-04-13 20:42:25,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:25,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:25,853 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] [2025-04-13 20:42:25,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 20:42:25,854 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:25,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1123984849, now seen corresponding path program 25 times [2025-04-13 20:42:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:25,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753879043] [2025-04-13 20:42:25,854 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:42:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:25,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:42:25,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:42:25,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:25,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:26,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:26,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753879043] [2025-04-13 20:42:26,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753879043] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:26,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138116912] [2025-04-13 20:42:26,178 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:42:26,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:26,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:26,180 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:42:26,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 20:42:26,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:42:26,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:42:26,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:26,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:26,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:42:26,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:26,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:42:26,426 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:26,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2025-04-13 20:42:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:26,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:27,623 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2025-04-13 20:42:27,629 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 109 [2025-04-13 20:42:27,703 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2025-04-13 20:42:27,706 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2025-04-13 20:42:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138116912] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:27,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:27,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-04-13 20:42:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822578081] [2025-04-13 20:42:27,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:27,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:42:27,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:27,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:42:27,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:42:27,748 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:27,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 2845 transitions, 63279 flow. Second operand has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 26 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:27,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:27,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:27,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:36,427 INFO L116 PetriNetUnfolderBase]: 10198/15541 cut-off events. [2025-04-13 20:42:36,427 INFO L117 PetriNetUnfolderBase]: For 245824/245824 co-relation queries the response was YES. [2025-04-13 20:42:36,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167945 conditions, 15541 events. 10198/15541 cut-off events. For 245824/245824 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 104995 event pairs, 175 based on Foata normal form. 11/14699 useless extension candidates. Maximal degree in co-relation 167437. Up to 7188 conditions per place. [2025-04-13 20:42:36,618 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 832 selfloop transitions, 2539 changer transitions 1/3372 dead transitions. [2025-04-13 20:42:36,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 3372 transitions, 78925 flow [2025-04-13 20:42:36,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 20:42:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-13 20:42:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 502 transitions. [2025-04-13 20:42:36,619 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3486111111111111 [2025-04-13 20:42:36,619 INFO L175 Difference]: Start difference. First operand has 531 places, 2845 transitions, 63279 flow. Second operand 45 states and 502 transitions. [2025-04-13 20:42:36,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 3372 transitions, 78925 flow [2025-04-13 20:42:43,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 3372 transitions, 77565 flow, removed 330 selfloop flow, removed 9 redundant places. [2025-04-13 20:42:43,174 INFO L231 Difference]: Finished difference. Result has 579 places, 3198 transitions, 76371 flow [2025-04-13 20:42:43,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60424, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=76371, PETRI_PLACES=579, PETRI_TRANSITIONS=3198} [2025-04-13 20:42:43,176 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 548 predicate places. [2025-04-13 20:42:43,176 INFO L485 AbstractCegarLoop]: Abstraction has has 579 places, 3198 transitions, 76371 flow [2025-04-13 20:42:43,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 26 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:43,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:43,176 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] [2025-04-13 20:42:43,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:42:43,377 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 20:42:43,377 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:43,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:43,378 INFO L85 PathProgramCache]: Analyzing trace with hash 627946645, now seen corresponding path program 26 times [2025-04-13 20:42:43,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:43,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350654551] [2025-04-13 20:42:43,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:42:43,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:43,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:42:43,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:42:43,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:42:43,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:43,654 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-13 20:42:43,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:43,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350654551] [2025-04-13 20:42:43,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350654551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:42:43,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:42:43,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:42:43,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108939346] [2025-04-13 20:42:43,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:42:43,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:42:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:43,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:42:43,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:42:43,655 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:43,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 3198 transitions, 76371 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:43,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:43,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:43,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:51,002 INFO L116 PetriNetUnfolderBase]: 10238/15621 cut-off events. [2025-04-13 20:42:51,003 INFO L117 PetriNetUnfolderBase]: For 260057/260057 co-relation queries the response was YES. [2025-04-13 20:42:51,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180957 conditions, 15621 events. 10238/15621 cut-off events. For 260057/260057 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 104200 event pairs, 659 based on Foata normal form. 2/14738 useless extension candidates. Maximal degree in co-relation 180409. Up to 15116 conditions per place. [2025-04-13 20:42:51,208 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 2894 selfloop transitions, 341 changer transitions 1/3236 dead transitions. [2025-04-13 20:42:51,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 3236 transitions, 83352 flow [2025-04-13 20:42:51,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:42:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:42:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2025-04-13 20:42:51,209 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3173076923076923 [2025-04-13 20:42:51,209 INFO L175 Difference]: Start difference. First operand has 579 places, 3198 transitions, 76371 flow. Second operand 13 states and 132 transitions. [2025-04-13 20:42:51,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 3236 transitions, 83352 flow [2025-04-13 20:42:59,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 3236 transitions, 82542 flow, removed 344 selfloop flow, removed 10 redundant places. [2025-04-13 20:42:59,100 INFO L231 Difference]: Finished difference. Result has 586 places, 3213 transitions, 76893 flow [2025-04-13 20:42:59,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=75579, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=328, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2859, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=76893, PETRI_PLACES=586, PETRI_TRANSITIONS=3213} [2025-04-13 20:42:59,103 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 555 predicate places. [2025-04-13 20:42:59,103 INFO L485 AbstractCegarLoop]: Abstraction has has 586 places, 3213 transitions, 76893 flow [2025-04-13 20:42:59,103 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:59,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:59,104 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] [2025-04-13 20:42:59,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 20:42:59,104 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:59,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash -776232139, now seen corresponding path program 27 times [2025-04-13 20:42:59,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:59,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889976313] [2025-04-13 20:42:59,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:42:59,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:59,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:42:59,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:42:59,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:42:59,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:59,429 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-13 20:42:59,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:59,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889976313] [2025-04-13 20:42:59,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889976313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:42:59,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:42:59,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:42:59,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997767106] [2025-04-13 20:42:59,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:42:59,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:42:59,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:59,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:42:59,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:42:59,430 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:59,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 3213 transitions, 76893 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:59,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:59,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:59,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:06,598 INFO L116 PetriNetUnfolderBase]: 10238/15620 cut-off events. [2025-04-13 20:43:06,599 INFO L117 PetriNetUnfolderBase]: For 252778/252778 co-relation queries the response was YES. [2025-04-13 20:43:06,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180397 conditions, 15620 events. 10238/15620 cut-off events. For 252778/252778 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 104141 event pairs, 673 based on Foata normal form. 1/14710 useless extension candidates. Maximal degree in co-relation 179858. Up to 15260 conditions per place. [2025-04-13 20:43:06,801 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 3061 selfloop transitions, 173 changer transitions 5/3239 dead transitions. [2025-04-13 20:43:06,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 3239 transitions, 83575 flow [2025-04-13 20:43:06,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:43:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:43:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2025-04-13 20:43:06,802 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3096590909090909 [2025-04-13 20:43:06,802 INFO L175 Difference]: Start difference. First operand has 586 places, 3213 transitions, 76893 flow. Second operand 11 states and 109 transitions. [2025-04-13 20:43:06,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 3239 transitions, 83575 flow [2025-04-13 20:43:13,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 3239 transitions, 83184 flow, removed 94 selfloop flow, removed 5 redundant places. [2025-04-13 20:43:13,985 INFO L231 Difference]: Finished difference. Result has 592 places, 3213 transitions, 76856 flow [2025-04-13 20:43:13,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=76476, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3039, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=76856, PETRI_PLACES=592, PETRI_TRANSITIONS=3213} [2025-04-13 20:43:13,988 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 561 predicate places. [2025-04-13 20:43:13,988 INFO L485 AbstractCegarLoop]: Abstraction has has 592 places, 3213 transitions, 76856 flow [2025-04-13 20:43:13,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:13,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:13,988 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] [2025-04-13 20:43:13,988 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 20:43:13,988 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:43:13,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2132497549, now seen corresponding path program 28 times [2025-04-13 20:43:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:13,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373568113] [2025-04-13 20:43:13,989 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:43:13,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:13,993 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:43:13,996 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:43:13,996 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:43:13,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:14,282 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-13 20:43:14,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:14,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373568113] [2025-04-13 20:43:14,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373568113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:14,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:14,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:43:14,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137333738] [2025-04-13 20:43:14,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:14,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:43:14,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:14,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:43:14,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:43:14,283 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:43:14,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 3213 transitions, 76856 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:14,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:14,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:43:14,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:21,938 INFO L116 PetriNetUnfolderBase]: 10314/15731 cut-off events. [2025-04-13 20:43:21,938 INFO L117 PetriNetUnfolderBase]: For 254869/254869 co-relation queries the response was YES. [2025-04-13 20:43:22,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181567 conditions, 15731 events. 10314/15731 cut-off events. For 254869/254869 co-relation queries the response was YES. Maximal size of possible extension queue 1280. Compared 105093 event pairs, 576 based on Foata normal form. 1/14811 useless extension candidates. Maximal degree in co-relation 181026. Up to 13538 conditions per place. [2025-04-13 20:43:22,148 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 2511 selfloop transitions, 812 changer transitions 7/3330 dead transitions. [2025-04-13 20:43:22,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 3330 transitions, 85662 flow [2025-04-13 20:43:22,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:43:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:43:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 155 transitions. [2025-04-13 20:43:22,149 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37259615384615385 [2025-04-13 20:43:22,149 INFO L175 Difference]: Start difference. First operand has 592 places, 3213 transitions, 76856 flow. Second operand 13 states and 155 transitions. [2025-04-13 20:43:22,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 3330 transitions, 85662 flow [2025-04-13 20:43:29,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 3330 transitions, 85309 flow, removed 10 selfloop flow, removed 9 redundant places. [2025-04-13 20:43:29,565 INFO L231 Difference]: Finished difference. Result has 600 places, 3275 transitions, 80826 flow [2025-04-13 20:43:29,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=76503, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=751, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=80826, PETRI_PLACES=600, PETRI_TRANSITIONS=3275} [2025-04-13 20:43:29,568 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 569 predicate places. [2025-04-13 20:43:29,568 INFO L485 AbstractCegarLoop]: Abstraction has has 600 places, 3275 transitions, 80826 flow [2025-04-13 20:43:29,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:29,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:29,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:43:29,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 20:43:29,568 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:43:29,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash -488724491, now seen corresponding path program 29 times [2025-04-13 20:43:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:29,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757225747] [2025-04-13 20:43:29,569 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:43:29,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:29,573 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:43:29,577 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:43:29,577 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:29,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:29,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:29,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757225747] [2025-04-13 20:43:29,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757225747] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:29,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754888561] [2025-04-13 20:43:29,861 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:43:29,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:29,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:29,862 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:43:29,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:43:29,905 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:43:29,918 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:43:29,918 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:29,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:29,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:43:29,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:29,928 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:43:30,068 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:30,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2025-04-13 20:43:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:30,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:30,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2025-04-13 20:43:30,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 111 [2025-04-13 20:43:31,082 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 98 [2025-04-13 20:43:31,085 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 127 [2025-04-13 20:43:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:31,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754888561] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:31,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:31,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2025-04-13 20:43:31,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652352632] [2025-04-13 20:43:31,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:31,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:43:31,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:31,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:43:31,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:43:31,131 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:43:31,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 3275 transitions, 80826 flow. Second operand has 25 states, 25 states have (on average 5.32) internal successors, (133), 25 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:31,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:31,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:43:31,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:41,275 INFO L116 PetriNetUnfolderBase]: 11212/17047 cut-off events. [2025-04-13 20:43:41,275 INFO L117 PetriNetUnfolderBase]: For 304307/304307 co-relation queries the response was YES. [2025-04-13 20:43:41,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201152 conditions, 17047 events. 11212/17047 cut-off events. For 304307/304307 co-relation queries the response was YES. Maximal size of possible extension queue 1467. Compared 115822 event pairs, 145 based on Foata normal form. 2/16047 useless extension candidates. Maximal degree in co-relation 200603. Up to 8038 conditions per place. [2025-04-13 20:43:41,536 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 526 selfloop transitions, 3172 changer transitions 2/3700 dead transitions. [2025-04-13 20:43:41,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 3700 transitions, 96404 flow [2025-04-13 20:43:41,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 20:43:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-13 20:43:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 453 transitions. [2025-04-13 20:43:41,537 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3145833333333333 [2025-04-13 20:43:41,537 INFO L175 Difference]: Start difference. First operand has 600 places, 3275 transitions, 80826 flow. Second operand 45 states and 453 transitions. [2025-04-13 20:43:41,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 3700 transitions, 96404 flow [2025-04-13 20:43:49,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 3700 transitions, 95805 flow, removed 143 selfloop flow, removed 5 redundant places. [2025-04-13 20:43:49,759 INFO L231 Difference]: Finished difference. Result has 648 places, 3593 transitions, 96070 flow [2025-04-13 20:43:49,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=80250, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2859, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=96070, PETRI_PLACES=648, PETRI_TRANSITIONS=3593} [2025-04-13 20:43:49,761 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 617 predicate places. [2025-04-13 20:43:49,761 INFO L485 AbstractCegarLoop]: Abstraction has has 648 places, 3593 transitions, 96070 flow [2025-04-13 20:43:49,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.32) internal successors, (133), 25 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:49,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:49,762 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] [2025-04-13 20:43:49,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:43:49,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 20:43:49,962 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:43:49,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1379990601, now seen corresponding path program 30 times [2025-04-13 20:43:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:49,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406452571] [2025-04-13 20:43:49,963 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:43:49,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:49,966 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:43:49,969 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:43:49,969 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:43:49,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:50,227 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-13 20:43:50,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:50,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406452571] [2025-04-13 20:43:50,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406452571] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:50,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:50,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:43:50,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388632092] [2025-04-13 20:43:50,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:50,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:43:50,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:50,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:43:50,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:43:50,228 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:43:50,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 3593 transitions, 96070 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:50,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:50,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:43:50,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:00,156 INFO L116 PetriNetUnfolderBase]: 11217/17073 cut-off events. [2025-04-13 20:44:00,157 INFO L117 PetriNetUnfolderBase]: For 358323/358323 co-relation queries the response was YES. [2025-04-13 20:44:00,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218856 conditions, 17073 events. 11217/17073 cut-off events. For 358323/358323 co-relation queries the response was YES. Maximal size of possible extension queue 1329. Compared 115302 event pairs, 757 based on Foata normal form. 1/16070 useless extension candidates. Maximal degree in co-relation 218264. Up to 15976 conditions per place. [2025-04-13 20:44:00,649 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 3068 selfloop transitions, 601 changer transitions 4/3673 dead transitions. [2025-04-13 20:44:00,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 3673 transitions, 105045 flow [2025-04-13 20:44:00,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:44:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:44:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 169 transitions. [2025-04-13 20:44:00,650 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2934027777777778 [2025-04-13 20:44:00,650 INFO L175 Difference]: Start difference. First operand has 648 places, 3593 transitions, 96070 flow. Second operand 18 states and 169 transitions. [2025-04-13 20:44:00,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 3673 transitions, 105045 flow [2025-04-13 20:44:13,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 3673 transitions, 102717 flow, removed 802 selfloop flow, removed 16 redundant places. [2025-04-13 20:44:13,617 INFO L231 Difference]: Finished difference. Result has 653 places, 3635 transitions, 96687 flow [2025-04-13 20:44:13,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=93802, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=562, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=96687, PETRI_PLACES=653, PETRI_TRANSITIONS=3635} [2025-04-13 20:44:13,620 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 622 predicate places. [2025-04-13 20:44:13,620 INFO L485 AbstractCegarLoop]: Abstraction has has 653 places, 3635 transitions, 96687 flow [2025-04-13 20:44:13,620 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:13,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:13,620 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] [2025-04-13 20:44:13,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 20:44:13,620 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:13,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash -282662087, now seen corresponding path program 31 times [2025-04-13 20:44:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:13,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209424285] [2025-04-13 20:44:13,621 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:44:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:13,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:44:13,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:44:13,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:44:13,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:13,932 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-13 20:44:13,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:13,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209424285] [2025-04-13 20:44:13,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209424285] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:44:13,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:44:13,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:44:13,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517104683] [2025-04-13 20:44:13,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:44:13,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:44:13,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:13,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:44:13,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:44:13,933 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:44:13,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 3635 transitions, 96687 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:13,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:13,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:44:13,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:23,813 INFO L116 PetriNetUnfolderBase]: 11216/17066 cut-off events. [2025-04-13 20:44:23,813 INFO L117 PetriNetUnfolderBase]: For 328644/328644 co-relation queries the response was YES. [2025-04-13 20:44:23,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215694 conditions, 17066 events. 11216/17066 cut-off events. For 328644/328644 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 115220 event pairs, 690 based on Foata normal form. 1/16051 useless extension candidates. Maximal degree in co-relation 215285. Up to 16603 conditions per place. [2025-04-13 20:44:24,064 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 3318 selfloop transitions, 336 changer transitions 4/3658 dead transitions. [2025-04-13 20:44:24,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 3658 transitions, 104137 flow [2025-04-13 20:44:24,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:44:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:44:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 124 transitions. [2025-04-13 20:44:24,065 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2980769230769231 [2025-04-13 20:44:24,065 INFO L175 Difference]: Start difference. First operand has 653 places, 3635 transitions, 96687 flow. Second operand 13 states and 124 transitions. [2025-04-13 20:44:24,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 3658 transitions, 104137 flow [2025-04-13 20:44:35,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 3658 transitions, 103612 flow, removed 43 selfloop flow, removed 11 redundant places. [2025-04-13 20:44:35,262 INFO L231 Difference]: Finished difference. Result has 658 places, 3638 transitions, 96923 flow [2025-04-13 20:44:35,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=96119, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=332, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=96923, PETRI_PLACES=658, PETRI_TRANSITIONS=3638} [2025-04-13 20:44:35,265 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 627 predicate places. [2025-04-13 20:44:35,265 INFO L485 AbstractCegarLoop]: Abstraction has has 658 places, 3638 transitions, 96923 flow [2025-04-13 20:44:35,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:35,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:35,265 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:35,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 20:44:35,265 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:35,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:35,266 INFO L85 PathProgramCache]: Analyzing trace with hash 278585241, now seen corresponding path program 32 times [2025-04-13 20:44:35,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:35,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073651485] [2025-04-13 20:44:35,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:44:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:35,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:44:35,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 20:44:35,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:44:35,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:35,528 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-13 20:44:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:35,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073651485] [2025-04-13 20:44:35,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073651485] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:44:35,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:44:35,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:44:35,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004998208] [2025-04-13 20:44:35,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:44:35,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:44:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:35,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:44:35,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:44:35,531 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:44:35,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 3638 transitions, 96923 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:35,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:35,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:44:35,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:45,390 INFO L116 PetriNetUnfolderBase]: 11480/17522 cut-off events. [2025-04-13 20:44:45,390 INFO L117 PetriNetUnfolderBase]: For 337935/337935 co-relation queries the response was YES. [2025-04-13 20:44:45,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220845 conditions, 17522 events. 11480/17522 cut-off events. For 337935/337935 co-relation queries the response was YES. Maximal size of possible extension queue 1371. Compared 119483 event pairs, 412 based on Foata normal form. 3/16482 useless extension candidates. Maximal degree in co-relation 220471. Up to 15998 conditions per place. [2025-04-13 20:44:45,692 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 3221 selfloop transitions, 632 changer transitions 9/3862 dead transitions. [2025-04-13 20:44:45,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 3862 transitions, 109849 flow [2025-04-13 20:44:45,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:44:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:44:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-04-13 20:44:45,693 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.390625 [2025-04-13 20:44:45,693 INFO L175 Difference]: Start difference. First operand has 658 places, 3638 transitions, 96923 flow. Second operand 10 states and 125 transitions. [2025-04-13 20:44:45,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 3862 transitions, 109849 flow [2025-04-13 20:44:58,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 3862 transitions, 109263 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-04-13 20:44:58,081 INFO L231 Difference]: Finished difference. Result has 663 places, 3804 transitions, 102684 flow [2025-04-13 20:44:58,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=96337, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=488, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3043, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=102684, PETRI_PLACES=663, PETRI_TRANSITIONS=3804} [2025-04-13 20:44:58,084 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 632 predicate places. [2025-04-13 20:44:58,084 INFO L485 AbstractCegarLoop]: Abstraction has has 663 places, 3804 transitions, 102684 flow [2025-04-13 20:44:58,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:58,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:58,085 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:58,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 20:44:58,085 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:58,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash -366605669, now seen corresponding path program 33 times [2025-04-13 20:44:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:58,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666473515] [2025-04-13 20:44:58,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:44:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:58,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:44:58,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 20:44:58,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:44:58,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:58,427 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-13 20:44:58,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:58,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666473515] [2025-04-13 20:44:58,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666473515] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:44:58,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:44:58,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:44:58,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701520407] [2025-04-13 20:44:58,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:44:58,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:44:58,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:58,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:44:58,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:44:58,429 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:44:58,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 3804 transitions, 102684 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:58,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:58,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:44:58,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:10,115 INFO L116 PetriNetUnfolderBase]: 11524/17585 cut-off events. [2025-04-13 20:45:10,115 INFO L117 PetriNetUnfolderBase]: For 354578/354578 co-relation queries the response was YES. [2025-04-13 20:45:10,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224461 conditions, 17585 events. 11524/17585 cut-off events. For 354578/354578 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 121332 event pairs, 666 based on Foata normal form. 3/16689 useless extension candidates. Maximal degree in co-relation 224149. Up to 16617 conditions per place. [2025-04-13 20:45:10,464 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 3405 selfloop transitions, 504 changer transitions 9/3918 dead transitions. [2025-04-13 20:45:10,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 3918 transitions, 113089 flow [2025-04-13 20:45:10,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:45:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:45:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2025-04-13 20:45:10,465 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-13 20:45:10,465 INFO L175 Difference]: Start difference. First operand has 663 places, 3804 transitions, 102684 flow. Second operand 10 states and 120 transitions. [2025-04-13 20:45:10,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 3918 transitions, 113089 flow [2025-04-13 20:45:22,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 669 places, 3918 transitions, 112846 flow, removed 42 selfloop flow, removed 3 redundant places. [2025-04-13 20:45:22,516 INFO L231 Difference]: Finished difference. Result has 673 places, 3879 transitions, 106068 flow [2025-04-13 20:45:22,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=102445, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=430, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=106068, PETRI_PLACES=673, PETRI_TRANSITIONS=3879} [2025-04-13 20:45:22,519 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 642 predicate places. [2025-04-13 20:45:22,519 INFO L485 AbstractCegarLoop]: Abstraction has has 673 places, 3879 transitions, 106068 flow [2025-04-13 20:45:22,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:22,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:22,519 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:22,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 20:45:22,520 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:22,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:22,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1407146599, now seen corresponding path program 34 times [2025-04-13 20:45:22,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:22,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446448212] [2025-04-13 20:45:22,520 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:22,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:22,524 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:22,527 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:22,527 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:45:22,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:22,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:22,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446448212] [2025-04-13 20:45:22,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446448212] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:22,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532558693] [2025-04-13 20:45:22,552 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:22,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:22,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:22,554 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:22,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:45:22,596 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:22,613 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:22,613 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:45:22,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:22,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:45:22,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:22,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:22,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532558693] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:22,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:45:22,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-04-13 20:45:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533184254] [2025-04-13 20:45:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:22,690 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:45:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:22,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:45:22,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:45:22,691 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:22,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 3879 transitions, 106068 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:22,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:22,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:22,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:34,223 INFO L116 PetriNetUnfolderBase]: 13630/20571 cut-off events. [2025-04-13 20:45:34,223 INFO L117 PetriNetUnfolderBase]: For 440607/440607 co-relation queries the response was YES. [2025-04-13 20:45:34,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260035 conditions, 20571 events. 13630/20571 cut-off events. For 440607/440607 co-relation queries the response was YES. Maximal size of possible extension queue 1477. Compared 140029 event pairs, 3071 based on Foata normal form. 322/19946 useless extension candidates. Maximal degree in co-relation 259612. Up to 10879 conditions per place. [2025-04-13 20:45:34,585 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 4338 selfloop transitions, 253 changer transitions 4/4595 dead transitions. [2025-04-13 20:45:34,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 4595 transitions, 130657 flow [2025-04-13 20:45:34,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:45:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:45:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-04-13 20:45:34,586 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-04-13 20:45:34,586 INFO L175 Difference]: Start difference. First operand has 673 places, 3879 transitions, 106068 flow. Second operand 6 states and 87 transitions. [2025-04-13 20:45:34,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 4595 transitions, 130657 flow [2025-04-13 20:45:49,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 4595 transitions, 129544 flow, removed 169 selfloop flow, removed 10 redundant places. [2025-04-13 20:45:50,028 INFO L231 Difference]: Finished difference. Result has 668 places, 3574 transitions, 96354 flow [2025-04-13 20:45:50,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=93135, PETRI_DIFFERENCE_MINUEND_PLACES=661, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96354, PETRI_PLACES=668, PETRI_TRANSITIONS=3574} [2025-04-13 20:45:50,031 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 637 predicate places. [2025-04-13 20:45:50,031 INFO L485 AbstractCegarLoop]: Abstraction has has 668 places, 3574 transitions, 96354 flow [2025-04-13 20:45:50,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:50,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:50,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:50,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 20:45:50,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 20:45:50,232 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:50,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:50,233 INFO L85 PathProgramCache]: Analyzing trace with hash -540109826, now seen corresponding path program 1 times [2025-04-13 20:45:50,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:50,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65592246] [2025-04-13 20:45:50,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:50,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:50,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:45:50,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:50,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:50,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:50,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:50,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65592246] [2025-04-13 20:45:50,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65592246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:50,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271449055] [2025-04-13 20:45:50,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:50,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:50,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:50,264 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:50,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 20:45:50,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:45:50,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:50,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:50,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:50,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:45:50,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:50,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:50,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271449055] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:50,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:50,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-13 20:45:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842997841] [2025-04-13 20:45:50,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:50,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:45:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:50,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:45:50,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:45:50,358 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:50,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 3574 transitions, 96354 flow. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-13 20:45:50,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:50,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:50,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:58,220 INFO L116 PetriNetUnfolderBase]: 8888/13686 cut-off events. [2025-04-13 20:45:58,220 INFO L117 PetriNetUnfolderBase]: For 322100/322100 co-relation queries the response was YES. [2025-04-13 20:45:58,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169173 conditions, 13686 events. 8888/13686 cut-off events. For 322100/322100 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 90787 event pairs, 2070 based on Foata normal form. 287/13426 useless extension candidates. Maximal degree in co-relation 168794. Up to 7712 conditions per place. [2025-04-13 20:45:58,413 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 3109 selfloop transitions, 52 changer transitions 13/3174 dead transitions. [2025-04-13 20:45:58,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 3174 transitions, 88665 flow [2025-04-13 20:45:58,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:45:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:45:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-04-13 20:45:58,414 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-04-13 20:45:58,414 INFO L175 Difference]: Start difference. First operand has 668 places, 3574 transitions, 96354 flow. Second operand 6 states and 82 transitions. [2025-04-13 20:45:58,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 3174 transitions, 88665 flow [2025-04-13 20:46:05,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 3174 transitions, 86446 flow, removed 552 selfloop flow, removed 30 redundant places. [2025-04-13 20:46:05,768 INFO L231 Difference]: Finished difference. Result has 613 places, 2782 transitions, 71756 flow [2025-04-13 20:46:05,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70924, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71756, PETRI_PLACES=613, PETRI_TRANSITIONS=2782} [2025-04-13 20:46:05,770 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 582 predicate places. [2025-04-13 20:46:05,770 INFO L485 AbstractCegarLoop]: Abstraction has has 613 places, 2782 transitions, 71756 flow [2025-04-13 20:46:05,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-13 20:46:05,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:05,770 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:05,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 20:46:05,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 20:46:05,971 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:05,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash -769495564, now seen corresponding path program 1 times [2025-04-13 20:46:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:05,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330230847] [2025-04-13 20:46:05,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:46:05,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:05,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:46:05,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:05,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:05,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:06,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:06,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330230847] [2025-04-13 20:46:06,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330230847] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:06,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76130140] [2025-04-13 20:46:06,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:46:06,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:06,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:06,014 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:06,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:46:06,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:46:06,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:06,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:06,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:06,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:46:06,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:06,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:06,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76130140] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:06,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:06,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:46:06,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708767595] [2025-04-13 20:46:06,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:06,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:46:06,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:06,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:46:06,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:46:06,172 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:46:06,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 2782 transitions, 71756 flow. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:06,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:06,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:46:06,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:11,862 INFO L116 PetriNetUnfolderBase]: 7667/11879 cut-off events. [2025-04-13 20:46:11,863 INFO L117 PetriNetUnfolderBase]: For 260408/260408 co-relation queries the response was YES. [2025-04-13 20:46:11,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145886 conditions, 11879 events. 7667/11879 cut-off events. For 260408/260408 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 77481 event pairs, 1995 based on Foata normal form. 274/11738 useless extension candidates. Maximal degree in co-relation 145614. Up to 9827 conditions per place. [2025-04-13 20:46:12,027 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2613 selfloop transitions, 100 changer transitions 98/2811 dead transitions. [2025-04-13 20:46:12,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 2811 transitions, 77943 flow [2025-04-13 20:46:12,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:46:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:46:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2025-04-13 20:46:12,028 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-13 20:46:12,028 INFO L175 Difference]: Start difference. First operand has 613 places, 2782 transitions, 71756 flow. Second operand 6 states and 74 transitions. [2025-04-13 20:46:12,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 2811 transitions, 77943 flow [2025-04-13 20:46:17,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 2811 transitions, 77447 flow, removed 96 selfloop flow, removed 14 redundant places. [2025-04-13 20:46:17,269 INFO L231 Difference]: Finished difference. Result has 599 places, 2602 transitions, 67888 flow [2025-04-13 20:46:17,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=68326, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=67888, PETRI_PLACES=599, PETRI_TRANSITIONS=2602} [2025-04-13 20:46:17,271 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 568 predicate places. [2025-04-13 20:46:17,271 INFO L485 AbstractCegarLoop]: Abstraction has has 599 places, 2602 transitions, 67888 flow [2025-04-13 20:46:17,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:17,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:17,272 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:17,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 20:46:17,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 20:46:17,472 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:17,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:17,473 INFO L85 PathProgramCache]: Analyzing trace with hash 487893442, now seen corresponding path program 1 times [2025-04-13 20:46:17,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:17,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590440363] [2025-04-13 20:46:17,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:46:17,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:17,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:46:17,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:17,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:17,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:17,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:17,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590440363] [2025-04-13 20:46:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590440363] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:17,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41858154] [2025-04-13 20:46:17,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:46:17,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:17,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:17,507 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:17,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:46:17,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:46:17,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:17,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:17,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:17,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:17,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:17,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:17,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41858154] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:17,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:17,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:46:17,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468991529] [2025-04-13 20:46:17,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:17,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:46:17,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:17,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:46:17,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:46:17,623 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:46:17,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 2602 transitions, 67888 flow. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:17,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:17,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:46:17,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:22,211 INFO L116 PetriNetUnfolderBase]: 6912/10422 cut-off events. [2025-04-13 20:46:22,212 INFO L117 PetriNetUnfolderBase]: For 218024/218024 co-relation queries the response was YES. [2025-04-13 20:46:22,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132508 conditions, 10422 events. 6912/10422 cut-off events. For 218024/218024 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 63399 event pairs, 1746 based on Foata normal form. 188/10301 useless extension candidates. Maximal degree in co-relation 132190. Up to 9827 conditions per place. [2025-04-13 20:46:22,404 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 2299 selfloop transitions, 3 changer transitions 192/2494 dead transitions. [2025-04-13 20:46:22,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 2494 transitions, 70516 flow [2025-04-13 20:46:22,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:46:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:46:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-04-13 20:46:22,405 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.359375 [2025-04-13 20:46:22,405 INFO L175 Difference]: Start difference. First operand has 599 places, 2602 transitions, 67888 flow. Second operand 6 states and 69 transitions. [2025-04-13 20:46:22,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 2494 transitions, 70516 flow [2025-04-13 20:46:26,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 2494 transitions, 69656 flow, removed 161 selfloop flow, removed 19 redundant places. [2025-04-13 20:46:26,923 INFO L231 Difference]: Finished difference. Result has 573 places, 2302 transitions, 59378 flow [2025-04-13 20:46:26,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=63937, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=59378, PETRI_PLACES=573, PETRI_TRANSITIONS=2302} [2025-04-13 20:46:26,924 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 542 predicate places. [2025-04-13 20:46:26,924 INFO L485 AbstractCegarLoop]: Abstraction has has 573 places, 2302 transitions, 59378 flow [2025-04-13 20:46:26,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:26,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:26,924 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:26,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 20:46:27,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:27,125 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:27,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:27,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1957440060, now seen corresponding path program 2 times [2025-04-13 20:46:27,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:27,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189153819] [2025-04-13 20:46:27,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:27,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:27,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:27,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:27,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:27,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:27,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:27,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189153819] [2025-04-13 20:46:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189153819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:27,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267641566] [2025-04-13 20:46:27,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:27,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:27,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:27,160 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:27,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 20:46:27,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:27,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:27,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:27,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:27,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:27,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:27,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:27,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267641566] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:27,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:46:27,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:46:27,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240053331] [2025-04-13 20:46:27,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:27,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:46:27,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:27,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:46:27,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:46:27,292 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:46:27,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 2302 transitions, 59378 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:27,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:27,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:46:27,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:30,762 INFO L116 PetriNetUnfolderBase]: 6622/9693 cut-off events. [2025-04-13 20:46:30,763 INFO L117 PetriNetUnfolderBase]: For 193423/193423 co-relation queries the response was YES. [2025-04-13 20:46:30,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122139 conditions, 9693 events. 6622/9693 cut-off events. For 193423/193423 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 55160 event pairs, 1279 based on Foata normal form. 54/9444 useless extension candidates. Maximal degree in co-relation 121973. Up to 7711 conditions per place. [2025-04-13 20:46:30,890 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2213 selfloop transitions, 88 changer transitions 0/2301 dead transitions. [2025-04-13 20:46:30,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 2301 transitions, 63493 flow [2025-04-13 20:46:30,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:46:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:46:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-04-13 20:46:30,891 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2025-04-13 20:46:30,891 INFO L175 Difference]: Start difference. First operand has 573 places, 2302 transitions, 59378 flow. Second operand 7 states and 74 transitions. [2025-04-13 20:46:30,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 2301 transitions, 63493 flow [2025-04-13 20:46:34,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 2301 transitions, 61747 flow, removed 307 selfloop flow, removed 29 redundant places. [2025-04-13 20:46:34,504 INFO L231 Difference]: Finished difference. Result has 512 places, 2250 transitions, 56685 flow [2025-04-13 20:46:34,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=56333, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=56685, PETRI_PLACES=512, PETRI_TRANSITIONS=2250} [2025-04-13 20:46:34,505 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 481 predicate places. [2025-04-13 20:46:34,506 INFO L485 AbstractCegarLoop]: Abstraction has has 512 places, 2250 transitions, 56685 flow [2025-04-13 20:46:34,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:34,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:34,506 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:34,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 20:46:34,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:34,706 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:34,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:34,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2117937042, now seen corresponding path program 3 times [2025-04-13 20:46:34,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:34,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747691662] [2025-04-13 20:46:34,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:46:34,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:34,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:34,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:34,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:46:34,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:34,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:34,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747691662] [2025-04-13 20:46:34,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747691662] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:34,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079651039] [2025-04-13 20:46:34,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:46:34,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:34,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:34,741 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:34,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 20:46:34,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:34,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:34,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:46:34,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:34,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:34,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:34,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:34,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079651039] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:34,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:46:34,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:46:34,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72139730] [2025-04-13 20:46:34,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:34,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:46:34,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:34,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:46:34,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:46:34,866 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:46:34,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 2250 transitions, 56685 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:34,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:34,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:46:34,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:38,012 INFO L116 PetriNetUnfolderBase]: 6650/9728 cut-off events. [2025-04-13 20:46:38,012 INFO L117 PetriNetUnfolderBase]: For 180321/180321 co-relation queries the response was YES. [2025-04-13 20:46:38,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118436 conditions, 9728 events. 6650/9728 cut-off events. For 180321/180321 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 55172 event pairs, 602 based on Foata normal form. 57/9414 useless extension candidates. Maximal degree in co-relation 118286. Up to 7650 conditions per place. [2025-04-13 20:46:38,138 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 2086 selfloop transitions, 243 changer transitions 0/2329 dead transitions. [2025-04-13 20:46:38,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 2329 transitions, 63006 flow [2025-04-13 20:46:38,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:46:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:46:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2025-04-13 20:46:38,139 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2025-04-13 20:46:38,139 INFO L175 Difference]: Start difference. First operand has 512 places, 2250 transitions, 56685 flow. Second operand 7 states and 78 transitions. [2025-04-13 20:46:38,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 2329 transitions, 63006 flow [2025-04-13 20:46:41,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 2329 transitions, 62911 flow, removed 19 selfloop flow, removed 8 redundant places. [2025-04-13 20:46:41,190 INFO L231 Difference]: Finished difference. Result has 507 places, 2257 transitions, 57976 flow [2025-04-13 20:46:41,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=56166, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=57976, PETRI_PLACES=507, PETRI_TRANSITIONS=2257} [2025-04-13 20:46:41,192 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 476 predicate places. [2025-04-13 20:46:41,192 INFO L485 AbstractCegarLoop]: Abstraction has has 507 places, 2257 transitions, 57976 flow [2025-04-13 20:46:41,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:41,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:41,192 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:41,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 20:46:41,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:41,393 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:41,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2138775832, now seen corresponding path program 4 times [2025-04-13 20:46:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:41,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279968486] [2025-04-13 20:46:41,393 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:46:41,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:41,398 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:41,399 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 20:46:41,399 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:46:41,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:41,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:41,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279968486] [2025-04-13 20:46:41,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279968486] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:41,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140663115] [2025-04-13 20:46:41,421 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:46:41,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:41,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:41,423 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:41,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 20:46:41,466 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:41,473 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 20:46:41,473 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:46:41,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:41,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:46:41,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:41,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:41,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:41,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140663115] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:41,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:41,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-13 20:46:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737833914] [2025-04-13 20:46:41,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:41,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:46:41,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:41,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:46:41,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:46:41,515 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:46:41,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 2257 transitions, 57976 flow. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:41,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:41,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:46:41,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:45,573 INFO L116 PetriNetUnfolderBase]: 7782/11320 cut-off events. [2025-04-13 20:46:45,573 INFO L117 PetriNetUnfolderBase]: For 215868/215868 co-relation queries the response was YES. [2025-04-13 20:46:45,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136406 conditions, 11320 events. 7782/11320 cut-off events. For 215868/215868 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 65566 event pairs, 167 based on Foata normal form. 12/10874 useless extension candidates. Maximal degree in co-relation 136256. Up to 5604 conditions per place. [2025-04-13 20:46:45,714 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 2479 selfloop transitions, 672 changer transitions 0/3151 dead transitions. [2025-04-13 20:46:45,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 3151 transitions, 84525 flow [2025-04-13 20:46:45,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:46:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:46:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 197 transitions. [2025-04-13 20:46:45,715 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4735576923076923 [2025-04-13 20:46:45,715 INFO L175 Difference]: Start difference. First operand has 507 places, 2257 transitions, 57976 flow. Second operand 13 states and 197 transitions. [2025-04-13 20:46:45,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 3151 transitions, 84525 flow [2025-04-13 20:46:49,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 3151 transitions, 84432 flow, removed 44 selfloop flow, removed 3 redundant places. [2025-04-13 20:46:49,519 INFO L231 Difference]: Finished difference. Result has 525 places, 2476 transitions, 65390 flow [2025-04-13 20:46:49,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=57941, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=471, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=65390, PETRI_PLACES=525, PETRI_TRANSITIONS=2476} [2025-04-13 20:46:49,521 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 494 predicate places. [2025-04-13 20:46:49,521 INFO L485 AbstractCegarLoop]: Abstraction has has 525 places, 2476 transitions, 65390 flow [2025-04-13 20:46:49,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:49,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:49,521 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:49,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 20:46:49,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:49,722 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:49,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2064313078, now seen corresponding path program 5 times [2025-04-13 20:46:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:49,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624353394] [2025-04-13 20:46:49,722 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:49,727 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:49,729 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:49,729 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:49,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:49,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:49,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624353394] [2025-04-13 20:46:49,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624353394] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:49,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919931184] [2025-04-13 20:46:49,762 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:49,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:49,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:49,764 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:49,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 20:46:49,808 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:49,824 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:49,824 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:49,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:49,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:46:49,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:49,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919931184] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:49,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:49,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 20:46:49,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353654161] [2025-04-13 20:46:49,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:49,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:46:49,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:49,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:46:49,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:46:49,903 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:46:49,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 2476 transitions, 65390 flow. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:49,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:49,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:46:49,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:55,186 INFO L116 PetriNetUnfolderBase]: 9178/13250 cut-off events. [2025-04-13 20:46:55,187 INFO L117 PetriNetUnfolderBase]: For 297910/297910 co-relation queries the response was YES. [2025-04-13 20:46:55,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157585 conditions, 13250 events. 9178/13250 cut-off events. For 297910/297910 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 76371 event pairs, 227 based on Foata normal form. 122/13084 useless extension candidates. Maximal degree in co-relation 157426. Up to 6745 conditions per place. [2025-04-13 20:46:55,355 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 2380 selfloop transitions, 825 changer transitions 0/3205 dead transitions. [2025-04-13 20:46:55,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 3205 transitions, 88213 flow [2025-04-13 20:46:55,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:46:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:46:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 197 transitions. [2025-04-13 20:46:55,356 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.384765625 [2025-04-13 20:46:55,356 INFO L175 Difference]: Start difference. First operand has 525 places, 2476 transitions, 65390 flow. Second operand 16 states and 197 transitions. [2025-04-13 20:46:55,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 3205 transitions, 88213 flow [2025-04-13 20:47:00,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 3205 transitions, 87375 flow, removed 265 selfloop flow, removed 8 redundant places. [2025-04-13 20:47:01,043 INFO L231 Difference]: Finished difference. Result has 526 places, 2533 transitions, 68555 flow [2025-04-13 20:47:01,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62622, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=693, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=68555, PETRI_PLACES=526, PETRI_TRANSITIONS=2533} [2025-04-13 20:47:01,045 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 495 predicate places. [2025-04-13 20:47:01,045 INFO L485 AbstractCegarLoop]: Abstraction has has 526 places, 2533 transitions, 68555 flow [2025-04-13 20:47:01,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:01,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:01,045 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:47:01,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 20:47:01,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:01,246 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:47:01,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1240495483, now seen corresponding path program 1 times [2025-04-13 20:47:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:01,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037608286] [2025-04-13 20:47:01,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:47:01,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:01,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:47:01,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:47:01,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:47:01,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:02,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:02,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037608286] [2025-04-13 20:47:02,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037608286] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:47:02,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989651758] [2025-04-13 20:47:02,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:47:02,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:02,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:02,612 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:47:02,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 20:47:02,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:47:02,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:47:02,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:47:02,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:02,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:47:02,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:47:02,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 20:47:03,240 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:03,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 80 [2025-04-13 20:47:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:03,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:07,868 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 176 [2025-04-13 20:47:07,873 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:07,873 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 224 [2025-04-13 20:47:08,012 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 320 [2025-04-13 20:47:08,018 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:08,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 431 treesize of output 367 [2025-04-13 20:47:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:47:08,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989651758] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:47:08,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:47:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 37 [2025-04-13 20:47:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555087458] [2025-04-13 20:47:08,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:47:08,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:47:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:08,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:47:08,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:47:08,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:47:08,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 2533 transitions, 68555 flow. Second operand has 39 states, 39 states have (on average 4.871794871794871) internal successors, (190), 39 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:08,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:08,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:47:08,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:18,703 INFO L116 PetriNetUnfolderBase]: 10265/14881 cut-off events. [2025-04-13 20:47:18,704 INFO L117 PetriNetUnfolderBase]: For 330162/330162 co-relation queries the response was YES. [2025-04-13 20:47:18,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175926 conditions, 14881 events. 10265/14881 cut-off events. For 330162/330162 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 88194 event pairs, 605 based on Foata normal form. 3/14528 useless extension candidates. Maximal degree in co-relation 175768. Up to 13118 conditions per place. [2025-04-13 20:47:18,883 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 2412 selfloop transitions, 539 changer transitions 6/2957 dead transitions. [2025-04-13 20:47:18,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 2957 transitions, 82247 flow [2025-04-13 20:47:18,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 20:47:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-13 20:47:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 377 transitions. [2025-04-13 20:47:18,884 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31841216216216217 [2025-04-13 20:47:18,885 INFO L175 Difference]: Start difference. First operand has 526 places, 2533 transitions, 68555 flow. Second operand 37 states and 377 transitions. [2025-04-13 20:47:18,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 2957 transitions, 82247 flow [2025-04-13 20:47:25,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 2957 transitions, 81731 flow, removed 224 selfloop flow, removed 8 redundant places. [2025-04-13 20:47:25,106 INFO L231 Difference]: Finished difference. Result has 570 places, 2771 transitions, 74984 flow [2025-04-13 20:47:25,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=68168, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=74984, PETRI_PLACES=570, PETRI_TRANSITIONS=2771} [2025-04-13 20:47:25,107 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 539 predicate places. [2025-04-13 20:47:25,108 INFO L485 AbstractCegarLoop]: Abstraction has has 570 places, 2771 transitions, 74984 flow [2025-04-13 20:47:25,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.871794871794871) internal successors, (190), 39 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:25,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:25,108 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:47:25,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 20:47:25,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:25,309 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:47:25,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1520497967, now seen corresponding path program 2 times [2025-04-13 20:47:25,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:25,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078002635] [2025-04-13 20:47:25,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:47:25,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:25,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:47:25,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:47:25,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:47:25,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:47:26,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:26,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078002635] [2025-04-13 20:47:26,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078002635] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:47:26,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178425016] [2025-04-13 20:47:26,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:47:26,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:26,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:26,010 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:47:26,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 20:47:26,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:47:26,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:47:26,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:47:26,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:26,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 20:47:26,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:47:26,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:47:26,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:47:26,716 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:26,716 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 92 [2025-04-13 20:47:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:47:27,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:28,633 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:28,634 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 310 treesize of output 170 [2025-04-13 20:47:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:47:29,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178425016] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:47:29,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:47:29,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 20:47:29,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955993043] [2025-04-13 20:47:29,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:47:29,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 20:47:29,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:29,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 20:47:29,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 20:47:29,209 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:47:29,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 2771 transitions, 74984 flow. Second operand has 35 states, 35 states have (on average 4.714285714285714) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:29,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:29,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:47:29,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:41,996 INFO L116 PetriNetUnfolderBase]: 12102/17559 cut-off events. [2025-04-13 20:47:41,996 INFO L117 PetriNetUnfolderBase]: For 412388/412388 co-relation queries the response was YES. [2025-04-13 20:47:42,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205635 conditions, 17559 events. 12102/17559 cut-off events. For 412388/412388 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 106798 event pairs, 537 based on Foata normal form. 3/17073 useless extension candidates. Maximal degree in co-relation 205465. Up to 13029 conditions per place. [2025-04-13 20:47:42,209 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2144 selfloop transitions, 1163 changer transitions 13/3320 dead transitions. [2025-04-13 20:47:42,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 3320 transitions, 91713 flow [2025-04-13 20:47:42,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 20:47:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-13 20:47:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 489 transitions. [2025-04-13 20:47:42,210 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.305625 [2025-04-13 20:47:42,210 INFO L175 Difference]: Start difference. First operand has 570 places, 2771 transitions, 74984 flow. Second operand 50 states and 489 transitions. [2025-04-13 20:47:42,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 3320 transitions, 91713 flow [2025-04-13 20:47:49,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 3320 transitions, 89912 flow, removed 714 selfloop flow, removed 8 redundant places. [2025-04-13 20:47:49,707 INFO L231 Difference]: Finished difference. Result has 620 places, 3042 transitions, 82358 flow [2025-04-13 20:47:49,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=73421, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=929, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=82358, PETRI_PLACES=620, PETRI_TRANSITIONS=3042} [2025-04-13 20:47:49,709 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 589 predicate places. [2025-04-13 20:47:49,709 INFO L485 AbstractCegarLoop]: Abstraction has has 620 places, 3042 transitions, 82358 flow [2025-04-13 20:47:49,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.714285714285714) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:49,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:49,709 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:47:49,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 20:47:49,909 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-13 20:47:49,910 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:47:49,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash 409156453, now seen corresponding path program 3 times [2025-04-13 20:47:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:49,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724170184] [2025-04-13 20:47:49,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:47:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:49,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:47:49,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:47:49,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:47:49,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:47:51,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:51,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724170184] [2025-04-13 20:47:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724170184] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:47:51,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11156055] [2025-04-13 20:47:51,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:47:51,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:51,172 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:47:51,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 20:47:51,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:47:51,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:47:51,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:47:51,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:51,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:47:51,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:47:51,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:47:51,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:47:51,677 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:51,677 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 92 [2025-04-13 20:47:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:47:51,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:53,163 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:53,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 302 treesize of output 162 [2025-04-13 20:47:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:47:53,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11156055] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:47:53,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:47:53,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 20:47:53,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931743457] [2025-04-13 20:47:53,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:47:53,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:47:53,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:53,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:47:53,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:47:53,641 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:47:53,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 3042 transitions, 82358 flow. Second operand has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:53,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:53,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:47:53,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:48:06,736 INFO L116 PetriNetUnfolderBase]: 12942/18889 cut-off events. [2025-04-13 20:48:06,737 INFO L117 PetriNetUnfolderBase]: For 458518/458518 co-relation queries the response was YES. [2025-04-13 20:48:06,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225073 conditions, 18889 events. 12942/18889 cut-off events. For 458518/458518 co-relation queries the response was YES. Maximal size of possible extension queue 1158. Compared 117320 event pairs, 521 based on Foata normal form. 3/18361 useless extension candidates. Maximal degree in co-relation 224895. Up to 14281 conditions per place. [2025-04-13 20:48:07,013 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2130 selfloop transitions, 1406 changer transitions 15/3551 dead transitions. [2025-04-13 20:48:07,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 3551 transitions, 98550 flow [2025-04-13 20:48:07,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 20:48:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-13 20:48:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 511 transitions. [2025-04-13 20:48:07,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.319375 [2025-04-13 20:48:07,015 INFO L175 Difference]: Start difference. First operand has 620 places, 3042 transitions, 82358 flow. Second operand 50 states and 511 transitions. [2025-04-13 20:48:07,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 3551 transitions, 98550 flow [2025-04-13 20:48:15,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 3551 transitions, 97009 flow, removed 505 selfloop flow, removed 11 redundant places. [2025-04-13 20:48:15,887 INFO L231 Difference]: Finished difference. Result has 683 places, 3289 transitions, 91954 flow [2025-04-13 20:48:15,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=80905, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1771, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=91954, PETRI_PLACES=683, PETRI_TRANSITIONS=3289} [2025-04-13 20:48:15,889 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 652 predicate places. [2025-04-13 20:48:15,889 INFO L485 AbstractCegarLoop]: Abstraction has has 683 places, 3289 transitions, 91954 flow [2025-04-13 20:48:15,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:15,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:15,889 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:48:15,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 20:48:16,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-13 20:48:16,090 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:48:16,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1979566681, now seen corresponding path program 4 times [2025-04-13 20:48:16,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:16,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452126337] [2025-04-13 20:48:16,091 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:48:16,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:16,095 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:48:16,101 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:48:16,101 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:48:16,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:48:16,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:16,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452126337] [2025-04-13 20:48:16,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452126337] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:48:16,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939969629] [2025-04-13 20:48:16,656 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:48:16,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:48:16,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:48:16,658 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:48:16,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 20:48:16,703 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:48:16,716 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:48:16,717 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:48:16,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:16,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:48:16,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:48:17,308 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:17,308 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 82 [2025-04-13 20:48:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:48:17,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:48:18,737 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:18,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 403 treesize of output 199 [2025-04-13 20:48:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:48:19,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939969629] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:48:19,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:48:19,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 30 [2025-04-13 20:48:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170179562] [2025-04-13 20:48:19,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:48:19,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:48:19,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:19,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:48:19,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:48:19,304 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:48:19,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 3289 transitions, 91954 flow. Second operand has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:19,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:19,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:48:19,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:48:32,055 INFO L116 PetriNetUnfolderBase]: 13602/19897 cut-off events. [2025-04-13 20:48:32,055 INFO L117 PetriNetUnfolderBase]: For 538924/538924 co-relation queries the response was YES. [2025-04-13 20:48:32,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242725 conditions, 19897 events. 13602/19897 cut-off events. For 538924/538924 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 124799 event pairs, 715 based on Foata normal form. 2/19307 useless extension candidates. Maximal degree in co-relation 242520. Up to 17942 conditions per place. [2025-04-13 20:48:32,438 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 2967 selfloop transitions, 572 changer transitions 6/3545 dead transitions. [2025-04-13 20:48:32,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 3545 transitions, 103239 flow [2025-04-13 20:48:32,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 20:48:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 20:48:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 331 transitions. [2025-04-13 20:48:32,439 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3336693548387097 [2025-04-13 20:48:32,439 INFO L175 Difference]: Start difference. First operand has 683 places, 3289 transitions, 91954 flow. Second operand 31 states and 331 transitions. [2025-04-13 20:48:32,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 3545 transitions, 103239 flow [2025-04-13 20:48:44,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 3545 transitions, 101620 flow, removed 657 selfloop flow, removed 6 redundant places. [2025-04-13 20:48:44,645 INFO L231 Difference]: Finished difference. Result has 719 places, 3400 transitions, 94404 flow [2025-04-13 20:48:44,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90395, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=471, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=94404, PETRI_PLACES=719, PETRI_TRANSITIONS=3400} [2025-04-13 20:48:44,647 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 688 predicate places. [2025-04-13 20:48:44,647 INFO L485 AbstractCegarLoop]: Abstraction has has 719 places, 3400 transitions, 94404 flow [2025-04-13 20:48:44,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.0625) internal successors, (162), 32 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:44,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:44,647 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:48:44,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 20:48:44,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 20:48:44,848 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:48:44,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1649276203, now seen corresponding path program 5 times [2025-04-13 20:48:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:44,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910569232] [2025-04-13 20:48:44,849 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:48:44,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:44,853 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:48:44,859 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:48:44,859 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:48:44,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:45,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:45,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910569232] [2025-04-13 20:48:45,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910569232] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:48:45,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762491444] [2025-04-13 20:48:45,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:48:45,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:48:45,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:48:45,670 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:48:45,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 20:48:45,715 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:48:45,728 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:48:45,729 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:48:45,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:45,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:48:45,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:48:46,233 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:46,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 98 [2025-04-13 20:48:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:48:46,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:48:47,893 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:47,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 374 treesize of output 176 [2025-04-13 20:48:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:48:48,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762491444] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:48:48,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:48:48,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 34 [2025-04-13 20:48:48,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783606265] [2025-04-13 20:48:48,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:48:48,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:48:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:48,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:48:48,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:48:48,449 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:48:48,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 3400 transitions, 94404 flow. Second operand has 36 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:48,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:48,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:48:48,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:49:05,505 INFO L116 PetriNetUnfolderBase]: 14215/20803 cut-off events. [2025-04-13 20:49:05,506 INFO L117 PetriNetUnfolderBase]: For 540609/540609 co-relation queries the response was YES. [2025-04-13 20:49:05,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251675 conditions, 20803 events. 14215/20803 cut-off events. For 540609/540609 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 131246 event pairs, 694 based on Foata normal form. 2/20143 useless extension candidates. Maximal degree in co-relation 251459. Up to 16507 conditions per place. [2025-04-13 20:49:05,809 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2606 selfloop transitions, 1125 changer transitions 7/3738 dead transitions. [2025-04-13 20:49:05,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 773 places, 3738 transitions, 106911 flow [2025-04-13 20:49:05,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 20:49:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-04-13 20:49:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 538 transitions. [2025-04-13 20:49:05,810 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30568181818181817 [2025-04-13 20:49:05,810 INFO L175 Difference]: Start difference. First operand has 719 places, 3400 transitions, 94404 flow. Second operand 55 states and 538 transitions. [2025-04-13 20:49:05,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 773 places, 3738 transitions, 106911 flow [2025-04-13 20:49:18,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 764 places, 3738 transitions, 106157 flow, removed 222 selfloop flow, removed 9 redundant places. [2025-04-13 20:49:18,501 INFO L231 Difference]: Finished difference. Result has 781 places, 3519 transitions, 98866 flow [2025-04-13 20:49:18,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=93658, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=98866, PETRI_PLACES=781, PETRI_TRANSITIONS=3519} [2025-04-13 20:49:18,503 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 750 predicate places. [2025-04-13 20:49:18,503 INFO L485 AbstractCegarLoop]: Abstraction has has 781 places, 3519 transitions, 98866 flow [2025-04-13 20:49:18,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:49:18,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:49:18,503 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:49:18,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 20:49:18,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:49:18,704 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:49:18,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:49:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1147451221, now seen corresponding path program 6 times [2025-04-13 20:49:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:49:18,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757721778] [2025-04-13 20:49:18,705 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:49:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:49:18,710 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:49:18,717 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:49:18,717 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:49:18,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:49:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:49:19,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:49:19,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757721778] [2025-04-13 20:49:19,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757721778] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:49:19,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039938091] [2025-04-13 20:49:19,395 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:49:19,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:49:19,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:49:19,396 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:49:19,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 20:49:19,441 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:49:19,455 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:49:19,456 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:49:19,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:49:19,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:49:19,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:49:20,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:49:20,133 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:49:20,134 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 82 [2025-04-13 20:49:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:49:20,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:49:21,528 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:49:21,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 298 treesize of output 162 [2025-04-13 20:49:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:49:22,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039938091] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:49:22,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:49:22,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 20:49:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802351474] [2025-04-13 20:49:22,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:49:22,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:49:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:49:22,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:49:22,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:49:22,036 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:49:22,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 781 places, 3519 transitions, 98866 flow. Second operand has 38 states, 38 states have (on average 4.815789473684211) internal successors, (183), 38 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:49:22,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:49:22,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:49:22,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:49:38,651 INFO L116 PetriNetUnfolderBase]: 14387/21068 cut-off events. [2025-04-13 20:49:38,652 INFO L117 PetriNetUnfolderBase]: For 575842/575842 co-relation queries the response was YES. [2025-04-13 20:49:38,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260869 conditions, 21068 events. 14387/21068 cut-off events. For 575842/575842 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 133319 event pairs, 597 based on Foata normal form. 2/20698 useless extension candidates. Maximal degree in co-relation 260637. Up to 14636 conditions per place. [2025-04-13 20:49:39,013 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2206 selfloop transitions, 1649 changer transitions 10/3865 dead transitions. [2025-04-13 20:49:39,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 830 places, 3865 transitions, 111856 flow [2025-04-13 20:49:39,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 20:49:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-13 20:49:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 535 transitions. [2025-04-13 20:49:39,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.334375 [2025-04-13 20:49:39,015 INFO L175 Difference]: Start difference. First operand has 781 places, 3519 transitions, 98866 flow. Second operand 50 states and 535 transitions. [2025-04-13 20:49:39,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 830 places, 3865 transitions, 111856 flow [2025-04-13 20:49:52,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 806 places, 3865 transitions, 109474 flow, removed 668 selfloop flow, removed 24 redundant places. [2025-04-13 20:49:52,703 INFO L231 Difference]: Finished difference. Result has 818 places, 3606 transitions, 102142 flow [2025-04-13 20:49:52,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=96835, PETRI_DIFFERENCE_MINUEND_PLACES=757, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1565, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=102142, PETRI_PLACES=818, PETRI_TRANSITIONS=3606} [2025-04-13 20:49:52,705 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 787 predicate places. [2025-04-13 20:49:52,705 INFO L485 AbstractCegarLoop]: Abstraction has has 818 places, 3606 transitions, 102142 flow [2025-04-13 20:49:52,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.815789473684211) internal successors, (183), 38 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:49:52,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:49:52,705 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:49:52,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 20:49:52,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 20:49:52,906 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:49:52,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:49:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash -472032863, now seen corresponding path program 7 times [2025-04-13 20:49:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:49:52,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336177043] [2025-04-13 20:49:52,907 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:49:52,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:49:52,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:49:52,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:49:52,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:49:52,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:49:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:49:53,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:49:53,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336177043] [2025-04-13 20:49:53,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336177043] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:49:53,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145718890] [2025-04-13 20:49:53,684 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:49:53,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:49:53,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:49:53,685 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:49:53,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 20:49:53,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:49:53,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:49:53,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:49:53,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:49:53,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:49:53,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:49:53,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 20:49:54,253 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 20:49:54,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 90 [2025-04-13 20:49:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:49:54,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:49:57,914 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 176 [2025-04-13 20:49:57,923 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:49:57,923 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 224 [2025-04-13 20:49:58,359 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 348 treesize of output 310 [2025-04-13 20:49:58,370 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:49:58,370 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 421 treesize of output 357 [2025-04-13 20:49:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:49:58,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145718890] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:49:58,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:49:58,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2025-04-13 20:49:58,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679536655] [2025-04-13 20:49:58,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:49:58,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:49:58,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:49:58,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:49:58,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1243, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:49:58,757 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:49:58,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 818 places, 3606 transitions, 102142 flow. Second operand has 38 states, 38 states have (on average 4.894736842105263) internal successors, (186), 38 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:49:58,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:49:58,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:49:58,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:50:19,100 INFO L116 PetriNetUnfolderBase]: 15367/22486 cut-off events. [2025-04-13 20:50:19,100 INFO L117 PetriNetUnfolderBase]: For 647044/647044 co-relation queries the response was YES. [2025-04-13 20:50:19,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281977 conditions, 22486 events. 15367/22486 cut-off events. For 647044/647044 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 143491 event pairs, 561 based on Foata normal form. 2/22193 useless extension candidates. Maximal degree in co-relation 281733. Up to 19216 conditions per place. [2025-04-13 20:50:19,545 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 3238 selfloop transitions, 727 changer transitions 6/3971 dead transitions. [2025-04-13 20:50:19,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 870 places, 3971 transitions, 115723 flow [2025-04-13 20:50:19,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 20:50:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-04-13 20:50:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 549 transitions. [2025-04-13 20:50:19,546 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3119318181818182 [2025-04-13 20:50:19,546 INFO L175 Difference]: Start difference. First operand has 818 places, 3606 transitions, 102142 flow. Second operand 55 states and 549 transitions. [2025-04-13 20:50:19,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 870 places, 3971 transitions, 115723 flow [2025-04-13 20:50:35,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 846 places, 3971 transitions, 114382 flow, removed 156 selfloop flow, removed 24 redundant places. [2025-04-13 20:50:35,099 INFO L231 Difference]: Finished difference. Result has 866 places, 3733 transitions, 105244 flow [2025-04-13 20:50:35,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=100814, PETRI_DIFFERENCE_MINUEND_PLACES=792, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=611, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=105244, PETRI_PLACES=866, PETRI_TRANSITIONS=3733} [2025-04-13 20:50:35,101 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 835 predicate places. [2025-04-13 20:50:35,101 INFO L485 AbstractCegarLoop]: Abstraction has has 866 places, 3733 transitions, 105244 flow [2025-04-13 20:50:35,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.894736842105263) internal successors, (186), 38 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:50:35,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:50:35,101 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] [2025-04-13 20:50:35,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 20:50:35,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:50:35,302 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:50:35,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:50:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1750607697, now seen corresponding path program 1 times [2025-04-13 20:50:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:50:35,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10686977] [2025-04-13 20:50:35,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:50:35,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:50:35,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:50:35,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:50:35,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:50:35,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:50:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:50:36,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:50:36,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10686977] [2025-04-13 20:50:36,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10686977] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:50:36,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080153803] [2025-04-13 20:50:36,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:50:36,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:50:36,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:50:36,320 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:50:36,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 20:50:36,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:50:36,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:50:36,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:50:36,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:50:36,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:50:36,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:50:36,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 20:50:36,964 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:36,964 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 20:50:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:50:37,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:50:43,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 374 treesize of output 332 [2025-04-13 20:50:43,086 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:43,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 486 treesize of output 404 [2025-04-13 20:50:43,514 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 176 [2025-04-13 20:50:43,520 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:43,520 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2025-04-13 20:50:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:50:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080153803] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:50:43,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:50:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 39 [2025-04-13 20:50:43,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106916448] [2025-04-13 20:50:43,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:50:43,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 20:50:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:50:43,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 20:50:43,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1466, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 20:50:43,552 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:50:43,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 866 places, 3733 transitions, 105244 flow. Second operand has 41 states, 41 states have (on average 4.829268292682927) internal successors, (198), 41 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:50:43,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:50:43,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:50:43,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:51:05,184 INFO L116 PetriNetUnfolderBase]: 15754/23071 cut-off events. [2025-04-13 20:51:05,185 INFO L117 PetriNetUnfolderBase]: For 738460/738460 co-relation queries the response was YES. [2025-04-13 20:51:05,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297217 conditions, 23071 events. 15754/23071 cut-off events. For 738460/738460 co-relation queries the response was YES. Maximal size of possible extension queue 1344. Compared 148250 event pairs, 909 based on Foata normal form. 2/22784 useless extension candidates. Maximal degree in co-relation 296954. Up to 19189 conditions per place. [2025-04-13 20:51:05,608 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 2886 selfloop transitions, 1136 changer transitions 4/4026 dead transitions. [2025-04-13 20:51:05,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 912 places, 4026 transitions, 118413 flow [2025-04-13 20:51:05,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 20:51:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-04-13 20:51:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 449 transitions. [2025-04-13 20:51:05,609 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29853723404255317 [2025-04-13 20:51:05,609 INFO L175 Difference]: Start difference. First operand has 866 places, 3733 transitions, 105244 flow. Second operand 47 states and 449 transitions. [2025-04-13 20:51:05,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 912 places, 4026 transitions, 118413 flow [2025-04-13 20:51:24,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 895 places, 4026 transitions, 116701 flow, removed 615 selfloop flow, removed 17 redundant places. [2025-04-13 20:51:24,137 INFO L231 Difference]: Finished difference. Result has 906 places, 3840 transitions, 109048 flow [2025-04-13 20:51:24,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=103539, PETRI_DIFFERENCE_MINUEND_PLACES=849, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=109048, PETRI_PLACES=906, PETRI_TRANSITIONS=3840} [2025-04-13 20:51:24,139 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 875 predicate places. [2025-04-13 20:51:24,139 INFO L485 AbstractCegarLoop]: Abstraction has has 906 places, 3840 transitions, 109048 flow [2025-04-13 20:51:24,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.829268292682927) internal successors, (198), 41 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:51:24,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:51:24,140 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:51:24,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 20:51:24,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-04-13 20:51:24,340 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:51:24,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:51:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash -85191439, now seen corresponding path program 8 times [2025-04-13 20:51:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:51:24,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308223013] [2025-04-13 20:51:24,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:51:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:51:24,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:51:24,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:51:24,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:51:24,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:51:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:51:25,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:51:25,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308223013] [2025-04-13 20:51:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308223013] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:51:25,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10445670] [2025-04-13 20:51:25,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:51:25,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:51:25,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:51:25,177 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:51:25,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 20:51:25,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:51:25,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:51:25,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:51:25,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:51:25,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:51:25,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:51:25,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:51:25,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:51:25,761 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:51:25,762 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 92 [2025-04-13 20:51:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:51:26,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:51:27,494 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:51:27,494 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 310 treesize of output 170 [2025-04-13 20:51:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:51:27,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10445670] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:51:27,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:51:27,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 20:51:27,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124159411] [2025-04-13 20:51:27,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:51:27,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 20:51:27,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:51:27,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 20:51:27,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 20:51:27,965 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:51:27,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 906 places, 3840 transitions, 109048 flow. Second operand has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:51:27,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:51:27,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:51:27,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:51:50,541 INFO L116 PetriNetUnfolderBase]: 16391/23992 cut-off events. [2025-04-13 20:51:50,541 INFO L117 PetriNetUnfolderBase]: For 794396/794396 co-relation queries the response was YES. [2025-04-13 20:51:50,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310309 conditions, 23992 events. 16391/23992 cut-off events. For 794396/794396 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 154708 event pairs, 736 based on Foata normal form. 2/23697 useless extension candidates. Maximal degree in co-relation 310035. Up to 16734 conditions per place. [2025-04-13 20:51:51,043 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 2595 selfloop transitions, 1690 changer transitions 7/4292 dead transitions. [2025-04-13 20:51:51,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 970 places, 4292 transitions, 126222 flow [2025-04-13 20:51:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 20:51:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-04-13 20:51:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 636 transitions. [2025-04-13 20:51:51,044 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3057692307692308 [2025-04-13 20:51:51,044 INFO L175 Difference]: Start difference. First operand has 906 places, 3840 transitions, 109048 flow. Second operand 65 states and 636 transitions. [2025-04-13 20:51:51,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 970 places, 4292 transitions, 126222 flow [2025-04-13 20:52:10,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 4292 transitions, 124147 flow, removed 610 selfloop flow, removed 20 redundant places. [2025-04-13 20:52:10,630 INFO L231 Difference]: Finished difference. Result has 957 places, 4008 transitions, 116352 flow [2025-04-13 20:52:10,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=107023, PETRI_DIFFERENCE_MINUEND_PLACES=886, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3840, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1536, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=116352, PETRI_PLACES=957, PETRI_TRANSITIONS=4008} [2025-04-13 20:52:10,633 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 926 predicate places. [2025-04-13 20:52:10,633 INFO L485 AbstractCegarLoop]: Abstraction has has 957 places, 4008 transitions, 116352 flow [2025-04-13 20:52:10,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:52:10,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:52:10,633 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:52:10,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 20:52:10,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:52:10,834 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:52:10,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:52:10,835 INFO L85 PathProgramCache]: Analyzing trace with hash -981409337, now seen corresponding path program 9 times [2025-04-13 20:52:10,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:52:10,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806548250] [2025-04-13 20:52:10,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:52:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:52:10,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:52:10,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:52:10,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:52:10,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:52:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:52:11,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:52:11,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806548250] [2025-04-13 20:52:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806548250] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:52:11,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809276135] [2025-04-13 20:52:11,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:52:11,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:52:11,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:52:11,783 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:52:11,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 20:52:11,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:52:11,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:52:11,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:52:11,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:52:11,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:52:11,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:52:12,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:52:12,275 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:52:12,275 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 96 [2025-04-13 20:52:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:52:12,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:52:14,010 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:52:14,011 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 302 treesize of output 162 [2025-04-13 20:52:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:52:14,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809276135] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:52:14,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:52:14,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 34 [2025-04-13 20:52:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990907377] [2025-04-13 20:52:14,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:52:14,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:52:14,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:52:14,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:52:14,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:52:14,612 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:52:14,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 4008 transitions, 116352 flow. Second operand has 36 states, 36 states have (on average 4.722222222222222) internal successors, (170), 36 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:52:14,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:52:14,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:52:14,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:52:38,914 INFO L116 PetriNetUnfolderBase]: 17190/25165 cut-off events. [2025-04-13 20:52:38,915 INFO L117 PetriNetUnfolderBase]: For 891717/891717 co-relation queries the response was YES. [2025-04-13 20:52:39,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335170 conditions, 25165 events. 17190/25165 cut-off events. For 891717/891717 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 162929 event pairs, 732 based on Foata normal form. 3/24854 useless extension candidates. Maximal degree in co-relation 334891. Up to 19305 conditions per place. [2025-04-13 20:52:39,963 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 2775 selfloop transitions, 1814 changer transitions 15/4604 dead transitions. [2025-04-13 20:52:39,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 4604 transitions, 137788 flow [2025-04-13 20:52:39,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 20:52:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2025-04-13 20:52:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 665 transitions. [2025-04-13 20:52:39,965 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3101679104477612 [2025-04-13 20:52:39,965 INFO L175 Difference]: Start difference. First operand has 957 places, 4008 transitions, 116352 flow. Second operand 67 states and 665 transitions. [2025-04-13 20:52:39,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 4604 transitions, 137788 flow [2025-04-13 20:53:03,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1002 places, 4604 transitions, 133848 flow, removed 1474 selfloop flow, removed 21 redundant places. [2025-04-13 20:53:04,030 INFO L231 Difference]: Finished difference. Result has 1025 places, 4342 transitions, 126588 flow [2025-04-13 20:53:04,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=113276, PETRI_DIFFERENCE_MINUEND_PLACES=936, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1529, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=126588, PETRI_PLACES=1025, PETRI_TRANSITIONS=4342} [2025-04-13 20:53:04,032 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 994 predicate places. [2025-04-13 20:53:04,033 INFO L485 AbstractCegarLoop]: Abstraction has has 1025 places, 4342 transitions, 126588 flow [2025-04-13 20:53:04,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.722222222222222) internal successors, (170), 36 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:04,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:04,033 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:53:04,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-04-13 20:53:04,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:04,234 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:04,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1447143663, now seen corresponding path program 10 times [2025-04-13 20:53:04,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:04,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504262467] [2025-04-13 20:53:04,235 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:53:04,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:04,240 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:53:04,246 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:53:04,246 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:53:04,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:53:04,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:04,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504262467] [2025-04-13 20:53:04,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504262467] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:53:04,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725691481] [2025-04-13 20:53:04,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:53:04,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:04,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:53:04,933 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:53:04,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 20:53:04,981 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:53:04,994 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:53:04,994 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:53:04,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:04,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:53:04,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:53:05,616 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:53:05,616 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 80 [2025-04-13 20:53:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:53:05,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:53:07,401 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:53:07,402 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 743 treesize of output 367 [2025-04-13 20:53:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:53:09,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725691481] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:53:09,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:53:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2025-04-13 20:53:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109874985] [2025-04-13 20:53:09,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:53:09,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 20:53:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:09,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 20:53:09,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 20:53:09,622 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:53:09,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 4342 transitions, 126588 flow. Second operand has 34 states, 34 states have (on average 5.088235294117647) internal successors, (173), 34 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:09,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:09,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:53:09,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-13 20:53:26,304 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:53:26,304 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:53:26,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 20:53:26,488 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:53:26,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 20:53:26,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:26,689 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (34states, 3/32 universal loopers) in iteration 55,while PetriNetUnfolder was constructing finite prefix that currently has 227210 conditions, 15876 events (10960/15875 cut-off events. For 629417/629417 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 105566 event pairs, 427 based on Foata normal form. 0/16830 useless extension candidates. Maximal degree in co-relation 226910. Up to 13897 conditions per place.). [2025-04-13 20:53:26,692 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:53:26,692 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:53:26,692 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:53:26,692 INFO L422 BasicCegarLoop]: Path program histogram: [34, 10, 5, 1, 1, 1, 1, 1, 1] [2025-04-13 20:53:26,700 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:53:26,701 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:53:26,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:53:26 BasicIcfg [2025-04-13 20:53:26,709 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:53:26,709 INFO L158 Benchmark]: Toolchain (without parser) took 772596.55ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 100.8MB in the beginning and 986.4MB in the end (delta: -885.6MB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2025-04-13 20:53:26,710 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:53:26,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.10ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 85.7MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:53:26,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.88ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:53:26,713 INFO L158 Benchmark]: Boogie Preprocessor took 37.23ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 81.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:53:26,713 INFO L158 Benchmark]: RCFGBuilder took 510.36ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 34.9MB in the end (delta: 46.5MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 20:53:26,713 INFO L158 Benchmark]: TraceAbstraction took 771764.32ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 34.0MB in the beginning and 986.4MB in the end (delta: -952.3MB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2025-04-13 20:53:26,714 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.10ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 85.7MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.88ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.23ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 81.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 510.36ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 34.9MB in the end (delta: 46.5MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 771764.32ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 34.0MB in the beginning and 986.4MB in the end (delta: -952.3MB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (34states, 3/32 universal loopers) in iteration 55,while PetriNetUnfolder was constructing finite prefix that currently has 227210 conditions, 15876 events (10960/15875 cut-off events. For 629417/629417 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 105566 event pairs, 427 based on Foata normal form. 0/16830 useless extension candidates. Maximal degree in co-relation 226910. Up to 13897 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (34states, 3/32 universal loopers) in iteration 55,while PetriNetUnfolder was constructing finite prefix that currently has 227210 conditions, 15876 events (10960/15875 cut-off events. For 629417/629417 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 105566 event pairs, 427 based on Foata normal form. 0/16830 useless extension candidates. Maximal degree in co-relation 226910. Up to 13897 conditions per place.). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (34states, 3/32 universal loopers) in iteration 55,while PetriNetUnfolder was constructing finite prefix that currently has 227210 conditions, 15876 events (10960/15875 cut-off events. For 629417/629417 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 105566 event pairs, 427 based on Foata normal form. 0/16830 useless extension candidates. Maximal degree in co-relation 226910. Up to 13897 conditions per place.). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (34states, 3/32 universal loopers) in iteration 55,while PetriNetUnfolder was constructing finite prefix that currently has 227210 conditions, 15876 events (10960/15875 cut-off events. For 629417/629417 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 105566 event pairs, 427 based on Foata normal form. 0/16830 useless extension candidates. Maximal degree in co-relation 226910. Up to 13897 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 41 locations, 53 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 771.6s, OverallIterations: 55, TraceHistogramMax: 2, PathProgramHistogramMax: 34, EmptinessCheckTime: 0.0s, AutomataDifference: 685.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7624 SdHoareTripleChecker+Valid, 36.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7624 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 31.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58728 IncrementalHoareTripleChecker+Invalid, 60085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1357 mSolverCounterUnsat, 0 mSDtfsCounter, 58728 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2573 GetRequests, 833 SyntacticMatches, 39 SemanticMatches, 1701 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24544 ImplicationChecksByTransitivity, 77.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126588occurred in iteration=54, InterpolantAutomatonStates: 1258, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 77.9s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1796 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 2362 ConstructedInterpolants, 0 QuantifiedInterpolants, 117543 SizeOfPredicates, 355 NumberOfNonLiveVariables, 5210 ConjunctsInSsa, 669 ConjunctsInUnsatCore, 113 InterpolantComputations, 29 PerfectInterpolantSequences, 144/309 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown