./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:18:43,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:18:43,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:18:43,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:18:43,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:18:43,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:18:43,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:18:43,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:18:43,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:18:43,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:18:43,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:18:43,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:18:43,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:18:43,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:18:43,295 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:18:43,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:18:43,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:18:43,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:43,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:18:43,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:18:43,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:18:43,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:18:43,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:18:43,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:18:43,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:18:43,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:18:43,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:18:43,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:18:43,297 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2025-03-04 02:18:43,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:18:43,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:18:43,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:18:43,544 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:18:43,544 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:18:43,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-03-04 02:18:44,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f83ef173/a3d80c4cc2d941a5a632887ef55a4ffc/FLAGce305df1c [2025-03-04 02:18:44,952 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:18:44,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-03-04 02:18:44,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f83ef173/a3d80c4cc2d941a5a632887ef55a4ffc/FLAGce305df1c [2025-03-04 02:18:44,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f83ef173/a3d80c4cc2d941a5a632887ef55a4ffc [2025-03-04 02:18:44,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:18:44,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:18:44,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:44,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:18:44,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:18:44,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:44" (1/1) ... [2025-03-04 02:18:44,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796e1ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:44, skipping insertion in model container [2025-03-04 02:18:44,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:44" (1/1) ... [2025-03-04 02:18:44,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:18:45,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c[3882,3895] [2025-03-04 02:18:45,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:45,121 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:18:45,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c[3882,3895] [2025-03-04 02:18:45,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:45,150 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:18:45,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45 WrapperNode [2025-03-04 02:18:45,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:45,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:45,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:18:45,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:18:45,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,184 INFO L138 Inliner]: procedures = 24, calls = 24, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 214 [2025-03-04 02:18:45,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:45,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:18:45,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:18:45,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:18:45,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,213 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 02:18:45,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:18:45,225 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:18:45,225 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:18:45,225 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:18:45,226 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:45,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:45,253 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-03-04 02:18:45,255 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-03-04 02:18:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:18:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:18:45,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:18:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:18:45,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:18:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:18:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:18:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:18:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:18:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:18:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:18:45,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:18:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:18:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:18:45,277 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:18:45,363 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:18:45,365 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:18:45,665 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:18:45,667 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:18:45,957 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:18:45,957 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:18:45,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:45 BoogieIcfgContainer [2025-03-04 02:18:45,958 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:18:45,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:18:45,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:18:45,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:18:45,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:18:44" (1/3) ... [2025-03-04 02:18:45,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1866e667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:45, skipping insertion in model container [2025-03-04 02:18:45,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (2/3) ... [2025-03-04 02:18:45,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1866e667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:45, skipping insertion in model container [2025-03-04 02:18:45,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:45" (3/3) ... [2025-03-04 02:18:45,967 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2025-03-04 02:18:45,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:18:45,979 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-symm.wvr.c that has 3 procedures, 22 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:18:45,979 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:18:46,027 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:18:46,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 26 transitions, 66 flow [2025-03-04 02:18:46,082 INFO L124 PetriNetUnfolderBase]: 5/24 cut-off events. [2025-03-04 02:18:46,084 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:18:46,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 5/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-03-04 02:18:46,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 26 transitions, 66 flow [2025-03-04 02:18:46,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 23 transitions, 58 flow [2025-03-04 02:18:46,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:18:46,108 INFO L333 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;@7011df36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:18:46,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:18:46,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:18:46,122 INFO L124 PetriNetUnfolderBase]: 5/22 cut-off events. [2025-03-04 02:18:46,122 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:18:46,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:46,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:46,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:46,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1119953060, now seen corresponding path program 1 times [2025-03-04 02:18:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:46,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808348972] [2025-03-04 02:18:46,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:46,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:46,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:18:46,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:18:46,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:46,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:46,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:46,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808348972] [2025-03-04 02:18:46,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808348972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:46,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:46,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:18:46,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375856472] [2025-03-04 02:18:46,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:46,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:18:46,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:46,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:18:46,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:18:46,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:46,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-03-04 02:18:46,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:46,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:46,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:46,387 INFO L124 PetriNetUnfolderBase]: 92/162 cut-off events. [2025-03-04 02:18:46,387 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 02:18:46,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 162 events. 92/162 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 388 event pairs, 68 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 300. Up to 162 conditions per place. [2025-03-04 02:18:46,389 INFO L140 encePairwiseOnDemand]: 24/26 looper letters, 20 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2025-03-04 02:18:46,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 94 flow [2025-03-04 02:18:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:18:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:18:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 28 transitions. [2025-03-04 02:18:46,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-04 02:18:46,401 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 2 states and 28 transitions. [2025-03-04 02:18:46,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 94 flow [2025-03-04 02:18:46,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:46,405 INFO L231 Difference]: Finished difference. Result has 22 places, 21 transitions, 46 flow [2025-03-04 02:18:46,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=22, PETRI_TRANSITIONS=21} [2025-03-04 02:18:46,408 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -3 predicate places. [2025-03-04 02:18:46,408 INFO L471 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 46 flow [2025-03-04 02:18:46,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-03-04 02:18:46,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:46,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:46,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:18:46,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:46,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1061376096, now seen corresponding path program 1 times [2025-03-04 02:18:46,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:46,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284929929] [2025-03-04 02:18:46,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:46,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:46,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:18:46,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:18:46,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:46,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:46,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284929929] [2025-03-04 02:18:46,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284929929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:46,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:46,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:18:46,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249963568] [2025-03-04 02:18:46,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:46,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:18:46,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:46,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:18:46,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:18:46,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:46,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:46,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:46,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:46,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:46,678 INFO L124 PetriNetUnfolderBase]: 92/163 cut-off events. [2025-03-04 02:18:46,679 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:46,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 163 events. 92/163 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 391 event pairs, 68 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 331. Up to 162 conditions per place. [2025-03-04 02:18:46,681 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 19 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2025-03-04 02:18:46,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 90 flow [2025-03-04 02:18:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:18:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:18:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-03-04 02:18:46,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2025-03-04 02:18:46,683 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 46 flow. Second operand 3 states and 31 transitions. [2025-03-04 02:18:46,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 90 flow [2025-03-04 02:18:46,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:18:46,685 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 58 flow [2025-03-04 02:18:46,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2025-03-04 02:18:46,685 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-03-04 02:18:46,685 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 58 flow [2025-03-04 02:18:46,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:46,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:46,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] [2025-03-04 02:18:46,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:18:46,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:46,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:46,688 INFO L85 PathProgramCache]: Analyzing trace with hash 549008271, now seen corresponding path program 1 times [2025-03-04 02:18:46,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:46,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993165123] [2025-03-04 02:18:46,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:46,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:18:46,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:18:46,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:46,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:46,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993165123] [2025-03-04 02:18:46,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993165123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480227238] [2025-03-04 02:18:46,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:46,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:46,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:46,815 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-03-04 02:18:46,817 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-03-04 02:18:46,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:18:46,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:18:46,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:46,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:46,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:18:46,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:46,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:46,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480227238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:46,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 02:18:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687419880] [2025-03-04 02:18:46,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:46,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:46,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:46,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:18:46,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:46,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 58 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-03-04 02:18:46,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:46,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:46,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:47,050 INFO L124 PetriNetUnfolderBase]: 92/165 cut-off events. [2025-03-04 02:18:47,050 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:47,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 165 events. 92/165 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 391 event pairs, 68 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 342. Up to 162 conditions per place. [2025-03-04 02:18:47,051 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 19 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2025-03-04 02:18:47,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 24 transitions, 112 flow [2025-03-04 02:18:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2025-03-04 02:18:47,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2025-03-04 02:18:47,054 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 58 flow. Second operand 5 states and 40 transitions. [2025-03-04 02:18:47,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 24 transitions, 112 flow [2025-03-04 02:18:47,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 108 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:47,056 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 80 flow [2025-03-04 02:18:47,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2025-03-04 02:18:47,056 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2025-03-04 02:18:47,056 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 80 flow [2025-03-04 02:18:47,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-03-04 02:18:47,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:47,057 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:47,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:47,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:47,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:47,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:47,259 INFO L85 PathProgramCache]: Analyzing trace with hash 322466223, now seen corresponding path program 2 times [2025-03-04 02:18:47,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:47,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363667426] [2025-03-04 02:18:47,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:47,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:47,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:18:47,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 21 statements. [2025-03-04 02:18:47,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:47,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:47,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:47,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363667426] [2025-03-04 02:18:47,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363667426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:47,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:47,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:18:47,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084301091] [2025-03-04 02:18:47,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:47,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:47,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:47,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:47,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:18:47,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:47,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:47,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:47,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:47,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:47,804 INFO L124 PetriNetUnfolderBase]: 222/403 cut-off events. [2025-03-04 02:18:47,804 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:18:47,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 403 events. 222/403 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1534 event pairs, 68 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 827. Up to 173 conditions per place. [2025-03-04 02:18:47,807 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 44 selfloop transitions, 4 changer transitions 8/57 dead transitions. [2025-03-04 02:18:47,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 57 transitions, 265 flow [2025-03-04 02:18:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-03-04 02:18:47,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-04 02:18:47,810 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 80 flow. Second operand 5 states and 70 transitions. [2025-03-04 02:18:47,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 57 transitions, 265 flow [2025-03-04 02:18:47,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 57 transitions, 255 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:47,811 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 99 flow [2025-03-04 02:18:47,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-03-04 02:18:47,812 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2025-03-04 02:18:47,812 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 99 flow [2025-03-04 02:18:47,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:47,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:47,812 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:47,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:18:47,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:47,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:47,814 INFO L85 PathProgramCache]: Analyzing trace with hash 739930327, now seen corresponding path program 3 times [2025-03-04 02:18:47,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:47,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534481086] [2025-03-04 02:18:47,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:47,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:47,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 02:18:47,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 21 statements. [2025-03-04 02:18:47,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:47,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:48,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:48,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534481086] [2025-03-04 02:18:48,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534481086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:48,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:48,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:18:48,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017386133] [2025-03-04 02:18:48,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:48,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:48,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:48,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:18:48,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:48,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:48,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:48,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:48,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:48,276 INFO L124 PetriNetUnfolderBase]: 371/674 cut-off events. [2025-03-04 02:18:48,276 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-04 02:18:48,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 674 events. 371/674 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2859 event pairs, 177 based on Foata normal form. 3/677 useless extension candidates. Maximal degree in co-relation 1608. Up to 384 conditions per place. [2025-03-04 02:18:48,280 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 45 selfloop transitions, 4 changer transitions 7/57 dead transitions. [2025-03-04 02:18:48,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 308 flow [2025-03-04 02:18:48,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2025-03-04 02:18:48,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4846153846153846 [2025-03-04 02:18:48,282 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 99 flow. Second operand 5 states and 63 transitions. [2025-03-04 02:18:48,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 308 flow [2025-03-04 02:18:48,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 300 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:48,285 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 122 flow [2025-03-04 02:18:48,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2025-03-04 02:18:48,285 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 16 predicate places. [2025-03-04 02:18:48,285 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 122 flow [2025-03-04 02:18:48,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:48,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:48,287 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:48,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:18:48,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:48,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2002308701, now seen corresponding path program 4 times [2025-03-04 02:18:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:48,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014962531] [2025-03-04 02:18:48,289 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:48,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:48,297 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:18:48,304 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:18:48,305 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:48,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:48,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014962531] [2025-03-04 02:18:48,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014962531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:48,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:48,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:18:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394377045] [2025-03-04 02:18:48,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:48,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:48,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:48,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:48,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:18:48,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:48,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:48,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:48,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:48,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:48,752 INFO L124 PetriNetUnfolderBase]: 419/747 cut-off events. [2025-03-04 02:18:48,753 INFO L125 PetriNetUnfolderBase]: For 437/437 co-relation queries the response was YES. [2025-03-04 02:18:48,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1990 conditions, 747 events. 419/747 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3451 event pairs, 44 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 1976. Up to 560 conditions per place. [2025-03-04 02:18:48,756 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 43 selfloop transitions, 11 changer transitions 3/58 dead transitions. [2025-03-04 02:18:48,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 335 flow [2025-03-04 02:18:48,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-03-04 02:18:48,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46923076923076923 [2025-03-04 02:18:48,757 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 122 flow. Second operand 5 states and 61 transitions. [2025-03-04 02:18:48,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 335 flow [2025-03-04 02:18:48,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 325 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:48,760 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 214 flow [2025-03-04 02:18:48,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2025-03-04 02:18:48,761 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2025-03-04 02:18:48,761 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 214 flow [2025-03-04 02:18:48,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:48,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:48,761 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:48,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:18:48,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:48,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:48,762 INFO L85 PathProgramCache]: Analyzing trace with hash 769724021, now seen corresponding path program 5 times [2025-03-04 02:18:48,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:48,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935565539] [2025-03-04 02:18:48,762 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:48,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:48,773 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-04 02:18:48,787 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:18:48,787 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:18:48,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:49,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:49,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935565539] [2025-03-04 02:18:49,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935565539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:49,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067051327] [2025-03-04 02:18:49,085 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:49,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:49,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:49,087 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-03-04 02:18:49,089 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-03-04 02:18:49,139 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-04 02:18:49,159 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:18:49,159 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:18:49,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:49,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:18:49,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:49,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:18:49,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067051327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:49,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:18:49,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-03-04 02:18:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152290630] [2025-03-04 02:18:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:49,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:49,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:49,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:49,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:49,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:49,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:49,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:49,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:49,590 INFO L124 PetriNetUnfolderBase]: 419/745 cut-off events. [2025-03-04 02:18:49,590 INFO L125 PetriNetUnfolderBase]: For 1022/1022 co-relation queries the response was YES. [2025-03-04 02:18:49,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2214 conditions, 745 events. 419/745 cut-off events. For 1022/1022 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3203 event pairs, 173 based on Foata normal form. 1/746 useless extension candidates. Maximal degree in co-relation 2198. Up to 393 conditions per place. [2025-03-04 02:18:49,594 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 51 selfloop transitions, 10 changer transitions 4/66 dead transitions. [2025-03-04 02:18:49,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 447 flow [2025-03-04 02:18:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-03-04 02:18:49,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2025-03-04 02:18:49,595 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 214 flow. Second operand 5 states and 66 transitions. [2025-03-04 02:18:49,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 447 flow [2025-03-04 02:18:49,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 443 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:49,599 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 286 flow [2025-03-04 02:18:49,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-03-04 02:18:49,599 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 26 predicate places. [2025-03-04 02:18:49,599 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 286 flow [2025-03-04 02:18:49,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:49,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:49,599 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:49,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:18:49,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 02:18:49,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:49,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:49,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1262467604, now seen corresponding path program 1 times [2025-03-04 02:18:49,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:49,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102861814] [2025-03-04 02:18:49,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:49,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:49,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:18:49,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:49,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:49,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102861814] [2025-03-04 02:18:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102861814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649304572] [2025-03-04 02:18:49,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:49,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:49,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:49,899 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-03-04 02:18:49,900 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-03-04 02:18:49,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:18:49,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:49,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:49,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:49,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:49,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:50,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:50,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649304572] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:50,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:50,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-03-04 02:18:50,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162247591] [2025-03-04 02:18:50,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:50,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:50,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:50,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:50,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:50,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:50,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:50,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:50,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:50,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:50,230 INFO L124 PetriNetUnfolderBase]: 445/788 cut-off events. [2025-03-04 02:18:50,230 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2025-03-04 02:18:50,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 788 events. 445/788 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3578 event pairs, 80 based on Foata normal form. 18/806 useless extension candidates. Maximal degree in co-relation 2475. Up to 362 conditions per place. [2025-03-04 02:18:50,236 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 59 selfloop transitions, 11 changer transitions 2/73 dead transitions. [2025-03-04 02:18:50,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 538 flow [2025-03-04 02:18:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-03-04 02:18:50,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2025-03-04 02:18:50,237 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 286 flow. Second operand 5 states and 68 transitions. [2025-03-04 02:18:50,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 538 flow [2025-03-04 02:18:50,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 534 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 02:18:50,241 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 319 flow [2025-03-04 02:18:50,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2025-03-04 02:18:50,241 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 31 predicate places. [2025-03-04 02:18:50,242 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 319 flow [2025-03-04 02:18:50,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:50,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:50,242 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:50,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:18:50,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:50,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:50,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1349997964, now seen corresponding path program 1 times [2025-03-04 02:18:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:50,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655571587] [2025-03-04 02:18:50,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:50,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:50,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:18:50,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:50,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:50,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:50,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:50,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655571587] [2025-03-04 02:18:50,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655571587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:50,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845154686] [2025-03-04 02:18:50,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:50,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:50,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:50,526 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-03-04 02:18:50,527 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-03-04 02:18:50,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:18:50,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:50,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:50,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:50,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:50,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:50,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:50,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845154686] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:50,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:50,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-03-04 02:18:50,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102369057] [2025-03-04 02:18:50,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:50,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:50,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:50,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:50,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:50,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:50,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:50,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:50,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:50,834 INFO L124 PetriNetUnfolderBase]: 481/848 cut-off events. [2025-03-04 02:18:50,835 INFO L125 PetriNetUnfolderBase]: For 2013/2013 co-relation queries the response was YES. [2025-03-04 02:18:50,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 848 events. 481/848 cut-off events. For 2013/2013 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3803 event pairs, 92 based on Foata normal form. 8/856 useless extension candidates. Maximal degree in co-relation 2760. Up to 383 conditions per place. [2025-03-04 02:18:50,841 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 57 selfloop transitions, 10 changer transitions 1/69 dead transitions. [2025-03-04 02:18:50,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 559 flow [2025-03-04 02:18:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-03-04 02:18:50,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2025-03-04 02:18:50,842 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 319 flow. Second operand 5 states and 64 transitions. [2025-03-04 02:18:50,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 559 flow [2025-03-04 02:18:50,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 534 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:50,847 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 353 flow [2025-03-04 02:18:50,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2025-03-04 02:18:50,848 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 34 predicate places. [2025-03-04 02:18:50,848 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 353 flow [2025-03-04 02:18:50,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:50,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:50,848 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:50,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:18:51,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:51,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:51,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1245764488, now seen corresponding path program 2 times [2025-03-04 02:18:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:51,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717473726] [2025-03-04 02:18:51,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:51,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:18:51,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:51,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:51,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:51,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:51,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717473726] [2025-03-04 02:18:51,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717473726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:51,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:51,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158557548] [2025-03-04 02:18:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:51,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:51,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:51,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:51,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:51,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:51,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:51,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:51,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:51,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:51,324 INFO L124 PetriNetUnfolderBase]: 470/822 cut-off events. [2025-03-04 02:18:51,325 INFO L125 PetriNetUnfolderBase]: For 2493/2493 co-relation queries the response was YES. [2025-03-04 02:18:51,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 822 events. 470/822 cut-off events. For 2493/2493 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3705 event pairs, 210 based on Foata normal form. 3/825 useless extension candidates. Maximal degree in co-relation 2777. Up to 431 conditions per place. [2025-03-04 02:18:51,330 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 52 selfloop transitions, 11 changer transitions 10/74 dead transitions. [2025-03-04 02:18:51,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 621 flow [2025-03-04 02:18:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-03-04 02:18:51,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:18:51,331 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 353 flow. Second operand 5 states and 65 transitions. [2025-03-04 02:18:51,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 621 flow [2025-03-04 02:18:51,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 601 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:51,339 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 384 flow [2025-03-04 02:18:51,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=384, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2025-03-04 02:18:51,341 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 39 predicate places. [2025-03-04 02:18:51,341 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 384 flow [2025-03-04 02:18:51,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:51,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:51,341 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:51,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:18:51,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:51,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash 896399664, now seen corresponding path program 2 times [2025-03-04 02:18:51,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:51,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403242045] [2025-03-04 02:18:51,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:51,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:18:51,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-04 02:18:51,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:51,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:51,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403242045] [2025-03-04 02:18:51,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403242045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:51,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:51,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365191036] [2025-03-04 02:18:51,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:51,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:51,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:51,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:51,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:51,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:51,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 384 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:51,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:51,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:51,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:51,594 INFO L124 PetriNetUnfolderBase]: 505/883 cut-off events. [2025-03-04 02:18:51,594 INFO L125 PetriNetUnfolderBase]: For 2850/2850 co-relation queries the response was YES. [2025-03-04 02:18:51,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3137 conditions, 883 events. 505/883 cut-off events. For 2850/2850 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4014 event pairs, 213 based on Foata normal form. 9/892 useless extension candidates. Maximal degree in co-relation 3112. Up to 432 conditions per place. [2025-03-04 02:18:51,600 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 58 selfloop transitions, 13 changer transitions 2/74 dead transitions. [2025-03-04 02:18:51,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 626 flow [2025-03-04 02:18:51,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-03-04 02:18:51,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-04 02:18:51,602 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 384 flow. Second operand 5 states and 70 transitions. [2025-03-04 02:18:51,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 626 flow [2025-03-04 02:18:51,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 602 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:51,607 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 412 flow [2025-03-04 02:18:51,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2025-03-04 02:18:51,608 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 40 predicate places. [2025-03-04 02:18:51,608 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 412 flow [2025-03-04 02:18:51,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:51,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:51,608 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:51,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:18:51,608 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:51,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:51,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2041870274, now seen corresponding path program 3 times [2025-03-04 02:18:51,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:51,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338805399] [2025-03-04 02:18:51,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:51,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:51,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-04 02:18:51,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 23 statements. [2025-03-04 02:18:51,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:51,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:51,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:51,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338805399] [2025-03-04 02:18:51,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338805399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:51,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:51,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:51,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444716560] [2025-03-04 02:18:51,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:51,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:51,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:51,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:51,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:51,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:51,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 412 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:51,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:51,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:51,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:51,834 INFO L124 PetriNetUnfolderBase]: 499/865 cut-off events. [2025-03-04 02:18:51,834 INFO L125 PetriNetUnfolderBase]: For 3001/3001 co-relation queries the response was YES. [2025-03-04 02:18:51,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3102 conditions, 865 events. 499/865 cut-off events. For 3001/3001 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3891 event pairs, 239 based on Foata normal form. 2/867 useless extension candidates. Maximal degree in co-relation 3078. Up to 495 conditions per place. [2025-03-04 02:18:51,839 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 48 selfloop transitions, 11 changer transitions 6/66 dead transitions. [2025-03-04 02:18:51,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 577 flow [2025-03-04 02:18:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-03-04 02:18:51,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2025-03-04 02:18:51,840 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 412 flow. Second operand 5 states and 62 transitions. [2025-03-04 02:18:51,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 577 flow [2025-03-04 02:18:51,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 564 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:51,847 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 396 flow [2025-03-04 02:18:51,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=396, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2025-03-04 02:18:51,849 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 43 predicate places. [2025-03-04 02:18:51,849 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 396 flow [2025-03-04 02:18:51,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:51,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:51,849 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:51,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:18:51,850 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:51,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1766336772, now seen corresponding path program 3 times [2025-03-04 02:18:51,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:51,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129459974] [2025-03-04 02:18:51,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:51,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:51,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-04 02:18:51,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 23 statements. [2025-03-04 02:18:51,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:51,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:51,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129459974] [2025-03-04 02:18:51,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129459974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:51,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:51,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:51,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295266086] [2025-03-04 02:18:51,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:51,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:51,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:51,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:51,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:51,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:51,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 396 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:51,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:51,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:51,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:52,085 INFO L124 PetriNetUnfolderBase]: 489/849 cut-off events. [2025-03-04 02:18:52,085 INFO L125 PetriNetUnfolderBase]: For 3177/3177 co-relation queries the response was YES. [2025-03-04 02:18:52,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 849 events. 489/849 cut-off events. For 3177/3177 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3737 event pairs, 232 based on Foata normal form. 3/852 useless extension candidates. Maximal degree in co-relation 3013. Up to 443 conditions per place. [2025-03-04 02:18:52,091 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 47 selfloop transitions, 12 changer transitions 7/67 dead transitions. [2025-03-04 02:18:52,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 606 flow [2025-03-04 02:18:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-03-04 02:18:52,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2025-03-04 02:18:52,092 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 396 flow. Second operand 5 states and 64 transitions. [2025-03-04 02:18:52,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 606 flow [2025-03-04 02:18:52,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 582 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:52,102 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 402 flow [2025-03-04 02:18:52,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2025-03-04 02:18:52,103 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 43 predicate places. [2025-03-04 02:18:52,103 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 402 flow [2025-03-04 02:18:52,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:52,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:52,103 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:52,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:18:52,103 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:52,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2135205098, now seen corresponding path program 4 times [2025-03-04 02:18:52,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:52,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983225404] [2025-03-04 02:18:52,106 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:52,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:52,118 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:18:52,126 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:52,128 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:52,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:52,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:52,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983225404] [2025-03-04 02:18:52,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983225404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:52,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:52,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:52,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576129175] [2025-03-04 02:18:52,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:52,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:52,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:52,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:52,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:52,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:52,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:52,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:52,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:52,402 INFO L124 PetriNetUnfolderBase]: 460/792 cut-off events. [2025-03-04 02:18:52,402 INFO L125 PetriNetUnfolderBase]: For 3164/3164 co-relation queries the response was YES. [2025-03-04 02:18:52,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 792 events. 460/792 cut-off events. For 3164/3164 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3394 event pairs, 195 based on Foata normal form. 8/800 useless extension candidates. Maximal degree in co-relation 2822. Up to 355 conditions per place. [2025-03-04 02:18:52,406 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 51 selfloop transitions, 13 changer transitions 3/68 dead transitions. [2025-03-04 02:18:52,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 610 flow [2025-03-04 02:18:52,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-03-04 02:18:52,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:18:52,407 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 402 flow. Second operand 5 states and 65 transitions. [2025-03-04 02:18:52,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 610 flow [2025-03-04 02:18:52,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 580 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:52,413 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 402 flow [2025-03-04 02:18:52,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2025-03-04 02:18:52,413 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 43 predicate places. [2025-03-04 02:18:52,413 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 402 flow [2025-03-04 02:18:52,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:52,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:52,413 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:52,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:18:52,414 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:52,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1668721556, now seen corresponding path program 4 times [2025-03-04 02:18:52,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:52,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272081472] [2025-03-04 02:18:52,414 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:52,421 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:18:52,425 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:52,425 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:52,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:52,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:52,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272081472] [2025-03-04 02:18:52,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272081472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:52,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396076533] [2025-03-04 02:18:52,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:52,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:52,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:52,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:52,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:18:52,549 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:18:52,568 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:52,568 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:52,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:52,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:52,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:52,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:52,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396076533] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:52,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:52,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2025-03-04 02:18:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217788059] [2025-03-04 02:18:52,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:52,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:52,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:52,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:18:52,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:52,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:52,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:52,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:52,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:52,835 INFO L124 PetriNetUnfolderBase]: 448/775 cut-off events. [2025-03-04 02:18:52,836 INFO L125 PetriNetUnfolderBase]: For 3020/3020 co-relation queries the response was YES. [2025-03-04 02:18:52,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 775 events. 448/775 cut-off events. For 3020/3020 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3317 event pairs, 191 based on Foata normal form. 9/784 useless extension candidates. Maximal degree in co-relation 2725. Up to 405 conditions per place. [2025-03-04 02:18:52,840 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 52 selfloop transitions, 13 changer transitions 3/69 dead transitions. [2025-03-04 02:18:52,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 624 flow [2025-03-04 02:18:52,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-03-04 02:18:52,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2025-03-04 02:18:52,841 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 402 flow. Second operand 5 states and 66 transitions. [2025-03-04 02:18:52,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 624 flow [2025-03-04 02:18:52,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 576 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:52,846 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 383 flow [2025-03-04 02:18:52,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=383, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2025-03-04 02:18:52,846 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 40 predicate places. [2025-03-04 02:18:52,847 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 383 flow [2025-03-04 02:18:52,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:52,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:52,847 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:52,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:18:53,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:18:53,051 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:53,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1038475130, now seen corresponding path program 5 times [2025-03-04 02:18:53,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:53,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044019191] [2025-03-04 02:18:53,052 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:53,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:53,059 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-04 02:18:53,073 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:53,073 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:18:53,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:53,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:53,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044019191] [2025-03-04 02:18:53,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044019191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:53,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233985561] [2025-03-04 02:18:53,196 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:53,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:53,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:53,198 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:53,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:18:53,251 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-04 02:18:53,272 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:53,273 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:18:53,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:53,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:18:53,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:53,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:18:53,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233985561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:53,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:18:53,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-04 02:18:53,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349628474] [2025-03-04 02:18:53,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:53,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:53,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:53,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:53,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:53,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:53,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 383 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:53,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:53,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:53,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:53,526 INFO L124 PetriNetUnfolderBase]: 441/754 cut-off events. [2025-03-04 02:18:53,526 INFO L125 PetriNetUnfolderBase]: For 2414/2414 co-relation queries the response was YES. [2025-03-04 02:18:53,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 754 events. 441/754 cut-off events. For 2414/2414 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3188 event pairs, 187 based on Foata normal form. 2/756 useless extension candidates. Maximal degree in co-relation 2588. Up to 405 conditions per place. [2025-03-04 02:18:53,530 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 45 selfloop transitions, 11 changer transitions 6/63 dead transitions. [2025-03-04 02:18:53,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 555 flow [2025-03-04 02:18:53,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-03-04 02:18:53,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45384615384615384 [2025-03-04 02:18:53,531 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 383 flow. Second operand 5 states and 59 transitions. [2025-03-04 02:18:53,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 555 flow [2025-03-04 02:18:53,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 505 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:53,535 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 337 flow [2025-03-04 02:18:53,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2025-03-04 02:18:53,535 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 38 predicate places. [2025-03-04 02:18:53,535 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 337 flow [2025-03-04 02:18:53,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:53,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:53,536 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:53,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:18:53,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:18:53,736 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:53,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash -656545109, now seen corresponding path program 1 times [2025-03-04 02:18:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:53,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989123125] [2025-03-04 02:18:53,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:53,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:18:53,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:18:53,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:53,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:54,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:54,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989123125] [2025-03-04 02:18:54,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989123125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:54,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804767891] [2025-03-04 02:18:54,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:54,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:54,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:54,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:54,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:18:54,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:18:54,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:18:54,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:54,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:54,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 02:18:54,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:54,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 106 [2025-03-04 02:18:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:55,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:56,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:56,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 149 [2025-03-04 02:18:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:56,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804767891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:56,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:56,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2025-03-04 02:18:56,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435020882] [2025-03-04 02:18:56,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:56,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:18:56,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:56,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:18:56,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:18:56,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:18:56,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 337 flow. Second operand has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 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-03-04 02:18:56,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:56,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:18:56,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:59,652 INFO L124 PetriNetUnfolderBase]: 1142/2012 cut-off events. [2025-03-04 02:18:59,652 INFO L125 PetriNetUnfolderBase]: For 3845/3845 co-relation queries the response was YES. [2025-03-04 02:18:59,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6278 conditions, 2012 events. 1142/2012 cut-off events. For 3845/3845 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10755 event pairs, 172 based on Foata normal form. 9/2021 useless extension candidates. Maximal degree in co-relation 6257. Up to 357 conditions per place. [2025-03-04 02:18:59,661 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 187 selfloop transitions, 58 changer transitions 35/281 dead transitions. [2025-03-04 02:18:59,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 281 transitions, 1896 flow [2025-03-04 02:18:59,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 02:18:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 02:18:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 351 transitions. [2025-03-04 02:18:59,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-04 02:18:59,664 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 337 flow. Second operand 33 states and 351 transitions. [2025-03-04 02:18:59,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 281 transitions, 1896 flow [2025-03-04 02:18:59,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 281 transitions, 1824 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:59,672 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 933 flow [2025-03-04 02:18:59,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=933, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2025-03-04 02:18:59,672 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 74 predicate places. [2025-03-04 02:18:59,672 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 933 flow [2025-03-04 02:18:59,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 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-03-04 02:18:59,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:59,672 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:59,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:59,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:59,873 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:59,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2084032805, now seen corresponding path program 2 times [2025-03-04 02:18:59,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:59,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666247491] [2025-03-04 02:18:59,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:59,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:59,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:18:59,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:18:59,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:59,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:00,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:00,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666247491] [2025-03-04 02:19:00,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666247491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:00,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146113453] [2025-03-04 02:19:00,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:00,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:00,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:00,418 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:00,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:19:00,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:19:00,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:19:00,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:00,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:00,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 02:19:00,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:00,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 83 [2025-03-04 02:19:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:00,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:01,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:01,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 398 treesize of output 246 [2025-03-04 02:19:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:02,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146113453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:02,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:02,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2025-03-04 02:19:02,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648888306] [2025-03-04 02:19:02,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:02,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:19:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:02,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:19:02,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:19:02,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:02,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 98 transitions, 933 flow. Second operand has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 21 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-03-04 02:19:02,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:02,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:02,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:03,297 INFO L124 PetriNetUnfolderBase]: 1335/2393 cut-off events. [2025-03-04 02:19:03,298 INFO L125 PetriNetUnfolderBase]: For 7850/7850 co-relation queries the response was YES. [2025-03-04 02:19:03,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 2393 events. 1335/2393 cut-off events. For 7850/7850 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13476 event pairs, 494 based on Foata normal form. 5/2398 useless extension candidates. Maximal degree in co-relation 8495. Up to 1104 conditions per place. [2025-03-04 02:19:03,310 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 120 selfloop transitions, 68 changer transitions 20/209 dead transitions. [2025-03-04 02:19:03,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 209 transitions, 1899 flow [2025-03-04 02:19:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:19:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:19:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 190 transitions. [2025-03-04 02:19:03,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2025-03-04 02:19:03,312 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 933 flow. Second operand 19 states and 190 transitions. [2025-03-04 02:19:03,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 209 transitions, 1899 flow [2025-03-04 02:19:03,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 209 transitions, 1663 flow, removed 100 selfloop flow, removed 9 redundant places. [2025-03-04 02:19:03,333 INFO L231 Difference]: Finished difference. Result has 111 places, 128 transitions, 1218 flow [2025-03-04 02:19:03,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1218, PETRI_PLACES=111, PETRI_TRANSITIONS=128} [2025-03-04 02:19:03,334 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 86 predicate places. [2025-03-04 02:19:03,334 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 128 transitions, 1218 flow [2025-03-04 02:19:03,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 21 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-03-04 02:19:03,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:03,334 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:03,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:19:03,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:19:03,538 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:03,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:03,538 INFO L85 PathProgramCache]: Analyzing trace with hash 763952195, now seen corresponding path program 3 times [2025-03-04 02:19:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:03,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17161539] [2025-03-04 02:19:03,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:03,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:03,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-04 02:19:03,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 25 statements. [2025-03-04 02:19:03,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:19:03,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:04,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:04,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17161539] [2025-03-04 02:19:04,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17161539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:04,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:04,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:19:04,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628064245] [2025-03-04 02:19:04,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:04,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:19:04,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:04,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:19:04,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:19:04,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:04,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 128 transitions, 1218 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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-03-04 02:19:04,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:04,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:04,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:04,518 INFO L124 PetriNetUnfolderBase]: 1408/2522 cut-off events. [2025-03-04 02:19:04,519 INFO L125 PetriNetUnfolderBase]: For 12862/12862 co-relation queries the response was YES. [2025-03-04 02:19:04,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9249 conditions, 2522 events. 1408/2522 cut-off events. For 12862/12862 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14511 event pairs, 827 based on Foata normal form. 1/2523 useless extension candidates. Maximal degree in co-relation 9218. Up to 1942 conditions per place. [2025-03-04 02:19:04,532 INFO L140 encePairwiseOnDemand]: 15/26 looper letters, 136 selfloop transitions, 29 changer transitions 9/175 dead transitions. [2025-03-04 02:19:04,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 175 transitions, 1797 flow [2025-03-04 02:19:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:19:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:19:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2025-03-04 02:19:04,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38076923076923075 [2025-03-04 02:19:04,533 INFO L175 Difference]: Start difference. First operand has 111 places, 128 transitions, 1218 flow. Second operand 10 states and 99 transitions. [2025-03-04 02:19:04,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 175 transitions, 1797 flow [2025-03-04 02:19:04,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 175 transitions, 1686 flow, removed 40 selfloop flow, removed 6 redundant places. [2025-03-04 02:19:04,560 INFO L231 Difference]: Finished difference. Result has 116 places, 139 transitions, 1314 flow [2025-03-04 02:19:04,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1314, PETRI_PLACES=116, PETRI_TRANSITIONS=139} [2025-03-04 02:19:04,561 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 91 predicate places. [2025-03-04 02:19:04,561 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 139 transitions, 1314 flow [2025-03-04 02:19:04,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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-03-04 02:19:04,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:04,561 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:04,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 02:19:04,561 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1770962161, now seen corresponding path program 4 times [2025-03-04 02:19:04,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:04,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617310556] [2025-03-04 02:19:04,562 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:04,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:04,567 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:19:04,579 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:19:04,583 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:19:04,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:05,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617310556] [2025-03-04 02:19:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617310556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845792751] [2025-03-04 02:19:05,066 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:05,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:05,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:05,068 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:05,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:19:05,122 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:19:05,150 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:19:05,150 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:19:05,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:05,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 02:19:05,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:05,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 95 [2025-03-04 02:19:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:05,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:06,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:06,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 394 treesize of output 250 [2025-03-04 02:19:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845792751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:07,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:07,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-03-04 02:19:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970982921] [2025-03-04 02:19:07,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:07,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:19:07,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:07,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:19:07,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:19:07,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:07,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 139 transitions, 1314 flow. Second operand has 22 states, 22 states have (on average 5.7272727272727275) internal successors, (126), 22 states have internal predecessors, (126), 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-03-04 02:19:07,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:07,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:07,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:08,828 INFO L124 PetriNetUnfolderBase]: 1555/2813 cut-off events. [2025-03-04 02:19:08,828 INFO L125 PetriNetUnfolderBase]: For 16728/16728 co-relation queries the response was YES. [2025-03-04 02:19:08,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11111 conditions, 2813 events. 1555/2813 cut-off events. For 16728/16728 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16509 event pairs, 501 based on Foata normal form. 9/2822 useless extension candidates. Maximal degree in co-relation 11077. Up to 1147 conditions per place. [2025-03-04 02:19:08,838 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 154 selfloop transitions, 91 changer transitions 29/275 dead transitions. [2025-03-04 02:19:08,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 275 transitions, 2685 flow [2025-03-04 02:19:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:19:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:19:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 253 transitions. [2025-03-04 02:19:08,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3892307692307692 [2025-03-04 02:19:08,840 INFO L175 Difference]: Start difference. First operand has 116 places, 139 transitions, 1314 flow. Second operand 25 states and 253 transitions. [2025-03-04 02:19:08,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 275 transitions, 2685 flow [2025-03-04 02:19:08,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 275 transitions, 2588 flow, removed 39 selfloop flow, removed 5 redundant places. [2025-03-04 02:19:08,874 INFO L231 Difference]: Finished difference. Result has 141 places, 157 transitions, 1752 flow [2025-03-04 02:19:08,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1752, PETRI_PLACES=141, PETRI_TRANSITIONS=157} [2025-03-04 02:19:08,874 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 116 predicate places. [2025-03-04 02:19:08,874 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 157 transitions, 1752 flow [2025-03-04 02:19:08,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.7272727272727275) internal successors, (126), 22 states have internal predecessors, (126), 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-03-04 02:19:08,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:08,874 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:08,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:19:09,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:09,075 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:09,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1307715529, now seen corresponding path program 5 times [2025-03-04 02:19:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:09,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598917717] [2025-03-04 02:19:09,076 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:09,082 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-03-04 02:19:09,103 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:19:09,103 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:19:09,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:09,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:09,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598917717] [2025-03-04 02:19:09,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598917717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:09,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:09,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:19:09,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021749714] [2025-03-04 02:19:09,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:09,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:19:09,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:09,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:19:09,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:19:09,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:09,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 157 transitions, 1752 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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-03-04 02:19:09,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:09,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:09,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:09,976 INFO L124 PetriNetUnfolderBase]: 1589/2862 cut-off events. [2025-03-04 02:19:09,976 INFO L125 PetriNetUnfolderBase]: For 26539/26539 co-relation queries the response was YES. [2025-03-04 02:19:09,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12530 conditions, 2862 events. 1589/2862 cut-off events. For 26539/26539 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16958 event pairs, 936 based on Foata normal form. 4/2866 useless extension candidates. Maximal degree in co-relation 12490. Up to 2154 conditions per place. [2025-03-04 02:19:09,990 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 152 selfloop transitions, 37 changer transitions 9/199 dead transitions. [2025-03-04 02:19:09,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 199 transitions, 2392 flow [2025-03-04 02:19:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:19:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:19:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2025-03-04 02:19:09,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39615384615384613 [2025-03-04 02:19:09,992 INFO L175 Difference]: Start difference. First operand has 141 places, 157 transitions, 1752 flow. Second operand 10 states and 103 transitions. [2025-03-04 02:19:09,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 199 transitions, 2392 flow [2025-03-04 02:19:10,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 199 transitions, 2184 flow, removed 70 selfloop flow, removed 12 redundant places. [2025-03-04 02:19:10,059 INFO L231 Difference]: Finished difference. Result has 137 places, 163 transitions, 1743 flow [2025-03-04 02:19:10,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1743, PETRI_PLACES=137, PETRI_TRANSITIONS=163} [2025-03-04 02:19:10,059 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 112 predicate places. [2025-03-04 02:19:10,059 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 163 transitions, 1743 flow [2025-03-04 02:19:10,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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-03-04 02:19:10,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:10,059 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:10,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 02:19:10,060 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:10,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1826241509, now seen corresponding path program 6 times [2025-03-04 02:19:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:10,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201960149] [2025-03-04 02:19:10,060 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:10,068 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-03-04 02:19:10,087 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:19:10,087 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:10,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:10,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201960149] [2025-03-04 02:19:10,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201960149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149843148] [2025-03-04 02:19:10,499 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:10,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:10,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:10,501 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:10,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:19:10,552 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-03-04 02:19:10,571 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:19:10,571 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:10,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:10,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 02:19:10,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:10,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 76 [2025-03-04 02:19:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:10,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:11,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:11,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 254 treesize of output 174 [2025-03-04 02:19:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:12,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149843148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:12,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:12,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 22 [2025-03-04 02:19:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458248004] [2025-03-04 02:19:12,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:12,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:19:12,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:12,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:19:12,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:19:12,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:12,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 163 transitions, 1743 flow. Second operand has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 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-03-04 02:19:12,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:12,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:12,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:13,723 INFO L124 PetriNetUnfolderBase]: 1779/3241 cut-off events. [2025-03-04 02:19:13,723 INFO L125 PetriNetUnfolderBase]: For 33367/33367 co-relation queries the response was YES. [2025-03-04 02:19:13,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14282 conditions, 3241 events. 1779/3241 cut-off events. For 33367/33367 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 20073 event pairs, 534 based on Foata normal form. 3/3244 useless extension candidates. Maximal degree in co-relation 14242. Up to 1316 conditions per place. [2025-03-04 02:19:13,738 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 165 selfloop transitions, 132 changer transitions 29/327 dead transitions. [2025-03-04 02:19:13,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 327 transitions, 3580 flow [2025-03-04 02:19:13,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:19:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:19:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 239 transitions. [2025-03-04 02:19:13,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3676923076923077 [2025-03-04 02:19:13,739 INFO L175 Difference]: Start difference. First operand has 137 places, 163 transitions, 1743 flow. Second operand 25 states and 239 transitions. [2025-03-04 02:19:13,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 327 transitions, 3580 flow [2025-03-04 02:19:13,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 327 transitions, 3457 flow, removed 45 selfloop flow, removed 5 redundant places. [2025-03-04 02:19:13,818 INFO L231 Difference]: Finished difference. Result has 164 places, 217 transitions, 2797 flow [2025-03-04 02:19:13,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2797, PETRI_PLACES=164, PETRI_TRANSITIONS=217} [2025-03-04 02:19:13,819 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 139 predicate places. [2025-03-04 02:19:13,819 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 217 transitions, 2797 flow [2025-03-04 02:19:13,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 22 states have internal predecessors, (123), 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-03-04 02:19:13,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:13,820 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:13,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 02:19:14,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 02:19:14,024 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:14,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:14,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1566591157, now seen corresponding path program 7 times [2025-03-04 02:19:14,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:14,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230585454] [2025-03-04 02:19:14,025 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:14,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:19:14,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:19:14,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:14,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:14,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:14,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230585454] [2025-03-04 02:19:14,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230585454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:14,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908134865] [2025-03-04 02:19:14,436 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:14,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:14,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:14,438 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:14,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:19:14,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:19:14,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:19:14,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:14,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:14,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 02:19:14,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:14,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 132 [2025-03-04 02:19:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:14,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:15,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:15,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 131 [2025-03-04 02:19:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:16,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908134865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:16,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:16,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2025-03-04 02:19:16,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688612176] [2025-03-04 02:19:16,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:16,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:19:16,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:16,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:19:16,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:19:16,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:16,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 217 transitions, 2797 flow. Second operand has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 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-03-04 02:19:16,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:16,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:16,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:18,761 INFO L124 PetriNetUnfolderBase]: 2656/4950 cut-off events. [2025-03-04 02:19:18,761 INFO L125 PetriNetUnfolderBase]: For 77037/77037 co-relation queries the response was YES. [2025-03-04 02:19:18,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24579 conditions, 4950 events. 2656/4950 cut-off events. For 77037/77037 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 33249 event pairs, 631 based on Foata normal form. 9/4959 useless extension candidates. Maximal degree in co-relation 24531. Up to 1028 conditions per place. [2025-03-04 02:19:18,798 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 297 selfloop transitions, 155 changer transitions 31/484 dead transitions. [2025-03-04 02:19:18,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 484 transitions, 6411 flow [2025-03-04 02:19:18,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 02:19:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 02:19:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2025-03-04 02:19:18,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3920595533498759 [2025-03-04 02:19:18,800 INFO L175 Difference]: Start difference. First operand has 164 places, 217 transitions, 2797 flow. Second operand 31 states and 316 transitions. [2025-03-04 02:19:18,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 484 transitions, 6411 flow [2025-03-04 02:19:19,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 484 transitions, 5771 flow, removed 317 selfloop flow, removed 5 redundant places. [2025-03-04 02:19:19,206 INFO L231 Difference]: Finished difference. Result has 200 places, 290 transitions, 4106 flow [2025-03-04 02:19:19,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2547, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=4106, PETRI_PLACES=200, PETRI_TRANSITIONS=290} [2025-03-04 02:19:19,206 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 175 predicate places. [2025-03-04 02:19:19,206 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 290 transitions, 4106 flow [2025-03-04 02:19:19,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 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-03-04 02:19:19,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:19,206 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:19,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 02:19:19,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 02:19:19,407 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:19,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:19,408 INFO L85 PathProgramCache]: Analyzing trace with hash 801466567, now seen corresponding path program 8 times [2025-03-04 02:19:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:19,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749746277] [2025-03-04 02:19:19,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:19,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:19:19,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:19:19,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:19,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:19,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:19,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749746277] [2025-03-04 02:19:19,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749746277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:19,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793309461] [2025-03-04 02:19:19,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:19,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:19,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:19,789 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:19,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:19:19,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:19:19,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:19:19,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:19,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:19,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 02:19:19,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:20,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 105 [2025-03-04 02:19:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:20,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:21,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:21,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 257 [2025-03-04 02:19:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:21,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793309461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:21,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:21,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2025-03-04 02:19:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157902726] [2025-03-04 02:19:21,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:21,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:19:21,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:21,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:19:21,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:19:21,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:21,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 290 transitions, 4106 flow. Second operand has 21 states, 21 states have (on average 5.666666666666667) internal successors, (119), 21 states have internal predecessors, (119), 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-03-04 02:19:21,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:21,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:21,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:24,084 INFO L124 PetriNetUnfolderBase]: 2826/5339 cut-off events. [2025-03-04 02:19:24,084 INFO L125 PetriNetUnfolderBase]: For 54804/54804 co-relation queries the response was YES. [2025-03-04 02:19:24,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25411 conditions, 5339 events. 2826/5339 cut-off events. For 54804/54804 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 37085 event pairs, 1245 based on Foata normal form. 9/5348 useless extension candidates. Maximal degree in co-relation 25352. Up to 2798 conditions per place. [2025-03-04 02:19:24,121 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 287 selfloop transitions, 134 changer transitions 32/454 dead transitions. [2025-03-04 02:19:24,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 454 transitions, 6319 flow [2025-03-04 02:19:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:19:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:19:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 264 transitions. [2025-03-04 02:19:24,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40615384615384614 [2025-03-04 02:19:24,123 INFO L175 Difference]: Start difference. First operand has 200 places, 290 transitions, 4106 flow. Second operand 25 states and 264 transitions. [2025-03-04 02:19:24,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 454 transitions, 6319 flow [2025-03-04 02:19:24,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 454 transitions, 5628 flow, removed 322 selfloop flow, removed 7 redundant places. [2025-03-04 02:19:24,464 INFO L231 Difference]: Finished difference. Result has 229 places, 323 transitions, 4469 flow [2025-03-04 02:19:24,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4469, PETRI_PLACES=229, PETRI_TRANSITIONS=323} [2025-03-04 02:19:24,464 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 204 predicate places. [2025-03-04 02:19:24,464 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 323 transitions, 4469 flow [2025-03-04 02:19:24,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.666666666666667) internal successors, (119), 21 states have internal predecessors, (119), 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-03-04 02:19:24,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:24,465 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:24,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 02:19:24,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 02:19:24,665 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:24,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:24,666 INFO L85 PathProgramCache]: Analyzing trace with hash 150025174, now seen corresponding path program 9 times [2025-03-04 02:19:24,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:24,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364906605] [2025-03-04 02:19:24,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:24,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:24,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:24,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:19:24,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:24,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:24,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:24,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364906605] [2025-03-04 02:19:24,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364906605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:24,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534360212] [2025-03-04 02:19:24,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:24,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:24,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:24,924 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:24,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:19:24,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:25,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:19:25,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:25,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:25,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 02:19:25,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:25,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:25,268 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:19:25,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 19 [2025-03-04 02:19:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:25,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534360212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:25,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:25,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-03-04 02:19:25,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919057933] [2025-03-04 02:19:25,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:25,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:19:25,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:25,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:19:25,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:19:25,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:25,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 323 transitions, 4469 flow. Second operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 19 states have internal predecessors, (117), 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-03-04 02:19:25,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:25,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:25,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:26,368 INFO L124 PetriNetUnfolderBase]: 2930/5511 cut-off events. [2025-03-04 02:19:26,369 INFO L125 PetriNetUnfolderBase]: For 38289/38289 co-relation queries the response was YES. [2025-03-04 02:19:26,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24517 conditions, 5511 events. 2930/5511 cut-off events. For 38289/38289 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 38289 event pairs, 403 based on Foata normal form. 21/5532 useless extension candidates. Maximal degree in co-relation 24448. Up to 1154 conditions per place. [2025-03-04 02:19:26,410 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 230 selfloop transitions, 193 changer transitions 11/435 dead transitions. [2025-03-04 02:19:26,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 435 transitions, 6153 flow [2025-03-04 02:19:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 02:19:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 02:19:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 194 transitions. [2025-03-04 02:19:26,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3553113553113553 [2025-03-04 02:19:26,411 INFO L175 Difference]: Start difference. First operand has 229 places, 323 transitions, 4469 flow. Second operand 21 states and 194 transitions. [2025-03-04 02:19:26,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 435 transitions, 6153 flow [2025-03-04 02:19:26,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 435 transitions, 5945 flow, removed 98 selfloop flow, removed 8 redundant places. [2025-03-04 02:19:26,657 INFO L231 Difference]: Finished difference. Result has 240 places, 351 transitions, 5153 flow [2025-03-04 02:19:26,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=4267, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5153, PETRI_PLACES=240, PETRI_TRANSITIONS=351} [2025-03-04 02:19:26,657 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 215 predicate places. [2025-03-04 02:19:26,658 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 351 transitions, 5153 flow [2025-03-04 02:19:26,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 19 states have internal predecessors, (117), 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-03-04 02:19:26,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:26,658 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:26,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 02:19:26,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 02:19:26,859 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:26,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash -589990366, now seen corresponding path program 10 times [2025-03-04 02:19:26,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:26,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408828132] [2025-03-04 02:19:26,860 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:26,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:26,870 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:19:26,882 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:26,886 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:19:26,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:27,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:27,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408828132] [2025-03-04 02:19:27,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408828132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:27,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975646312] [2025-03-04 02:19:27,227 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:27,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:27,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:27,229 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:27,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:19:27,286 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:19:27,305 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:27,305 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:19:27,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:27,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:19:27,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:27,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 59 [2025-03-04 02:19:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:27,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:27,547 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:19:27,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 42 [2025-03-04 02:19:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:27,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975646312] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:27,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:27,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2025-03-04 02:19:27,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673946066] [2025-03-04 02:19:27,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:27,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:19:27,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:27,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:19:27,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:19:27,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:27,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 351 transitions, 5153 flow. Second operand has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 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-03-04 02:19:27,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:27,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:27,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:28,646 INFO L124 PetriNetUnfolderBase]: 2918/5466 cut-off events. [2025-03-04 02:19:28,646 INFO L125 PetriNetUnfolderBase]: For 40074/40074 co-relation queries the response was YES. [2025-03-04 02:19:28,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24816 conditions, 5466 events. 2918/5466 cut-off events. For 40074/40074 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 37966 event pairs, 1328 based on Foata normal form. 32/5498 useless extension candidates. Maximal degree in co-relation 24748. Up to 2825 conditions per place. [2025-03-04 02:19:28,682 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 306 selfloop transitions, 92 changer transitions 9/408 dead transitions. [2025-03-04 02:19:28,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 408 transitions, 6212 flow [2025-03-04 02:19:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:19:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:19:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2025-03-04 02:19:28,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2025-03-04 02:19:28,684 INFO L175 Difference]: Start difference. First operand has 240 places, 351 transitions, 5153 flow. Second operand 12 states and 138 transitions. [2025-03-04 02:19:28,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 408 transitions, 6212 flow [2025-03-04 02:19:28,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 408 transitions, 5859 flow, removed 83 selfloop flow, removed 15 redundant places. [2025-03-04 02:19:28,923 INFO L231 Difference]: Finished difference. Result has 234 places, 344 transitions, 4934 flow [2025-03-04 02:19:28,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=4688, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4934, PETRI_PLACES=234, PETRI_TRANSITIONS=344} [2025-03-04 02:19:28,923 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 209 predicate places. [2025-03-04 02:19:28,923 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 344 transitions, 4934 flow [2025-03-04 02:19:28,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 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-03-04 02:19:28,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:28,923 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:28,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 02:19:29,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:29,124 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:29,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:29,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1274068642, now seen corresponding path program 11 times [2025-03-04 02:19:29,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:29,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541795166] [2025-03-04 02:19:29,124 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:29,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:29,130 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:29,150 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:29,150 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:19:29,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:19:29,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:29,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541795166] [2025-03-04 02:19:29,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541795166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:29,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774601684] [2025-03-04 02:19:29,373 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:29,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:29,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:29,375 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:29,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:19:29,435 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:29,453 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:29,453 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:19:29,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:29,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:19:29,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:29,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:29,653 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:19:29,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 19 [2025-03-04 02:19:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:29,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774601684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:29,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:29,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 02:19:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106369985] [2025-03-04 02:19:29,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:29,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:19:29,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:29,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:19:29,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:19:29,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:29,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 344 transitions, 4934 flow. Second operand has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:29,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:29,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:29,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:30,586 INFO L124 PetriNetUnfolderBase]: 3007/5633 cut-off events. [2025-03-04 02:19:30,586 INFO L125 PetriNetUnfolderBase]: For 36891/36891 co-relation queries the response was YES. [2025-03-04 02:19:30,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24637 conditions, 5633 events. 3007/5633 cut-off events. For 36891/36891 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 39390 event pairs, 659 based on Foata normal form. 21/5654 useless extension candidates. Maximal degree in co-relation 24578. Up to 2374 conditions per place. [2025-03-04 02:19:30,627 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 322 selfloop transitions, 106 changer transitions 6/435 dead transitions. [2025-03-04 02:19:30,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 435 transitions, 6389 flow [2025-03-04 02:19:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:19:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:19:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2025-03-04 02:19:30,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46474358974358976 [2025-03-04 02:19:30,628 INFO L175 Difference]: Start difference. First operand has 234 places, 344 transitions, 4934 flow. Second operand 12 states and 145 transitions. [2025-03-04 02:19:30,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 435 transitions, 6389 flow [2025-03-04 02:19:30,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 435 transitions, 6185 flow, removed 17 selfloop flow, removed 10 redundant places. [2025-03-04 02:19:30,833 INFO L231 Difference]: Finished difference. Result has 238 places, 351 transitions, 5125 flow [2025-03-04 02:19:30,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=4714, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5125, PETRI_PLACES=238, PETRI_TRANSITIONS=351} [2025-03-04 02:19:30,834 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 213 predicate places. [2025-03-04 02:19:30,834 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 351 transitions, 5125 flow [2025-03-04 02:19:30,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:30,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:30,834 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:30,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 02:19:31,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 02:19:31,035 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:31,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash 809098876, now seen corresponding path program 12 times [2025-03-04 02:19:31,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:31,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202726781] [2025-03-04 02:19:31,035 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:31,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:31,041 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:31,057 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:31,057 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:31,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:31,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:31,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202726781] [2025-03-04 02:19:31,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202726781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:31,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136143033] [2025-03-04 02:19:31,355 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:31,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:31,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:31,357 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:31,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 02:19:31,419 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:31,440 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:31,440 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:31,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:31,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 02:19:31,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:31,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2025-03-04 02:19:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:31,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:31,756 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:19:31,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 56 [2025-03-04 02:19:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:31,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136143033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:31,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:31,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-03-04 02:19:31,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596788150] [2025-03-04 02:19:31,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:31,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:19:31,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:31,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:19:31,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:19:31,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:31,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 351 transitions, 5125 flow. Second operand has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 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-03-04 02:19:31,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:31,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:31,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:32,978 INFO L124 PetriNetUnfolderBase]: 2842/5347 cut-off events. [2025-03-04 02:19:32,978 INFO L125 PetriNetUnfolderBase]: For 36723/36723 co-relation queries the response was YES. [2025-03-04 02:19:33,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24824 conditions, 5347 events. 2842/5347 cut-off events. For 36723/36723 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 37128 event pairs, 754 based on Foata normal form. 12/5359 useless extension candidates. Maximal degree in co-relation 24762. Up to 1452 conditions per place. [2025-03-04 02:19:33,019 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 246 selfloop transitions, 175 changer transitions 19/441 dead transitions. [2025-03-04 02:19:33,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 441 transitions, 6399 flow [2025-03-04 02:19:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:19:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:19:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 218 transitions. [2025-03-04 02:19:33,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36454849498327757 [2025-03-04 02:19:33,020 INFO L175 Difference]: Start difference. First operand has 238 places, 351 transitions, 5125 flow. Second operand 23 states and 218 transitions. [2025-03-04 02:19:33,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 441 transitions, 6399 flow [2025-03-04 02:19:33,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 441 transitions, 6289 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 02:19:33,236 INFO L231 Difference]: Finished difference. Result has 257 places, 349 transitions, 5330 flow [2025-03-04 02:19:33,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=4982, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5330, PETRI_PLACES=257, PETRI_TRANSITIONS=349} [2025-03-04 02:19:33,237 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 232 predicate places. [2025-03-04 02:19:33,237 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 349 transitions, 5330 flow [2025-03-04 02:19:33,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 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-03-04 02:19:33,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:33,237 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:33,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 02:19:33,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 02:19:33,442 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:33,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1464330334, now seen corresponding path program 13 times [2025-03-04 02:19:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:33,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542326941] [2025-03-04 02:19:33,442 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:33,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:33,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:19:33,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:33,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:33,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542326941] [2025-03-04 02:19:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542326941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535217688] [2025-03-04 02:19:33,716 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:33,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:33,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:33,718 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:33,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 02:19:33,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:19:33,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:33,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:33,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:33,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 02:19:33,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:33,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 72 [2025-03-04 02:19:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:34,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:34,227 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:19:34,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 19 [2025-03-04 02:19:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:34,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535217688] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:34,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:34,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 21 [2025-03-04 02:19:34,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866035117] [2025-03-04 02:19:34,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:34,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:19:34,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:34,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:19:34,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:19:34,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:34,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 349 transitions, 5330 flow. Second operand has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 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-03-04 02:19:34,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:34,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:34,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:35,918 INFO L124 PetriNetUnfolderBase]: 3002/5606 cut-off events. [2025-03-04 02:19:35,919 INFO L125 PetriNetUnfolderBase]: For 43447/43447 co-relation queries the response was YES. [2025-03-04 02:19:35,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26897 conditions, 5606 events. 3002/5606 cut-off events. For 43447/43447 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 38956 event pairs, 357 based on Foata normal form. 15/5621 useless extension candidates. Maximal degree in co-relation 26833. Up to 1386 conditions per place. [2025-03-04 02:19:35,966 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 264 selfloop transitions, 220 changer transitions 14/499 dead transitions. [2025-03-04 02:19:35,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 499 transitions, 7237 flow [2025-03-04 02:19:35,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:19:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:19:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 277 transitions. [2025-03-04 02:19:35,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42615384615384616 [2025-03-04 02:19:35,967 INFO L175 Difference]: Start difference. First operand has 257 places, 349 transitions, 5330 flow. Second operand 25 states and 277 transitions. [2025-03-04 02:19:35,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 499 transitions, 7237 flow [2025-03-04 02:19:36,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 499 transitions, 6858 flow, removed 20 selfloop flow, removed 14 redundant places. [2025-03-04 02:19:36,264 INFO L231 Difference]: Finished difference. Result has 268 places, 370 transitions, 5875 flow [2025-03-04 02:19:36,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=4941, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5875, PETRI_PLACES=268, PETRI_TRANSITIONS=370} [2025-03-04 02:19:36,265 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 243 predicate places. [2025-03-04 02:19:36,265 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 370 transitions, 5875 flow [2025-03-04 02:19:36,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 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-03-04 02:19:36,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:36,265 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:36,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 02:19:36,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 02:19:36,466 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:36,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1583081118, now seen corresponding path program 14 times [2025-03-04 02:19:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:36,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955218565] [2025-03-04 02:19:36,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:36,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:19:36,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:36,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:36,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:36,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955218565] [2025-03-04 02:19:36,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955218565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:36,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618318346] [2025-03-04 02:19:36,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:36,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:36,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:36,712 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:36,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 02:19:36,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:19:36,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:36,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:36,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:36,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 02:19:36,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:36,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2025-03-04 02:19:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:37,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:37,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:37,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 69 [2025-03-04 02:19:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618318346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:37,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:37,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-04 02:19:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776131944] [2025-03-04 02:19:37,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:37,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:19:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:37,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:19:37,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:19:37,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:37,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 370 transitions, 5875 flow. Second operand has 18 states, 18 states have (on average 6.0) internal successors, (108), 18 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-03-04 02:19:37,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:37,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:37,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:38,390 INFO L124 PetriNetUnfolderBase]: 2983/5557 cut-off events. [2025-03-04 02:19:38,391 INFO L125 PetriNetUnfolderBase]: For 43756/43756 co-relation queries the response was YES. [2025-03-04 02:19:38,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27221 conditions, 5557 events. 2983/5557 cut-off events. For 43756/43756 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 38537 event pairs, 1318 based on Foata normal form. 3/5560 useless extension candidates. Maximal degree in co-relation 27152. Up to 2596 conditions per place. [2025-03-04 02:19:38,431 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 246 selfloop transitions, 146 changer transitions 12/405 dead transitions. [2025-03-04 02:19:38,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 405 transitions, 6772 flow [2025-03-04 02:19:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:19:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:19:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2025-03-04 02:19:38,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3520710059171598 [2025-03-04 02:19:38,432 INFO L175 Difference]: Start difference. First operand has 268 places, 370 transitions, 5875 flow. Second operand 13 states and 119 transitions. [2025-03-04 02:19:38,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 405 transitions, 6772 flow [2025-03-04 02:19:38,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 405 transitions, 6507 flow, removed 47 selfloop flow, removed 14 redundant places. [2025-03-04 02:19:38,722 INFO L231 Difference]: Finished difference. Result has 265 places, 363 transitions, 5796 flow [2025-03-04 02:19:38,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=5550, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5796, PETRI_PLACES=265, PETRI_TRANSITIONS=363} [2025-03-04 02:19:38,722 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 240 predicate places. [2025-03-04 02:19:38,723 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 363 transitions, 5796 flow [2025-03-04 02:19:38,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.0) internal successors, (108), 18 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-03-04 02:19:38,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:38,723 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:38,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 02:19:38,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:38,925 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:38,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash 948281940, now seen corresponding path program 15 times [2025-03-04 02:19:38,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:38,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967592443] [2025-03-04 02:19:38,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:38,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:38,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:38,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:19:38,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:38,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:39,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967592443] [2025-03-04 02:19:39,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967592443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:39,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858150311] [2025-03-04 02:19:39,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:39,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:39,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:39,294 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:39,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 02:19:39,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:39,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:19:39,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:39,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:39,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 02:19:39,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:39,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:39,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:39,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 27 [2025-03-04 02:19:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858150311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:39,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:39,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 18 [2025-03-04 02:19:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077066257] [2025-03-04 02:19:39,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:39,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:19:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:39,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:19:39,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:19:39,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:39,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 363 transitions, 5796 flow. Second operand has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 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-03-04 02:19:39,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:39,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:39,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:40,991 INFO L124 PetriNetUnfolderBase]: 3053/5666 cut-off events. [2025-03-04 02:19:40,991 INFO L125 PetriNetUnfolderBase]: For 46661/46661 co-relation queries the response was YES. [2025-03-04 02:19:41,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27699 conditions, 5666 events. 3053/5666 cut-off events. For 46661/46661 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 39257 event pairs, 1136 based on Foata normal form. 24/5690 useless extension candidates. Maximal degree in co-relation 27631. Up to 2513 conditions per place. [2025-03-04 02:19:41,036 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 214 selfloop transitions, 217 changer transitions 7/439 dead transitions. [2025-03-04 02:19:41,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 439 transitions, 7068 flow [2025-03-04 02:19:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 02:19:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 02:19:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 192 transitions. [2025-03-04 02:19:41,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3356643356643357 [2025-03-04 02:19:41,037 INFO L175 Difference]: Start difference. First operand has 265 places, 363 transitions, 5796 flow. Second operand 22 states and 192 transitions. [2025-03-04 02:19:41,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 439 transitions, 7068 flow [2025-03-04 02:19:41,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 439 transitions, 6751 flow, removed 16 selfloop flow, removed 10 redundant places. [2025-03-04 02:19:41,313 INFO L231 Difference]: Finished difference. Result has 273 places, 369 transitions, 6022 flow [2025-03-04 02:19:41,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=5461, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6022, PETRI_PLACES=273, PETRI_TRANSITIONS=369} [2025-03-04 02:19:41,313 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 248 predicate places. [2025-03-04 02:19:41,313 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 369 transitions, 6022 flow [2025-03-04 02:19:41,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 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-03-04 02:19:41,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:41,314 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:41,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 02:19:41,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:41,514 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:41,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash 413409454, now seen corresponding path program 16 times [2025-03-04 02:19:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:41,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342821423] [2025-03-04 02:19:41,515 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:41,520 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:19:41,527 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:41,527 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:19:41,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:41,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:41,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342821423] [2025-03-04 02:19:41,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342821423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:41,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:41,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:19:41,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410361692] [2025-03-04 02:19:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:41,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:19:41,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:41,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:19:41,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:19:41,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:41,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 369 transitions, 6022 flow. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-03-04 02:19:41,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:41,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:41,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:42,805 INFO L124 PetriNetUnfolderBase]: 3178/5896 cut-off events. [2025-03-04 02:19:42,805 INFO L125 PetriNetUnfolderBase]: For 49679/49679 co-relation queries the response was YES. [2025-03-04 02:19:42,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29077 conditions, 5896 events. 3178/5896 cut-off events. For 49679/49679 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 41411 event pairs, 1994 based on Foata normal form. 18/5914 useless extension candidates. Maximal degree in co-relation 29008. Up to 4718 conditions per place. [2025-03-04 02:19:42,853 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 346 selfloop transitions, 65 changer transitions 5/417 dead transitions. [2025-03-04 02:19:42,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 417 transitions, 7300 flow [2025-03-04 02:19:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:19:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:19:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-03-04 02:19:42,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.405982905982906 [2025-03-04 02:19:42,854 INFO L175 Difference]: Start difference. First operand has 273 places, 369 transitions, 6022 flow. Second operand 9 states and 95 transitions. [2025-03-04 02:19:42,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 417 transitions, 7300 flow [2025-03-04 02:19:43,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 417 transitions, 7159 flow, removed 20 selfloop flow, removed 11 redundant places. [2025-03-04 02:19:43,192 INFO L231 Difference]: Finished difference. Result has 272 places, 377 transitions, 6214 flow [2025-03-04 02:19:43,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=5896, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6214, PETRI_PLACES=272, PETRI_TRANSITIONS=377} [2025-03-04 02:19:43,193 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 247 predicate places. [2025-03-04 02:19:43,193 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 377 transitions, 6214 flow [2025-03-04 02:19:43,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-03-04 02:19:43,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:43,193 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:43,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 02:19:43,193 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:43,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:43,194 INFO L85 PathProgramCache]: Analyzing trace with hash -392829830, now seen corresponding path program 17 times [2025-03-04 02:19:43,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:43,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626063734] [2025-03-04 02:19:43,194 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:43,202 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:43,213 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:43,213 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:19:43,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:19:43,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:43,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626063734] [2025-03-04 02:19:43,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626063734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:43,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117625621] [2025-03-04 02:19:43,522 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:43,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:43,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:43,524 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:43,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 02:19:43,599 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:43,623 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:43,623 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:19:43,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:43,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 02:19:43,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:43,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 59 [2025-03-04 02:19:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:43,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:43,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:43,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2025-03-04 02:19:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117625621] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:44,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:44,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-03-04 02:19:44,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459690347] [2025-03-04 02:19:44,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:44,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:19:44,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:44,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:19:44,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:19:44,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:44,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 377 transitions, 6214 flow. Second operand has 18 states, 18 states have (on average 5.944444444444445) internal successors, (107), 18 states have internal predecessors, (107), 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-03-04 02:19:44,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:44,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:44,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:44,905 INFO L124 PetriNetUnfolderBase]: 3194/5909 cut-off events. [2025-03-04 02:19:44,905 INFO L125 PetriNetUnfolderBase]: For 52121/52121 co-relation queries the response was YES. [2025-03-04 02:19:44,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29407 conditions, 5909 events. 3194/5909 cut-off events. For 52121/52121 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 41530 event pairs, 1598 based on Foata normal form. 27/5936 useless extension candidates. Maximal degree in co-relation 29336. Up to 4059 conditions per place. [2025-03-04 02:19:44,954 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 276 selfloop transitions, 139 changer transitions 6/422 dead transitions. [2025-03-04 02:19:44,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 422 transitions, 7218 flow [2025-03-04 02:19:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:19:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:19:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2025-03-04 02:19:44,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4198717948717949 [2025-03-04 02:19:44,955 INFO L175 Difference]: Start difference. First operand has 272 places, 377 transitions, 6214 flow. Second operand 12 states and 131 transitions. [2025-03-04 02:19:44,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 422 transitions, 7218 flow [2025-03-04 02:19:45,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 422 transitions, 7092 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-03-04 02:19:45,297 INFO L231 Difference]: Finished difference. Result has 279 places, 374 transitions, 6490 flow [2025-03-04 02:19:45,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=5979, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6490, PETRI_PLACES=279, PETRI_TRANSITIONS=374} [2025-03-04 02:19:45,298 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 254 predicate places. [2025-03-04 02:19:45,298 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 374 transitions, 6490 flow [2025-03-04 02:19:45,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.944444444444445) internal successors, (107), 18 states have internal predecessors, (107), 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-03-04 02:19:45,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:45,298 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:45,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 02:19:45,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 02:19:45,499 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:45,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash -839570062, now seen corresponding path program 18 times [2025-03-04 02:19:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:45,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82811614] [2025-03-04 02:19:45,500 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:45,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:45,505 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:45,516 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:45,516 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:45,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:45,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:45,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82811614] [2025-03-04 02:19:45,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82811614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:45,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694262891] [2025-03-04 02:19:45,775 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:45,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:45,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:45,777 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:45,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 02:19:45,850 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:45,871 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:45,871 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:45,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:45,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 02:19:45,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:45,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:19:45,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 02:19:45,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 02:19:46,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 59 [2025-03-04 02:19:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:46,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:46,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694262891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:46,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:46,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 23 [2025-03-04 02:19:46,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765835646] [2025-03-04 02:19:46,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:46,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:19:46,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:46,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:19:46,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:19:46,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:46,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 374 transitions, 6490 flow. Second operand has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 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-03-04 02:19:46,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:46,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:46,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:47,358 INFO L124 PetriNetUnfolderBase]: 3183/5883 cut-off events. [2025-03-04 02:19:47,358 INFO L125 PetriNetUnfolderBase]: For 56109/56109 co-relation queries the response was YES. [2025-03-04 02:19:47,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30117 conditions, 5883 events. 3183/5883 cut-off events. For 56109/56109 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 41216 event pairs, 2122 based on Foata normal form. 6/5889 useless extension candidates. Maximal degree in co-relation 30044. Up to 5090 conditions per place. [2025-03-04 02:19:47,415 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 345 selfloop transitions, 51 changer transitions 12/409 dead transitions. [2025-03-04 02:19:47,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 409 transitions, 7437 flow [2025-03-04 02:19:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:19:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:19:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 114 transitions. [2025-03-04 02:19:47,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33727810650887574 [2025-03-04 02:19:47,416 INFO L175 Difference]: Start difference. First operand has 279 places, 374 transitions, 6490 flow. Second operand 13 states and 114 transitions. [2025-03-04 02:19:47,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 409 transitions, 7437 flow [2025-03-04 02:19:47,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 409 transitions, 7373 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-03-04 02:19:47,835 INFO L231 Difference]: Finished difference. Result has 284 places, 370 transitions, 6440 flow [2025-03-04 02:19:47,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=6350, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6440, PETRI_PLACES=284, PETRI_TRANSITIONS=370} [2025-03-04 02:19:47,836 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 259 predicate places. [2025-03-04 02:19:47,836 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 370 transitions, 6440 flow [2025-03-04 02:19:47,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 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-03-04 02:19:47,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:47,836 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:47,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 02:19:48,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 02:19:48,037 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:48,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1753170578, now seen corresponding path program 19 times [2025-03-04 02:19:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:48,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494388054] [2025-03-04 02:19:48,038 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:48,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:19:48,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:48,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:48,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:48,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494388054] [2025-03-04 02:19:48,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494388054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256283566] [2025-03-04 02:19:48,320 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:48,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:48,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:48,325 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:48,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 02:19:48,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:19:48,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:48,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:48,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:48,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 02:19:48,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:48,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:48,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:48,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 27 [2025-03-04 02:19:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256283566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:48,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2025-03-04 02:19:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485331787] [2025-03-04 02:19:48,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:48,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:19:48,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:48,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:19:48,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:19:48,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:48,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 370 transitions, 6440 flow. Second operand has 20 states, 20 states have (on average 6.0) internal successors, (120), 20 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-03-04 02:19:48,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:48,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:48,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:50,020 INFO L124 PetriNetUnfolderBase]: 3189/5882 cut-off events. [2025-03-04 02:19:50,020 INFO L125 PetriNetUnfolderBase]: For 57136/57136 co-relation queries the response was YES. [2025-03-04 02:19:50,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30157 conditions, 5882 events. 3189/5882 cut-off events. For 57136/57136 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 41089 event pairs, 1884 based on Foata normal form. 16/5898 useless extension candidates. Maximal degree in co-relation 30083. Up to 4542 conditions per place. [2025-03-04 02:19:50,064 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 297 selfloop transitions, 121 changer transitions 7/426 dead transitions. [2025-03-04 02:19:50,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 426 transitions, 7542 flow [2025-03-04 02:19:50,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:19:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:19:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 152 transitions. [2025-03-04 02:19:50,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2025-03-04 02:19:50,065 INFO L175 Difference]: Start difference. First operand has 284 places, 370 transitions, 6440 flow. Second operand 16 states and 152 transitions. [2025-03-04 02:19:50,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 426 transitions, 7542 flow [2025-03-04 02:19:50,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 426 transitions, 7313 flow, removed 12 selfloop flow, removed 14 redundant places. [2025-03-04 02:19:50,352 INFO L231 Difference]: Finished difference. Result has 284 places, 371 transitions, 6490 flow [2025-03-04 02:19:50,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=6150, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6490, PETRI_PLACES=284, PETRI_TRANSITIONS=371} [2025-03-04 02:19:50,353 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 259 predicate places. [2025-03-04 02:19:50,353 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 371 transitions, 6490 flow [2025-03-04 02:19:50,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.0) internal successors, (120), 20 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-03-04 02:19:50,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:50,353 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:50,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 02:19:50,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:50,554 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:50,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash 947920726, now seen corresponding path program 20 times [2025-03-04 02:19:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995874993] [2025-03-04 02:19:50,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:50,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:50,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:19:50,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:50,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:50,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:50,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:50,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995874993] [2025-03-04 02:19:50,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995874993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:50,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:50,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:19:50,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443704778] [2025-03-04 02:19:50,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:50,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:19:50,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:50,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:19:50,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:19:50,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:50,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 371 transitions, 6490 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-03-04 02:19:50,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:50,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:50,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:52,085 INFO L124 PetriNetUnfolderBase]: 3446/6328 cut-off events. [2025-03-04 02:19:52,086 INFO L125 PetriNetUnfolderBase]: For 61909/61909 co-relation queries the response was YES. [2025-03-04 02:19:52,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32384 conditions, 6328 events. 3446/6328 cut-off events. For 61909/61909 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 44842 event pairs, 2240 based on Foata normal form. 2/6330 useless extension candidates. Maximal degree in co-relation 32311. Up to 5218 conditions per place. [2025-03-04 02:19:52,136 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 352 selfloop transitions, 62 changer transitions 7/422 dead transitions. [2025-03-04 02:19:52,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 422 transitions, 7940 flow [2025-03-04 02:19:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:19:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:19:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-03-04 02:19:52,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36752136752136755 [2025-03-04 02:19:52,137 INFO L175 Difference]: Start difference. First operand has 284 places, 371 transitions, 6490 flow. Second operand 9 states and 86 transitions. [2025-03-04 02:19:52,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 422 transitions, 7940 flow [2025-03-04 02:19:52,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 422 transitions, 7854 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-03-04 02:19:52,494 INFO L231 Difference]: Finished difference. Result has 284 places, 386 transitions, 6874 flow [2025-03-04 02:19:52,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=6383, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6874, PETRI_PLACES=284, PETRI_TRANSITIONS=386} [2025-03-04 02:19:52,495 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 259 predicate places. [2025-03-04 02:19:52,495 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 386 transitions, 6874 flow [2025-03-04 02:19:52,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-03-04 02:19:52,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:52,495 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:52,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 02:19:52,495 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:52,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1587755908, now seen corresponding path program 21 times [2025-03-04 02:19:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:52,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480845575] [2025-03-04 02:19:52,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:52,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:52,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:52,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:19:52,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:52,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:52,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480845575] [2025-03-04 02:19:52,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480845575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122252276] [2025-03-04 02:19:52,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:52,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:52,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:52,766 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:52,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 02:19:52,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:52,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:19:52,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:52,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:52,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 02:19:52,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:52,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 59 [2025-03-04 02:19:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:53,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:53,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:53,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 30 [2025-03-04 02:19:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:53,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122252276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:53,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:53,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 22 [2025-03-04 02:19:53,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216470930] [2025-03-04 02:19:53,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:53,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:19:53,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:53,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:19:53,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:19:53,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:53,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 386 transitions, 6874 flow. Second operand has 22 states, 22 states have (on average 5.363636363636363) internal successors, (118), 22 states have internal predecessors, (118), 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-03-04 02:19:53,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:53,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:53,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:54,285 INFO L124 PetriNetUnfolderBase]: 3411/6263 cut-off events. [2025-03-04 02:19:54,285 INFO L125 PetriNetUnfolderBase]: For 63953/63953 co-relation queries the response was YES. [2025-03-04 02:19:54,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33771 conditions, 6263 events. 3411/6263 cut-off events. For 63953/63953 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 44014 event pairs, 1446 based on Foata normal form. 2/6265 useless extension candidates. Maximal degree in co-relation 33697. Up to 3185 conditions per place. [2025-03-04 02:19:54,341 INFO L140 encePairwiseOnDemand]: 16/26 looper letters, 268 selfloop transitions, 167 changer transitions 15/451 dead transitions. [2025-03-04 02:19:54,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 451 transitions, 8142 flow [2025-03-04 02:19:54,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:19:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:19:54,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 163 transitions. [2025-03-04 02:19:54,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3482905982905983 [2025-03-04 02:19:54,342 INFO L175 Difference]: Start difference. First operand has 284 places, 386 transitions, 6874 flow. Second operand 18 states and 163 transitions. [2025-03-04 02:19:54,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 451 transitions, 8142 flow [2025-03-04 02:19:54,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 451 transitions, 8008 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-03-04 02:19:54,763 INFO L231 Difference]: Finished difference. Result has 298 places, 391 transitions, 7192 flow [2025-03-04 02:19:54,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=6754, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7192, PETRI_PLACES=298, PETRI_TRANSITIONS=391} [2025-03-04 02:19:54,764 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 273 predicate places. [2025-03-04 02:19:54,764 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 391 transitions, 7192 flow [2025-03-04 02:19:54,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.363636363636363) internal successors, (118), 22 states have internal predecessors, (118), 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-03-04 02:19:54,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:54,764 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:54,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 02:19:54,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:54,964 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:54,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:54,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1384210962, now seen corresponding path program 22 times [2025-03-04 02:19:54,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:54,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378645523] [2025-03-04 02:19:54,965 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:54,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:54,971 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:19:54,979 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:54,979 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:19:54,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378645523] [2025-03-04 02:19:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378645523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959670346] [2025-03-04 02:19:55,241 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:55,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:55,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:55,243 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:55,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 02:19:55,317 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:19:55,336 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:55,336 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:19:55,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:55,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:19:55,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:55,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:55,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:55,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 27 [2025-03-04 02:19:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:55,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959670346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:55,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:55,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-03-04 02:19:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590793245] [2025-03-04 02:19:55,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:55,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:19:55,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:55,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:19:55,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:19:55,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:55,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 391 transitions, 7192 flow. Second operand has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 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-03-04 02:19:55,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:55,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:55,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:56,675 INFO L124 PetriNetUnfolderBase]: 3443/6291 cut-off events. [2025-03-04 02:19:56,675 INFO L125 PetriNetUnfolderBase]: For 76448/76448 co-relation queries the response was YES. [2025-03-04 02:19:56,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36032 conditions, 6291 events. 3443/6291 cut-off events. For 76448/76448 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 44173 event pairs, 2224 based on Foata normal form. 24/6315 useless extension candidates. Maximal degree in co-relation 35954. Up to 5289 conditions per place. [2025-03-04 02:19:56,736 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 373 selfloop transitions, 50 changer transitions 5/429 dead transitions. [2025-03-04 02:19:56,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 429 transitions, 8393 flow [2025-03-04 02:19:56,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:19:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:19:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2025-03-04 02:19:56,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-04 02:19:56,737 INFO L175 Difference]: Start difference. First operand has 298 places, 391 transitions, 7192 flow. Second operand 9 states and 91 transitions. [2025-03-04 02:19:56,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 429 transitions, 8393 flow [2025-03-04 02:19:57,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 429 transitions, 8292 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-03-04 02:19:57,201 INFO L231 Difference]: Finished difference. Result has 295 places, 394 transitions, 7286 flow [2025-03-04 02:19:57,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=7072, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7286, PETRI_PLACES=295, PETRI_TRANSITIONS=394} [2025-03-04 02:19:57,202 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 270 predicate places. [2025-03-04 02:19:57,202 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 394 transitions, 7286 flow [2025-03-04 02:19:57,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 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-03-04 02:19:57,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:57,202 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:57,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 02:19:57,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 02:19:57,403 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:57,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:57,403 INFO L85 PathProgramCache]: Analyzing trace with hash 345252636, now seen corresponding path program 23 times [2025-03-04 02:19:57,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:57,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844123936] [2025-03-04 02:19:57,404 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:57,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:57,409 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:57,414 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:57,415 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:19:57,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:57,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844123936] [2025-03-04 02:19:57,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844123936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237847852] [2025-03-04 02:19:57,535 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:57,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:57,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:57,539 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:57,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 02:19:57,606 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:57,624 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:57,624 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:19:57,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:57,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 02:19:57,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:57,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 72 [2025-03-04 02:19:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:57,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:57,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:57,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2025-03-04 02:19:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:57,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237847852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:57,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:57,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 02:19:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200455940] [2025-03-04 02:19:57,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:57,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:19:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:57,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:19:57,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:19:57,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:19:57,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 394 transitions, 7286 flow. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 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-03-04 02:19:57,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:57,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:19:57,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:58,872 INFO L124 PetriNetUnfolderBase]: 3456/6295 cut-off events. [2025-03-04 02:19:58,872 INFO L125 PetriNetUnfolderBase]: For 77468/77468 co-relation queries the response was YES. [2025-03-04 02:19:58,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36241 conditions, 6295 events. 3456/6295 cut-off events. For 77468/77468 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 44018 event pairs, 2190 based on Foata normal form. 27/6322 useless extension candidates. Maximal degree in co-relation 36163. Up to 5154 conditions per place. [2025-03-04 02:19:58,918 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 365 selfloop transitions, 53 changer transitions 4/423 dead transitions. [2025-03-04 02:19:58,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 423 transitions, 8345 flow [2025-03-04 02:19:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-03-04 02:19:58,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45604395604395603 [2025-03-04 02:19:58,919 INFO L175 Difference]: Start difference. First operand has 295 places, 394 transitions, 7286 flow. Second operand 7 states and 83 transitions. [2025-03-04 02:19:58,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 423 transitions, 8345 flow [2025-03-04 02:19:59,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 423 transitions, 8207 flow, removed 17 selfloop flow, removed 10 redundant places. [2025-03-04 02:19:59,318 INFO L231 Difference]: Finished difference. Result has 292 places, 389 transitions, 7208 flow [2025-03-04 02:19:59,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=7031, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7208, PETRI_PLACES=292, PETRI_TRANSITIONS=389} [2025-03-04 02:19:59,318 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 267 predicate places. [2025-03-04 02:19:59,318 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 389 transitions, 7208 flow [2025-03-04 02:19:59,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 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-03-04 02:19:59,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:59,319 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:59,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 02:19:59,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 02:19:59,519 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:59,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1772454774, now seen corresponding path program 24 times [2025-03-04 02:19:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:59,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491608286] [2025-03-04 02:19:59,520 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:59,525 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:59,535 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:59,535 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:59,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:59,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:59,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491608286] [2025-03-04 02:19:59,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491608286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:59,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769462966] [2025-03-04 02:19:59,814 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:59,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:59,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:59,816 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:59,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 02:19:59,895 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:59,918 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:59,918 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:59,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:59,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 02:19:59,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:00,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 59 [2025-03-04 02:20:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:00,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:00,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:00,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 69 [2025-03-04 02:20:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:00,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769462966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:00,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:00,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 22 [2025-03-04 02:20:00,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552509900] [2025-03-04 02:20:00,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:00,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:20:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:00,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:20:00,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:20:00,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:20:00,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 389 transitions, 7208 flow. Second operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 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-03-04 02:20:00,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:00,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:20:00,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:02,215 INFO L124 PetriNetUnfolderBase]: 3471/6301 cut-off events. [2025-03-04 02:20:02,215 INFO L125 PetriNetUnfolderBase]: For 76977/76977 co-relation queries the response was YES. [2025-03-04 02:20:02,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36337 conditions, 6301 events. 3471/6301 cut-off events. For 76977/76977 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 43927 event pairs, 907 based on Foata normal form. 21/6322 useless extension candidates. Maximal degree in co-relation 36261. Up to 2361 conditions per place. [2025-03-04 02:20:02,273 INFO L140 encePairwiseOnDemand]: 16/26 looper letters, 283 selfloop transitions, 231 changer transitions 6/521 dead transitions. [2025-03-04 02:20:02,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 521 transitions, 9718 flow [2025-03-04 02:20:02,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:20:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:20:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 185 transitions. [2025-03-04 02:20:02,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37449392712550605 [2025-03-04 02:20:02,274 INFO L175 Difference]: Start difference. First operand has 292 places, 389 transitions, 7208 flow. Second operand 19 states and 185 transitions. [2025-03-04 02:20:02,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 521 transitions, 9718 flow [2025-03-04 02:20:02,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 521 transitions, 9559 flow, removed 29 selfloop flow, removed 9 redundant places. [2025-03-04 02:20:02,739 INFO L231 Difference]: Finished difference. Result has 303 places, 426 transitions, 8570 flow [2025-03-04 02:20:02,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=6939, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8570, PETRI_PLACES=303, PETRI_TRANSITIONS=426} [2025-03-04 02:20:02,740 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 278 predicate places. [2025-03-04 02:20:02,740 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 426 transitions, 8570 flow [2025-03-04 02:20:02,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 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-03-04 02:20:02,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:02,740 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:02,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-04 02:20:02,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 02:20:02,940 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:02,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:02,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1542192074, now seen corresponding path program 25 times [2025-03-04 02:20:02,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:02,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869437555] [2025-03-04 02:20:02,941 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:02,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:02,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:20:02,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:02,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:02,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869437555] [2025-03-04 02:20:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869437555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464198541] [2025-03-04 02:20:03,181 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:03,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:03,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:03,182 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:03,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 02:20:03,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:20:03,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:03,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:03,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:03,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 02:20:03,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:03,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:03,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:03,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 27 [2025-03-04 02:20:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:03,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464198541] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:03,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:03,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 21 [2025-03-04 02:20:03,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329961994] [2025-03-04 02:20:03,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:03,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:20:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:03,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:20:03,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:20:03,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:20:03,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 426 transitions, 8570 flow. Second operand has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 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-03-04 02:20:03,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:03,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:20:03,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:04,826 INFO L124 PetriNetUnfolderBase]: 3270/6007 cut-off events. [2025-03-04 02:20:04,826 INFO L125 PetriNetUnfolderBase]: For 97001/97001 co-relation queries the response was YES. [2025-03-04 02:20:04,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38601 conditions, 6007 events. 3270/6007 cut-off events. For 97001/97001 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 42146 event pairs, 1605 based on Foata normal form. 18/6025 useless extension candidates. Maximal degree in co-relation 38523. Up to 4711 conditions per place. [2025-03-04 02:20:04,877 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 354 selfloop transitions, 123 changer transitions 4/482 dead transitions. [2025-03-04 02:20:04,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 482 transitions, 9975 flow [2025-03-04 02:20:04,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:20:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:20:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 144 transitions. [2025-03-04 02:20:04,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36923076923076925 [2025-03-04 02:20:04,878 INFO L175 Difference]: Start difference. First operand has 303 places, 426 transitions, 8570 flow. Second operand 15 states and 144 transitions. [2025-03-04 02:20:04,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 482 transitions, 9975 flow [2025-03-04 02:20:05,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 482 transitions, 9761 flow, removed 79 selfloop flow, removed 8 redundant places. [2025-03-04 02:20:05,378 INFO L231 Difference]: Finished difference. Result has 312 places, 429 transitions, 8721 flow [2025-03-04 02:20:05,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=8340, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8721, PETRI_PLACES=312, PETRI_TRANSITIONS=429} [2025-03-04 02:20:05,379 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 287 predicate places. [2025-03-04 02:20:05,379 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 429 transitions, 8721 flow [2025-03-04 02:20:05,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 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-03-04 02:20:05,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:05,379 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:05,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 02:20:05,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:05,580 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:05,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:05,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1521275408, now seen corresponding path program 26 times [2025-03-04 02:20:05,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:05,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59716140] [2025-03-04 02:20:05,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:05,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:05,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:05,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:05,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:05,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:05,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:05,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59716140] [2025-03-04 02:20:05,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59716140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:05,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657332823] [2025-03-04 02:20:05,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:05,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:05,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:05,820 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:05,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 02:20:05,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:05,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:05,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:05,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:05,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 02:20:05,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:06,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 50 [2025-03-04 02:20:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:06,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:06,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:06,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 55 [2025-03-04 02:20:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:06,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657332823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:06,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:06,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2025-03-04 02:20:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233020442] [2025-03-04 02:20:06,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:06,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:20:06,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:06,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:20:06,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:20:06,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:20:06,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 429 transitions, 8721 flow. Second operand has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 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-03-04 02:20:06,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:06,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:20:06,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:07,835 INFO L124 PetriNetUnfolderBase]: 3271/6014 cut-off events. [2025-03-04 02:20:07,835 INFO L125 PetriNetUnfolderBase]: For 88546/88546 co-relation queries the response was YES. [2025-03-04 02:20:07,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36888 conditions, 6014 events. 3271/6014 cut-off events. For 88546/88546 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 42136 event pairs, 902 based on Foata normal form. 2/6016 useless extension candidates. Maximal degree in co-relation 36810. Up to 1938 conditions per place. [2025-03-04 02:20:07,898 INFO L140 encePairwiseOnDemand]: 16/26 looper letters, 280 selfloop transitions, 230 changer transitions 9/520 dead transitions. [2025-03-04 02:20:07,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 520 transitions, 10590 flow [2025-03-04 02:20:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:20:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:20:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 164 transitions. [2025-03-04 02:20:07,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3319838056680162 [2025-03-04 02:20:07,899 INFO L175 Difference]: Start difference. First operand has 312 places, 429 transitions, 8721 flow. Second operand 19 states and 164 transitions. [2025-03-04 02:20:07,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 520 transitions, 10590 flow [2025-03-04 02:20:08,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 520 transitions, 10469 flow, removed 27 selfloop flow, removed 9 redundant places. [2025-03-04 02:20:08,412 INFO L231 Difference]: Finished difference. Result has 322 places, 438 transitions, 9189 flow [2025-03-04 02:20:08,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=8610, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=9189, PETRI_PLACES=322, PETRI_TRANSITIONS=438} [2025-03-04 02:20:08,413 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 297 predicate places. [2025-03-04 02:20:08,413 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 438 transitions, 9189 flow [2025-03-04 02:20:08,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 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-03-04 02:20:08,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:08,413 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:08,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-04 02:20:08,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:08,616 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:08,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1939305296, now seen corresponding path program 27 times [2025-03-04 02:20:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:08,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807497861] [2025-03-04 02:20:08,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:08,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:20:08,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:20:08,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:08,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:08,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807497861] [2025-03-04 02:20:08,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807497861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:08,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557763856] [2025-03-04 02:20:08,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:08,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:08,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:08,849 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:08,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 02:20:08,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:20:08,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:20:08,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:08,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:08,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 02:20:08,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:09,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:09,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:09,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2025-03-04 02:20:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:09,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557763856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:09,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:09,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-03-04 02:20:09,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975360983] [2025-03-04 02:20:09,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:09,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:20:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:09,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:20:09,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:20:09,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:20:09,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 438 transitions, 9189 flow. Second operand has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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-03-04 02:20:09,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:09,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:20:09,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:10,594 INFO L124 PetriNetUnfolderBase]: 3338/6111 cut-off events. [2025-03-04 02:20:10,594 INFO L125 PetriNetUnfolderBase]: For 96494/96494 co-relation queries the response was YES. [2025-03-04 02:20:10,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38776 conditions, 6111 events. 3338/6111 cut-off events. For 96494/96494 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 42584 event pairs, 407 based on Foata normal form. 20/6131 useless extension candidates. Maximal degree in co-relation 38698. Up to 2367 conditions per place. [2025-03-04 02:20:10,656 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 315 selfloop transitions, 208 changer transitions 3/527 dead transitions. [2025-03-04 02:20:10,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 527 transitions, 11105 flow [2025-03-04 02:20:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:20:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:20:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 167 transitions. [2025-03-04 02:20:10,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35683760683760685 [2025-03-04 02:20:10,657 INFO L175 Difference]: Start difference. First operand has 322 places, 438 transitions, 9189 flow. Second operand 18 states and 167 transitions. [2025-03-04 02:20:10,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 527 transitions, 11105 flow [2025-03-04 02:20:11,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 527 transitions, 10645 flow, removed 13 selfloop flow, removed 10 redundant places. [2025-03-04 02:20:11,151 INFO L231 Difference]: Finished difference. Result has 331 places, 452 transitions, 9502 flow [2025-03-04 02:20:11,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=8744, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=9502, PETRI_PLACES=331, PETRI_TRANSITIONS=452} [2025-03-04 02:20:11,152 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 306 predicate places. [2025-03-04 02:20:11,152 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 452 transitions, 9502 flow [2025-03-04 02:20:11,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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-03-04 02:20:11,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:11,153 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:11,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-04 02:20:11,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:11,353 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:11,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash -378453768, now seen corresponding path program 28 times [2025-03-04 02:20:11,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:11,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122882364] [2025-03-04 02:20:11,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:11,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:11,359 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:11,365 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:11,365 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:11,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:11,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122882364] [2025-03-04 02:20:11,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122882364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455557456] [2025-03-04 02:20:11,632 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:11,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:11,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:11,634 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:11,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 02:20:11,716 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:11,738 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:11,738 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:11,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:11,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:20:11,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:11,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 50 [2025-03-04 02:20:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:11,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:12,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:12,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 61 [2025-03-04 02:20:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:12,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455557456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:12,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:12,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-03-04 02:20:12,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43858928] [2025-03-04 02:20:12,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:12,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:20:12,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:12,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:20:12,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:20:12,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:20:12,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 452 transitions, 9502 flow. Second operand has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 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-03-04 02:20:12,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:12,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:20:12,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand