/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-buffer-series.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:36:33,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:36:34,017 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:36:34,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:36:34,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:36:34,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:36:34,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:36:34,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:36:34,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:36:34,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:36:34,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:36:34,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:36:34,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:36:34,041 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:36:34,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:36:34,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:36:34,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:36:34,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:36:34,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:36:34,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:36:34,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:36:34,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:36:34,043 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:36:34,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:36:34,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:36:34,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:36:34,251 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:36:34,252 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:36:34,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2025-04-13 20:36:35,476 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3064080e/cf8bff4ee9d74ad6bdbccc5b2dda2bc3/FLAGb3d5a0bcf [2025-04-13 20:36:35,665 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:36:35,665 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2025-04-13 20:36:35,671 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3064080e/cf8bff4ee9d74ad6bdbccc5b2dda2bc3/FLAGb3d5a0bcf [2025-04-13 20:36:36,677 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3064080e/cf8bff4ee9d74ad6bdbccc5b2dda2bc3 [2025-04-13 20:36:36,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:36:36,680 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:36:36,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:36:36,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:36:36,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:36:36,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:36,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36adc07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36, skipping insertion in model container [2025-04-13 20:36:36,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:36,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:36:36,877 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-buffer-series.wvr.c[4403,4416] [2025-04-13 20:36:36,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:36:36,898 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:36:36,939 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-buffer-series.wvr.c[4403,4416] [2025-04-13 20:36:36,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:36:36,957 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:36:36,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36 WrapperNode [2025-04-13 20:36:36,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:36:36,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:36:36,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:36:36,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:36:36,968 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:36:36" (1/1) ... [2025-04-13 20:36:36,975 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:36:36" (1/1) ... [2025-04-13 20:36:36,999 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 319 [2025-04-13 20:36:36,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:36:37,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:36:37,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:36:37,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:36:37,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:37,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:37,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:37,031 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 20:36:37,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:37,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:37,041 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:37,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:37,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:37,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:37,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:37,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:36:37,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:36:37,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:36:37,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:36:37,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (1/1) ... [2025-04-13 20:36:37,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:36:37,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:37,076 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:36:37,077 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:36:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:36:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:36:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:36:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 20:36:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:36:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:36:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:36:37,094 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:36:37,176 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:36:37,178 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:36:37,574 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:36:37,575 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:36:37,575 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:36:37,943 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:36:37,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:36:37 BoogieIcfgContainer [2025-04-13 20:36:37,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:36:37,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:36:37,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:36:37,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:36:37,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:36:36" (1/3) ... [2025-04-13 20:36:37,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fde5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:36:37, skipping insertion in model container [2025-04-13 20:36:37,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:36:36" (2/3) ... [2025-04-13 20:36:37,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fde5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:36:37, skipping insertion in model container [2025-04-13 20:36:37,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:36:37" (3/3) ... [2025-04-13 20:36:37,956 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2025-04-13 20:36:37,966 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:36:37,967 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series.wvr.c that has 5 procedures, 45 locations, 47 edges, 1 initial locations, 7 loop locations, and 1 error locations. [2025-04-13 20:36:37,968 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:36:38,017 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 20:36:38,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 51 transitions, 130 flow [2025-04-13 20:36:38,074 INFO L116 PetriNetUnfolderBase]: 7/47 cut-off events. [2025-04-13 20:36:38,075 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:36:38,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 47 events. 7/47 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-13 20:36:38,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 51 transitions, 130 flow [2025-04-13 20:36:38,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 46 transitions, 116 flow [2025-04-13 20:36:38,083 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:36:38,093 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;@611cd343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:36:38,093 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 20:36:38,110 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:36:38,110 INFO L116 PetriNetUnfolderBase]: 7/45 cut-off events. [2025-04-13 20:36:38,110 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:36:38,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:38,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:38,111 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:38,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1725227982, now seen corresponding path program 1 times [2025-04-13 20:36:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:38,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817674246] [2025-04-13 20:36:38,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:38,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 20:36:38,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 20:36:38,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:38,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:38,417 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:36:38,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:38,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817674246] [2025-04-13 20:36:38,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817674246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:38,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:38,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:36:38,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374100424] [2025-04-13 20:36:38,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:38,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:36:38,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:38,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:36:38,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:36:38,444 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-04-13 20:36:38,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:36:38,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:38,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-04-13 20:36:38,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:38,932 INFO L116 PetriNetUnfolderBase]: 2408/3711 cut-off events. [2025-04-13 20:36:38,932 INFO L117 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2025-04-13 20:36:38,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6982 conditions, 3711 events. 2408/3711 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 21324 event pairs, 472 based on Foata normal form. 1/3510 useless extension candidates. Maximal degree in co-relation 6291. Up to 2067 conditions per place. [2025-04-13 20:36:38,960 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 43 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2025-04-13 20:36:38,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 259 flow [2025-04-13 20:36:38,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:36:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:36:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-04-13 20:36:38,968 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2025-04-13 20:36:38,970 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 116 flow. Second operand 3 states and 108 transitions. [2025-04-13 20:36:38,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 259 flow [2025-04-13 20:36:38,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 233 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 20:36:38,979 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 119 flow [2025-04-13 20:36:38,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2025-04-13 20:36:38,985 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-04-13 20:36:38,985 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 119 flow [2025-04-13 20:36:38,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:36:38,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:38,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:38,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:36:38,986 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:38,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash -730086859, now seen corresponding path program 1 times [2025-04-13 20:36:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:38,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447163677] [2025-04-13 20:36:38,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:38,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:39,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:36:39,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:36:39,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:39,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:39,189 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:36:39,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:39,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447163677] [2025-04-13 20:36:39,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447163677] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:39,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:39,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:36:39,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521084497] [2025-04-13 20:36:39,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:39,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:36:39,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:39,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:36:39,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:36:39,197 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-04-13 20:36:39,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:36:39,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:39,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-04-13 20:36:39,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:39,558 INFO L116 PetriNetUnfolderBase]: 2398/3646 cut-off events. [2025-04-13 20:36:39,559 INFO L117 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-04-13 20:36:39,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7579 conditions, 3646 events. 2398/3646 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20898 event pairs, 549 based on Foata normal form. 76/3575 useless extension candidates. Maximal degree in co-relation 2649. Up to 2321 conditions per place. [2025-04-13 20:36:39,578 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 51 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2025-04-13 20:36:39,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 281 flow [2025-04-13 20:36:39,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:36:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:36:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-04-13 20:36:39,580 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2025-04-13 20:36:39,580 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 119 flow. Second operand 3 states and 111 transitions. [2025-04-13 20:36:39,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 281 flow [2025-04-13 20:36:39,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:36:39,582 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 130 flow [2025-04-13 20:36:39,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2025-04-13 20:36:39,582 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-04-13 20:36:39,582 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 130 flow [2025-04-13 20:36:39,583 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:36:39,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:39,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:39,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:36:39,583 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:39,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:39,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1964792365, now seen corresponding path program 1 times [2025-04-13 20:36:39,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:39,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129522151] [2025-04-13 20:36:39,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:39,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:39,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:36:39,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:36:39,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:39,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:36:39,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:39,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129522151] [2025-04-13 20:36:39,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129522151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:39,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:39,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:36:39,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290217667] [2025-04-13 20:36:39,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:39,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:36:39,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:39,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:36:39,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:36:39,714 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-04-13 20:36:39,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:36:39,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:39,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-04-13 20:36:39,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:39,974 INFO L116 PetriNetUnfolderBase]: 2363/3736 cut-off events. [2025-04-13 20:36:39,974 INFO L117 PetriNetUnfolderBase]: For 1405/1405 co-relation queries the response was YES. [2025-04-13 20:36:39,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8144 conditions, 3736 events. 2363/3736 cut-off events. For 1405/1405 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 22674 event pairs, 571 based on Foata normal form. 41/3615 useless extension candidates. Maximal degree in co-relation 5950. Up to 2334 conditions per place. [2025-04-13 20:36:39,990 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 51 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2025-04-13 20:36:39,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 297 flow [2025-04-13 20:36:39,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:36:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:36:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-04-13 20:36:39,991 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-04-13 20:36:39,991 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 130 flow. Second operand 3 states and 109 transitions. [2025-04-13 20:36:39,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 297 flow [2025-04-13 20:36:39,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:36:39,994 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 142 flow [2025-04-13 20:36:39,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-04-13 20:36:39,995 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-04-13 20:36:39,995 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 142 flow [2025-04-13 20:36:39,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:36:39,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:39,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:39,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:36:39,995 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:39,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:39,996 INFO L85 PathProgramCache]: Analyzing trace with hash -69586148, now seen corresponding path program 1 times [2025-04-13 20:36:39,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:39,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828291919] [2025-04-13 20:36:39,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:39,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:40,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:36:40,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:36:40,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:40,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:40,174 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:36:40,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:40,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828291919] [2025-04-13 20:36:40,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828291919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:40,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:40,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:36:40,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127574371] [2025-04-13 20:36:40,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:40,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:36:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:40,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:36:40,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:36:40,176 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-04-13 20:36:40,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:36:40,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:40,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-04-13 20:36:40,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:40,493 INFO L116 PetriNetUnfolderBase]: 2795/4440 cut-off events. [2025-04-13 20:36:40,493 INFO L117 PetriNetUnfolderBase]: For 2274/2274 co-relation queries the response was YES. [2025-04-13 20:36:40,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10247 conditions, 4440 events. 2795/4440 cut-off events. For 2274/2274 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29438 event pairs, 2080 based on Foata normal form. 94/4061 useless extension candidates. Maximal degree in co-relation 4768. Up to 3079 conditions per place. [2025-04-13 20:36:40,509 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 59 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2025-04-13 20:36:40,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 345 flow [2025-04-13 20:36:40,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:36:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:36:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-04-13 20:36:40,510 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6715686274509803 [2025-04-13 20:36:40,510 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 142 flow. Second operand 4 states and 137 transitions. [2025-04-13 20:36:40,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 345 flow [2025-04-13 20:36:40,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:36:40,512 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 160 flow [2025-04-13 20:36:40,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-04-13 20:36:40,512 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2025-04-13 20:36:40,513 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 160 flow [2025-04-13 20:36:40,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:36:40,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:40,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:40,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:36:40,513 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:40,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2128841284, now seen corresponding path program 1 times [2025-04-13 20:36:40,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:40,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932310055] [2025-04-13 20:36:40,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:40,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:36:40,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:36:40,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:40,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:40,620 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:36:40,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:40,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932310055] [2025-04-13 20:36:40,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932310055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:40,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:40,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:36:40,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590961294] [2025-04-13 20:36:40,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:40,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:36:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:40,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:36:40,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:36:40,622 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-04-13 20:36:40,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:36:40,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:40,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-04-13 20:36:40,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:41,080 INFO L116 PetriNetUnfolderBase]: 3459/5666 cut-off events. [2025-04-13 20:36:41,080 INFO L117 PetriNetUnfolderBase]: For 2900/2900 co-relation queries the response was YES. [2025-04-13 20:36:41,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12789 conditions, 5666 events. 3459/5666 cut-off events. For 2900/2900 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 40472 event pairs, 2644 based on Foata normal form. 131/5193 useless extension candidates. Maximal degree in co-relation 10440. Up to 3845 conditions per place. [2025-04-13 20:36:41,106 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 58 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2025-04-13 20:36:41,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 368 flow [2025-04-13 20:36:41,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:36:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:36:41,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-04-13 20:36:41,107 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.615686274509804 [2025-04-13 20:36:41,107 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 160 flow. Second operand 5 states and 157 transitions. [2025-04-13 20:36:41,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 368 flow [2025-04-13 20:36:41,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 364 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:36:41,110 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 195 flow [2025-04-13 20:36:41,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-04-13 20:36:41,111 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-04-13 20:36:41,111 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 195 flow [2025-04-13 20:36:41,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:36:41,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:41,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:41,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:36:41,111 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:41,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2018529639, now seen corresponding path program 1 times [2025-04-13 20:36:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:41,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208956133] [2025-04-13 20:36:41,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:41,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:36:41,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:36:41,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:41,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:36:41,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:41,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208956133] [2025-04-13 20:36:41,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208956133] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:41,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305507202] [2025-04-13 20:36:41,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:41,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:41,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:41,394 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:36:41,396 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:36:41,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:36:41,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:36:41,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:41,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:41,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:36:41,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:36:41,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:36:41,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305507202] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:41,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:36:41,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-04-13 20:36:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583622908] [2025-04-13 20:36:41,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:41,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:36:41,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:41,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:36:41,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:36:41,630 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-04-13 20:36:41,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 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:36:41,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:41,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-04-13 20:36:41,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:42,361 INFO L116 PetriNetUnfolderBase]: 7789/12415 cut-off events. [2025-04-13 20:36:42,361 INFO L117 PetriNetUnfolderBase]: For 5501/5551 co-relation queries the response was YES. [2025-04-13 20:36:42,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27975 conditions, 12415 events. 7789/12415 cut-off events. For 5501/5551 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 93642 event pairs, 5063 based on Foata normal form. 0/11317 useless extension candidates. Maximal degree in co-relation 20092. Up to 8263 conditions per place. [2025-04-13 20:36:42,413 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 75 selfloop transitions, 7 changer transitions 1/96 dead transitions. [2025-04-13 20:36:42,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 486 flow [2025-04-13 20:36:42,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:36:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:36:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2025-04-13 20:36:42,416 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5620915032679739 [2025-04-13 20:36:42,416 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 195 flow. Second operand 6 states and 172 transitions. [2025-04-13 20:36:42,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 486 flow [2025-04-13 20:36:42,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 479 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 20:36:42,421 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 222 flow [2025-04-13 20:36:42,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-04-13 20:36:42,421 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2025-04-13 20:36:42,421 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 222 flow [2025-04-13 20:36:42,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 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:36:42,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:42,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:42,429 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:36:42,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:36:42,625 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:42,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:42,626 INFO L85 PathProgramCache]: Analyzing trace with hash 349256378, now seen corresponding path program 1 times [2025-04-13 20:36:42,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:42,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863953413] [2025-04-13 20:36:42,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:42,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:42,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:36:42,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:36:42,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:42,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:36:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:42,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863953413] [2025-04-13 20:36:42,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863953413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:42,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:42,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:36:42,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892446392] [2025-04-13 20:36:42,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:42,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:36:42,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:42,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:36:42,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:36:42,903 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-04-13 20:36:42,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 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:36:42,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:42,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-04-13 20:36:42,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:43,582 INFO L116 PetriNetUnfolderBase]: 7407/11337 cut-off events. [2025-04-13 20:36:43,582 INFO L117 PetriNetUnfolderBase]: For 5289/5505 co-relation queries the response was YES. [2025-04-13 20:36:43,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26240 conditions, 11337 events. 7407/11337 cut-off events. For 5289/5505 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 78345 event pairs, 3171 based on Foata normal form. 0/10199 useless extension candidates. Maximal degree in co-relation 21234. Up to 4987 conditions per place. [2025-04-13 20:36:43,628 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 60 selfloop transitions, 6 changer transitions 28/107 dead transitions. [2025-04-13 20:36:43,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 107 transitions, 547 flow [2025-04-13 20:36:43,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:36:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:36:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2025-04-13 20:36:43,629 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6045751633986928 [2025-04-13 20:36:43,629 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 222 flow. Second operand 6 states and 185 transitions. [2025-04-13 20:36:43,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 107 transitions, 547 flow [2025-04-13 20:36:43,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 535 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-13 20:36:43,634 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 222 flow [2025-04-13 20:36:43,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2025-04-13 20:36:43,634 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2025-04-13 20:36:43,634 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 222 flow [2025-04-13 20:36:43,634 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 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:36:43,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:43,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:43,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:36:43,635 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:43,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:43,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1124217574, now seen corresponding path program 1 times [2025-04-13 20:36:43,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:43,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554647775] [2025-04-13 20:36:43,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:43,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:36:43,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:36:43,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:43,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:36:43,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:43,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554647775] [2025-04-13 20:36:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554647775] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:43,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:43,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:36:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060371814] [2025-04-13 20:36:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:43,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:36:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:43,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:36:43,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:36:43,993 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2025-04-13 20:36:43,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:36:43,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:43,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2025-04-13 20:36:43,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:44,658 INFO L116 PetriNetUnfolderBase]: 5463/8141 cut-off events. [2025-04-13 20:36:44,658 INFO L117 PetriNetUnfolderBase]: For 5173/5173 co-relation queries the response was YES. [2025-04-13 20:36:44,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20933 conditions, 8141 events. 5463/8141 cut-off events. For 5173/5173 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 51157 event pairs, 502 based on Foata normal form. 296/8275 useless extension candidates. Maximal degree in co-relation 18199. Up to 4693 conditions per place. [2025-04-13 20:36:44,696 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 70 selfloop transitions, 7 changer transitions 1/92 dead transitions. [2025-04-13 20:36:44,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 92 transitions, 500 flow [2025-04-13 20:36:44,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:36:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:36:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2025-04-13 20:36:44,697 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2025-04-13 20:36:44,697 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 222 flow. Second operand 6 states and 171 transitions. [2025-04-13 20:36:44,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 92 transitions, 500 flow [2025-04-13 20:36:44,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 92 transitions, 484 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-04-13 20:36:44,707 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 222 flow [2025-04-13 20:36:44,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2025-04-13 20:36:44,708 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2025-04-13 20:36:44,708 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 222 flow [2025-04-13 20:36:44,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:36:44,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:44,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:44,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:36:44,708 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:44,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:44,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2068557363, now seen corresponding path program 1 times [2025-04-13 20:36:44,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:44,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515755142] [2025-04-13 20:36:44,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:44,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:36:44,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:36:44,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:44,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:36:44,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:44,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515755142] [2025-04-13 20:36:44,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515755142] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:44,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:44,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:36:44,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152685255] [2025-04-13 20:36:44,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:44,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:36:44,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:44,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:36:44,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:36:44,954 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2025-04-13 20:36:44,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:36:44,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:44,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2025-04-13 20:36:44,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:45,341 INFO L116 PetriNetUnfolderBase]: 4276/6393 cut-off events. [2025-04-13 20:36:45,341 INFO L117 PetriNetUnfolderBase]: For 4893/5059 co-relation queries the response was YES. [2025-04-13 20:36:45,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16781 conditions, 6393 events. 4276/6393 cut-off events. For 4893/5059 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 38565 event pairs, 406 based on Foata normal form. 418/6684 useless extension candidates. Maximal degree in co-relation 16750. Up to 3233 conditions per place. [2025-04-13 20:36:45,370 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 68 selfloop transitions, 5 changer transitions 2/89 dead transitions. [2025-04-13 20:36:45,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 492 flow [2025-04-13 20:36:45,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:36:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:36:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2025-04-13 20:36:45,372 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5522875816993464 [2025-04-13 20:36:45,373 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 222 flow. Second operand 6 states and 169 transitions. [2025-04-13 20:36:45,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 492 flow [2025-04-13 20:36:45,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 472 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-13 20:36:45,377 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 204 flow [2025-04-13 20:36:45,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-04-13 20:36:45,379 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2025-04-13 20:36:45,379 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 204 flow [2025-04-13 20:36:45,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:36:45,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:45,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:45,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:36:45,380 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:45,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:45,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1791841006, now seen corresponding path program 1 times [2025-04-13 20:36:45,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:45,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542041550] [2025-04-13 20:36:45,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:45,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:45,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 20:36:45,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 20:36:45,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:45,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:45,585 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:36:45,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:45,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542041550] [2025-04-13 20:36:45,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542041550] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:45,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607859718] [2025-04-13 20:36:45,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:45,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:45,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:45,588 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:36:45,589 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:36:45,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 20:36:45,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 20:36:45,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:45,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:45,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 20:36:45,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:45,806 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:36:45,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:36:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:36:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607859718] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:36:45,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:36:45,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2025-04-13 20:36:45,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872190982] [2025-04-13 20:36:45,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:36:45,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:36:45,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:45,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:36:45,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:36:46,073 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-04-13 20:36:46,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 204 flow. Second operand has 18 states, 18 states have (on average 20.555555555555557) internal successors, (370), 18 states have internal predecessors, (370), 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:36:46,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:46,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-04-13 20:36:46,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:46,921 INFO L116 PetriNetUnfolderBase]: 7178/10179 cut-off events. [2025-04-13 20:36:46,921 INFO L117 PetriNetUnfolderBase]: For 8801/9310 co-relation queries the response was YES. [2025-04-13 20:36:46,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28156 conditions, 10179 events. 7178/10179 cut-off events. For 8801/9310 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 62411 event pairs, 244 based on Foata normal form. 509/10427 useless extension candidates. Maximal degree in co-relation 28125. Up to 2818 conditions per place. [2025-04-13 20:36:46,980 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 142 selfloop transitions, 16 changer transitions 0/171 dead transitions. [2025-04-13 20:36:46,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 171 transitions, 972 flow [2025-04-13 20:36:46,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:36:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:36:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 336 transitions. [2025-04-13 20:36:46,981 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2025-04-13 20:36:46,981 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 204 flow. Second operand 12 states and 336 transitions. [2025-04-13 20:36:46,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 171 transitions, 972 flow [2025-04-13 20:36:46,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 171 transitions, 928 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-04-13 20:36:46,987 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 267 flow [2025-04-13 20:36:46,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=267, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2025-04-13 20:36:46,988 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2025-04-13 20:36:46,988 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 267 flow [2025-04-13 20:36:46,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 20.555555555555557) internal successors, (370), 18 states have internal predecessors, (370), 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:36:46,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:46,995 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:36:47,193 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,SelfDestructingSolverStorable9 [2025-04-13 20:36:47,193 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:47,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:47,193 INFO L85 PathProgramCache]: Analyzing trace with hash 93650584, now seen corresponding path program 1 times [2025-04-13 20:36:47,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:47,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747234053] [2025-04-13 20:36:47,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:47,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:47,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 20:36:47,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 20:36:47,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:47,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:47,370 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:36:47,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:47,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747234053] [2025-04-13 20:36:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747234053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:47,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:47,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:36:47,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994015247] [2025-04-13 20:36:47,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:47,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:36:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:47,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:36:47,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:36:47,380 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2025-04-13 20:36:47,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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:36:47,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:47,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2025-04-13 20:36:47,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:48,344 INFO L116 PetriNetUnfolderBase]: 9707/14567 cut-off events. [2025-04-13 20:36:48,345 INFO L117 PetriNetUnfolderBase]: For 16978/17657 co-relation queries the response was YES. [2025-04-13 20:36:48,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42907 conditions, 14567 events. 9707/14567 cut-off events. For 16978/17657 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 100445 event pairs, 1607 based on Foata normal form. 798/15200 useless extension candidates. Maximal degree in co-relation 42877. Up to 4263 conditions per place. [2025-04-13 20:36:48,412 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 102 selfloop transitions, 17 changer transitions 0/134 dead transitions. [2025-04-13 20:36:48,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 134 transitions, 803 flow [2025-04-13 20:36:48,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:36:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:36:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-04-13 20:36:48,413 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6339869281045751 [2025-04-13 20:36:48,414 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 267 flow. Second operand 6 states and 194 transitions. [2025-04-13 20:36:48,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 134 transitions, 803 flow [2025-04-13 20:36:48,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 134 transitions, 782 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-13 20:36:48,429 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 400 flow [2025-04-13 20:36:48,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-04-13 20:36:48,430 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2025-04-13 20:36:48,430 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 400 flow [2025-04-13 20:36:48,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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:36:48,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:48,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:48,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:36:48,430 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:36:48,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2052617838, now seen corresponding path program 2 times [2025-04-13 20:36:48,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:48,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425242303] [2025-04-13 20:36:48,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:36:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:48,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 20:36:48,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 43 statements. [2025-04-13 20:36:48,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:36:48,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:36:48,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:48,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425242303] [2025-04-13 20:36:48,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425242303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:48,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:48,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:36:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001213886] [2025-04-13 20:36:48,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:48,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:36:48,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:48,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:36:48,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:36:48,597 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51 [2025-04-13 20:36:48,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 400 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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:36:48,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:48,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51 [2025-04-13 20:36:48,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:51,185 INFO L116 PetriNetUnfolderBase]: 24452/33692 cut-off events. [2025-04-13 20:36:51,185 INFO L117 PetriNetUnfolderBase]: For 92564/95049 co-relation queries the response was YES. [2025-04-13 20:36:51,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115938 conditions, 33692 events. 24452/33692 cut-off events. For 92564/95049 co-relation queries the response was YES. Maximal size of possible extension queue 1477. Compared 217783 event pairs, 2118 based on Foata normal form. 2577/35781 useless extension candidates. Maximal degree in co-relation 115904. Up to 9822 conditions per place. [2025-04-13 20:36:51,403 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 177 selfloop transitions, 13 changer transitions 0/211 dead transitions. [2025-04-13 20:36:51,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 211 transitions, 1689 flow [2025-04-13 20:36:51,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:36:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:36:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2025-04-13 20:36:51,404 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5798319327731093 [2025-04-13 20:36:51,404 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 400 flow. Second operand 7 states and 207 transitions. [2025-04-13 20:36:51,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 211 transitions, 1689 flow [2025-04-13 20:36:51,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 211 transitions, 1676 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 20:36:51,427 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 475 flow [2025-04-13 20:36:51,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=475, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2025-04-13 20:36:51,428 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 36 predicate places. [2025-04-13 20:36:51,428 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 475 flow [2025-04-13 20:36:51,428 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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:36:51,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:51,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:51,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:36:51,428 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 2 more)] === [2025-04-13 20:36:51,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1079676608, now seen corresponding path program 3 times [2025-04-13 20:36:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:51,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620578759] [2025-04-13 20:36:51,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:36:51,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:51,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 2 equivalence classes. [2025-04-13 20:36:51,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 43 statements. [2025-04-13 20:36:51,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:36:51,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:36:51,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:51,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620578759] [2025-04-13 20:36:51,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620578759] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:51,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:51,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:36:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321935774] [2025-04-13 20:36:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:51,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:36:51,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:51,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:36:51,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:36:51,672 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2025-04-13 20:36:51,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 475 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 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:36:51,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:51,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2025-04-13 20:36:51,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:56,049 INFO L116 PetriNetUnfolderBase]: 36049/52597 cut-off events. [2025-04-13 20:36:56,049 INFO L117 PetriNetUnfolderBase]: For 165579/169900 co-relation queries the response was YES. [2025-04-13 20:36:56,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202479 conditions, 52597 events. 36049/52597 cut-off events. For 165579/169900 co-relation queries the response was YES. Maximal size of possible extension queue 2407. Compared 389660 event pairs, 4742 based on Foata normal form. 3357/55064 useless extension candidates. Maximal degree in co-relation 202441. Up to 16146 conditions per place. [2025-04-13 20:36:56,438 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 143 selfloop transitions, 18 changer transitions 0/187 dead transitions. [2025-04-13 20:36:56,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 187 transitions, 1484 flow [2025-04-13 20:36:56,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:36:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:36:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2025-04-13 20:36:56,439 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6209150326797386 [2025-04-13 20:36:56,440 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 475 flow. Second operand 6 states and 190 transitions. [2025-04-13 20:36:56,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 187 transitions, 1484 flow [2025-04-13 20:36:56,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 187 transitions, 1484 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:36:56,685 INFO L231 Difference]: Finished difference. Result has 97 places, 98 transitions, 658 flow [2025-04-13 20:36:56,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=658, PETRI_PLACES=97, PETRI_TRANSITIONS=98} [2025-04-13 20:36:56,686 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 45 predicate places. [2025-04-13 20:36:56,686 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 98 transitions, 658 flow [2025-04-13 20:36:56,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 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:36:56,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:56,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:56,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:36:56,686 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 2 more)] === [2025-04-13 20:36:56,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1344744772, now seen corresponding path program 4 times [2025-04-13 20:36:56,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:56,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260388501] [2025-04-13 20:36:56,687 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:36:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:56,694 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 20:36:56,703 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 20:36:56,703 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:36:56,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:56,815 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:36:56,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:56,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260388501] [2025-04-13 20:36:56,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260388501] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:56,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297110747] [2025-04-13 20:36:56,815 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:36:56,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:56,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:56,817 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:36:56,819 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:36:56,874 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 20:36:56,903 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 20:36:56,904 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:36:56,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:56,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 20:36:56,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:36:57,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:36:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:36:57,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297110747] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:57,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:36:57,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 6] total 13 [2025-04-13 20:36:57,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699101871] [2025-04-13 20:36:57,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:57,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:36:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:57,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:36:57,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:36:57,201 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2025-04-13 20:36:57,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 98 transitions, 658 flow. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 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:36:57,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:57,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2025-04-13 20:36:57,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:06,812 INFO L116 PetriNetUnfolderBase]: 88649/124329 cut-off events. [2025-04-13 20:37:06,812 INFO L117 PetriNetUnfolderBase]: For 468034/472739 co-relation queries the response was YES. [2025-04-13 20:37:07,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505410 conditions, 124329 events. 88649/124329 cut-off events. For 468034/472739 co-relation queries the response was YES. Maximal size of possible extension queue 4662. Compared 911506 event pairs, 3709 based on Foata normal form. 3639/127334 useless extension candidates. Maximal degree in co-relation 505366. Up to 57694 conditions per place. [2025-04-13 20:37:07,804 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 215 selfloop transitions, 49 changer transitions 0/276 dead transitions. [2025-04-13 20:37:07,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 276 transitions, 2492 flow [2025-04-13 20:37:07,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:37:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:37:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 244 transitions. [2025-04-13 20:37:07,805 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5315904139433552 [2025-04-13 20:37:07,805 INFO L175 Difference]: Start difference. First operand has 97 places, 98 transitions, 658 flow. Second operand 9 states and 244 transitions. [2025-04-13 20:37:07,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 276 transitions, 2492 flow [2025-04-13 20:37:09,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 276 transitions, 2487 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:09,981 INFO L231 Difference]: Finished difference. Result has 110 places, 131 transitions, 1191 flow [2025-04-13 20:37:09,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1191, PETRI_PLACES=110, PETRI_TRANSITIONS=131} [2025-04-13 20:37:09,981 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2025-04-13 20:37:09,982 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 131 transitions, 1191 flow [2025-04-13 20:37:09,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 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:37:09,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:09,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:09,988 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:37:10,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:10,182 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 2 more)] === [2025-04-13 20:37:10,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:10,183 INFO L85 PathProgramCache]: Analyzing trace with hash 205326919, now seen corresponding path program 1 times [2025-04-13 20:37:10,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:10,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711936082] [2025-04-13 20:37:10,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:10,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:10,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-13 20:37:10,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 20:37:10,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:10,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:12,271 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:37:12,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:12,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711936082] [2025-04-13 20:37:12,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711936082] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:12,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781305418] [2025-04-13 20:37:12,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:12,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:12,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:12,273 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:37:12,274 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:37:12,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-13 20:37:12,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 20:37:12,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:12,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:12,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-13 20:37:12,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:12,390 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 20:37:12,440 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 20:37:12,503 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-13 20:37:12,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-13 20:37:12,561 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 20:37:12,640 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-13 20:37:12,640 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-13 20:37:12,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 20:37:13,364 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-13 20:37:13,364 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 2 case distinctions, treesize of input 38 treesize of output 26 [2025-04-13 20:37:13,371 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:37:13,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:37:14,278 INFO L325 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2025-04-13 20:37:14,278 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 299 treesize of output 125 [2025-04-13 20:37:14,285 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 20:37:14,407 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:37:14,408 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 236 treesize of output 492 [2025-04-13 20:37:14,459 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:37:14,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 115 treesize of output 159 [2025-04-13 20:37:21,393 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:37:21,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781305418] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:37:21,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:37:21,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-04-13 20:37:21,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344425252] [2025-04-13 20:37:21,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:37:21,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:37:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:21,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:37:21,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=872, Unknown=4, NotChecked=0, Total=992 [2025-04-13 20:37:22,228 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2025-04-13 20:37:22,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 131 transitions, 1191 flow. Second operand has 32 states, 32 states have (on average 15.1875) internal successors, (486), 32 states have internal predecessors, (486), 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:37:22,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:22,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2025-04-13 20:37:22,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:27,504 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:37:33,080 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:37:46,498 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:37:50,815 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:38:03,945 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:38:07,984 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:38:12,054 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:38:16,096 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:38:29,326 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:38:35,990 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:38:40,006 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:38:44,086 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:38:48,116 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:38:52,915 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:38:54,426 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:38:58,677 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:39:01,129 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:39:10,254 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:39:14,395 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:39:18,567 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:39:22,933 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:39:26,996 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:39:32,435 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:39:35,665 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:39:41,133 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:39:45,888 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:39:50,228 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:39:55,171 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:39:59,224 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:40:04,680 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:40:08,738 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:40:13,248 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:40:17,284 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:40:21,461 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:40:25,510 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:40:30,699 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:40:35,844 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:40:39,878 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]