./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:32:58,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:32:58,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:32:58,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:32:58,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:32:58,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:32:58,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:32:58,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:32:58,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:32:58,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:32:58,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:32:58,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:32:58,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:32:58,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:32:58,663 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:32:58,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:32:58,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:32:58,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:32:58,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:32:58,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:32:58,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:32:58,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:32:58,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:32:58,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:32:58,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:32:58,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:32:58,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:32:58,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:32:58,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:32:58,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:32:58,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:32:58,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:32:58,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:32:58,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:32:58,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:32:58,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:32:58,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:32:58,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:32:58,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:32:58,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:32:58,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:32:58,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:32:58,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:32:58,665 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-jdk21/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 -> b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a [2025-02-06 04:32:58,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:32:58,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:32:58,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:32:58,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:32:58,879 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:32:58,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-02-06 04:33:00,016 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19ef3f719/b395c281e5494567bf6a260472783967/FLAG97cbbf2fa [2025-02-06 04:33:00,229 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:33:00,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-02-06 04:33:00,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19ef3f719/b395c281e5494567bf6a260472783967/FLAG97cbbf2fa [2025-02-06 04:33:00,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19ef3f719/b395c281e5494567bf6a260472783967 [2025-02-06 04:33:00,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:33:00,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:33:00,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:33:00,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:33:00,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:33:00,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397e8066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00, skipping insertion in model container [2025-02-06 04:33:00,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:33:00,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c[2592,2605] [2025-02-06 04:33:00,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:33:00,811 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:33:00,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c[2592,2605] [2025-02-06 04:33:00,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:33:00,861 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:33:00,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00 WrapperNode [2025-02-06 04:33:00,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:33:00,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:33:00,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:33:00,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:33:00,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,893 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 157 [2025-02-06 04:33:00,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:33:00,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:33:00,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:33:00,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:33:00,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,920 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-06 04:33:00,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:33:00,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:33:00,937 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:33:00,937 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:33:00,938 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (1/1) ... [2025-02-06 04:33:00,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:33:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:33:00,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:33:00,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:33:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:33:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:33:00,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:33:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:33:00,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:33:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:33:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:33:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:33:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:33:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:33:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:33:00,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:33:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:33:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:33:00,993 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:33:01,131 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:33:01,132 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:33:01,396 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:33:01,396 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:33:01,519 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:33:01,519 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:33:01,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:33:01 BoogieIcfgContainer [2025-02-06 04:33:01,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:33:01,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:33:01,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:33:01,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:33:01,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:33:00" (1/3) ... [2025-02-06 04:33:01,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a60792b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:33:01, skipping insertion in model container [2025-02-06 04:33:01,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:33:00" (2/3) ... [2025-02-06 04:33:01,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a60792b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:33:01, skipping insertion in model container [2025-02-06 04:33:01,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:33:01" (3/3) ... [2025-02-06 04:33:01,526 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-02-06 04:33:01,535 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:33:01,536 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-06 04:33:01,536 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:33:01,572 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:33:01,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 70 flow [2025-02-06 04:33:01,610 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-02-06 04:33:01,628 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:33:01,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 6/26 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/19 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-02-06 04:33:01,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 28 transitions, 70 flow [2025-02-06 04:33:01,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 25 transitions, 62 flow [2025-02-06 04:33:01,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:33:01,669 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;@2250fcac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:33:01,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:33:01,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:33:01,683 INFO L124 PetriNetUnfolderBase]: 6/24 cut-off events. [2025-02-06 04:33:01,683 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:33:01,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:01,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:01,689 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-02-06 04:33:01,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash 799210622, now seen corresponding path program 1 times [2025-02-06 04:33:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:01,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268184099] [2025-02-06 04:33:01,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:01,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:01,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:33:01,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:33:01,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:01,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:33:01,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:01,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268184099] [2025-02-06 04:33:01,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268184099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:01,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:01,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:33:01,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329714965] [2025-02-06 04:33:01,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:01,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:33:01,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:01,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:33:01,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:33:01,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-02-06 04:33:01,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:01,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:01,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-02-06 04:33:01,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:02,083 INFO L124 PetriNetUnfolderBase]: 232/391 cut-off events. [2025-02-06 04:33:02,083 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 04:33:02,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 391 events. 232/391 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1495 event pairs, 64 based on Foata normal form. 5/320 useless extension candidates. Maximal degree in co-relation 708. Up to 177 conditions per place. [2025-02-06 04:33:02,087 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 43 selfloop transitions, 5 changer transitions 2/52 dead transitions. [2025-02-06 04:33:02,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 52 transitions, 234 flow [2025-02-06 04:33:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:33:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:33:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-02-06 04:33:02,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-02-06 04:33:02,096 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 62 flow. Second operand 5 states and 71 transitions. [2025-02-06 04:33:02,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 52 transitions, 234 flow [2025-02-06 04:33:02,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:33:02,101 INFO L231 Difference]: Finished difference. Result has 28 places, 27 transitions, 78 flow [2025-02-06 04:33:02,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=28, PETRI_TRANSITIONS=27} [2025-02-06 04:33:02,104 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2025-02-06 04:33:02,105 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 78 flow [2025-02-06 04:33:02,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:02,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:02,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:02,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:33:02,105 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-02-06 04:33:02,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:02,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1590349240, now seen corresponding path program 2 times [2025-02-06 04:33:02,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:02,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395835168] [2025-02-06 04:33:02,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:33:02,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:02,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:33:02,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:33:02,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:33:02,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:33:02,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395835168] [2025-02-06 04:33:02,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395835168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:02,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:02,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:33:02,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603359191] [2025-02-06 04:33:02,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:02,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:33:02,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:02,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:33:02,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:33:02,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-02-06 04:33:02,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:02,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:02,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-02-06 04:33:02,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:02,321 INFO L124 PetriNetUnfolderBase]: 422/728 cut-off events. [2025-02-06 04:33:02,321 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-02-06 04:33:02,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 728 events. 422/728 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3145 event pairs, 156 based on Foata normal form. 4/637 useless extension candidates. Maximal degree in co-relation 587. Up to 358 conditions per place. [2025-02-06 04:33:02,325 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 44 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2025-02-06 04:33:02,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 52 transitions, 243 flow [2025-02-06 04:33:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:33:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:33:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-02-06 04:33:02,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2025-02-06 04:33:02,326 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 78 flow. Second operand 5 states and 67 transitions. [2025-02-06 04:33:02,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 52 transitions, 243 flow [2025-02-06 04:33:02,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 52 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:33:02,328 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 96 flow [2025-02-06 04:33:02,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2025-02-06 04:33:02,328 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2025-02-06 04:33:02,328 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 96 flow [2025-02-06 04:33:02,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:02,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:02,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:02,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:33:02,329 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-02-06 04:33:02,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:02,329 INFO L85 PathProgramCache]: Analyzing trace with hash -678935278, now seen corresponding path program 3 times [2025-02-06 04:33:02,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:02,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158529950] [2025-02-06 04:33:02,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:33:02,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:02,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:33:02,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:33:02,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:33:02,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:33:02,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:02,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158529950] [2025-02-06 04:33:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158529950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:02,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:02,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:33:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109221335] [2025-02-06 04:33:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:02,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:33:02,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:02,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:33:02,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:33:02,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-02-06 04:33:02,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:02,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:02,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-02-06 04:33:02,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:02,535 INFO L124 PetriNetUnfolderBase]: 544/948 cut-off events. [2025-02-06 04:33:02,536 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2025-02-06 04:33:02,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2227 conditions, 948 events. 544/948 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4486 event pairs, 185 based on Foata normal form. 21/968 useless extension candidates. Maximal degree in co-relation 1260. Up to 691 conditions per place. [2025-02-06 04:33:02,540 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 41 selfloop transitions, 4 changer transitions 2/50 dead transitions. [2025-02-06 04:33:02,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 255 flow [2025-02-06 04:33:02,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:33:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:33:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-06 04:33:02,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-02-06 04:33:02,541 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 96 flow. Second operand 4 states and 60 transitions. [2025-02-06 04:33:02,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 255 flow [2025-02-06 04:33:02,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:33:02,543 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 134 flow [2025-02-06 04:33:02,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2025-02-06 04:33:02,543 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2025-02-06 04:33:02,543 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 134 flow [2025-02-06 04:33:02,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:02,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:02,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:02,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:33:02,544 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-02-06 04:33:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1748402252, now seen corresponding path program 4 times [2025-02-06 04:33:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289821919] [2025-02-06 04:33:02,545 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:33:02,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:02,552 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-02-06 04:33:02,554 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 17 statements. [2025-02-06 04:33:02,554 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:33:02,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:33:02,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:02,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289821919] [2025-02-06 04:33:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289821919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:02,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:33:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719524371] [2025-02-06 04:33:02,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:02,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:33:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:02,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:33:02,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:33:02,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-02-06 04:33:02,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:02,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:02,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-02-06 04:33:02,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:02,697 INFO L124 PetriNetUnfolderBase]: 542/957 cut-off events. [2025-02-06 04:33:02,697 INFO L125 PetriNetUnfolderBase]: For 627/627 co-relation queries the response was YES. [2025-02-06 04:33:02,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 957 events. 542/957 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4501 event pairs, 215 based on Foata normal form. 16/971 useless extension candidates. Maximal degree in co-relation 1387. Up to 689 conditions per place. [2025-02-06 04:33:02,701 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 43 selfloop transitions, 6 changer transitions 3/55 dead transitions. [2025-02-06 04:33:02,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 316 flow [2025-02-06 04:33:02,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:33:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:33:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-02-06 04:33:02,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2025-02-06 04:33:02,703 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 134 flow. Second operand 4 states and 61 transitions. [2025-02-06 04:33:02,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 316 flow [2025-02-06 04:33:02,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 316 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:33:02,705 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 194 flow [2025-02-06 04:33:02,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-02-06 04:33:02,705 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-02-06 04:33:02,706 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 194 flow [2025-02-06 04:33:02,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:02,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:02,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:02,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:33:02,706 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-02-06 04:33:02,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1481537830, now seen corresponding path program 1 times [2025-02-06 04:33:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:02,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762231783] [2025-02-06 04:33:02,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:02,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:02,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:33:02,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:33:02,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:02,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:33:02,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:02,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762231783] [2025-02-06 04:33:02,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762231783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:02,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:02,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:33:02,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443268180] [2025-02-06 04:33:02,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:02,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:33:02,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:02,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:33:02,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:33:02,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-02-06 04:33:02,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:02,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:02,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-02-06 04:33:02,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:02,873 INFO L124 PetriNetUnfolderBase]: 501/869 cut-off events. [2025-02-06 04:33:02,873 INFO L125 PetriNetUnfolderBase]: For 993/993 co-relation queries the response was YES. [2025-02-06 04:33:02,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 869 events. 501/869 cut-off events. For 993/993 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3977 event pairs, 186 based on Foata normal form. 14/880 useless extension candidates. Maximal degree in co-relation 999. Up to 443 conditions per place. [2025-02-06 04:33:02,877 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 50 selfloop transitions, 8 changer transitions 3/64 dead transitions. [2025-02-06 04:33:02,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 411 flow [2025-02-06 04:33:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:33:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:33:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-02-06 04:33:02,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2025-02-06 04:33:02,878 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 194 flow. Second operand 4 states and 67 transitions. [2025-02-06 04:33:02,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 411 flow [2025-02-06 04:33:02,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 405 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 04:33:02,881 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 210 flow [2025-02-06 04:33:02,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-02-06 04:33:02,882 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2025-02-06 04:33:02,882 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 210 flow [2025-02-06 04:33:02,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:02,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:02,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:02,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:33:02,882 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-02-06 04:33:02,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:02,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2003053229, now seen corresponding path program 1 times [2025-02-06 04:33:02,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:02,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319670628] [2025-02-06 04:33:02,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:02,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:02,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:33:02,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:33:02,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:02,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:33:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319670628] [2025-02-06 04:33:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319670628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:02,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:02,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:33:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083847016] [2025-02-06 04:33:02,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:02,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:33:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:02,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:33:02,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:33:02,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-02-06 04:33:02,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:02,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:02,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-02-06 04:33:02,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:03,042 INFO L124 PetriNetUnfolderBase]: 481/815 cut-off events. [2025-02-06 04:33:03,042 INFO L125 PetriNetUnfolderBase]: For 1361/1361 co-relation queries the response was YES. [2025-02-06 04:33:03,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2377 conditions, 815 events. 481/815 cut-off events. For 1361/1361 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3478 event pairs, 175 based on Foata normal form. 16/828 useless extension candidates. Maximal degree in co-relation 2213. Up to 433 conditions per place. [2025-02-06 04:33:03,046 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 49 selfloop transitions, 8 changer transitions 2/61 dead transitions. [2025-02-06 04:33:03,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 433 flow [2025-02-06 04:33:03,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:33:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:33:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-02-06 04:33:03,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-02-06 04:33:03,047 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 210 flow. Second operand 4 states and 63 transitions. [2025-02-06 04:33:03,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 433 flow [2025-02-06 04:33:03,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 407 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-06 04:33:03,049 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 214 flow [2025-02-06 04:33:03,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-02-06 04:33:03,050 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2025-02-06 04:33:03,050 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 214 flow [2025-02-06 04:33:03,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:03,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:03,050 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-02-06 04:33:03,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:33:03,050 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-02-06 04:33:03,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:03,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1582690021, now seen corresponding path program 1 times [2025-02-06 04:33:03,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:03,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681879255] [2025-02-06 04:33:03,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:03,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:03,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:33:03,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:33:03,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:03,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:33:03,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:03,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681879255] [2025-02-06 04:33:03,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681879255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:03,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:03,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:33:03,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651280569] [2025-02-06 04:33:03,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:03,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:33:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:03,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:33:03,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:33:03,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:03,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:03,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:03,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:03,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:03,173 INFO L124 PetriNetUnfolderBase]: 444/776 cut-off events. [2025-02-06 04:33:03,173 INFO L125 PetriNetUnfolderBase]: For 1136/1136 co-relation queries the response was YES. [2025-02-06 04:33:03,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 776 events. 444/776 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3433 event pairs, 287 based on Foata normal form. 0/772 useless extension candidates. Maximal degree in co-relation 2129. Up to 736 conditions per place. [2025-02-06 04:33:03,177 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 32 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-02-06 04:33:03,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 290 flow [2025-02-06 04:33:03,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:33:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:33:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-02-06 04:33:03,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-02-06 04:33:03,178 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 214 flow. Second operand 3 states and 41 transitions. [2025-02-06 04:33:03,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 290 flow [2025-02-06 04:33:03,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 278 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 04:33:03,180 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 224 flow [2025-02-06 04:33:03,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-02-06 04:33:03,180 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 19 predicate places. [2025-02-06 04:33:03,181 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 224 flow [2025-02-06 04:33:03,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:03,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:03,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:03,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:33:03,181 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-02-06 04:33:03,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1864720955, now seen corresponding path program 1 times [2025-02-06 04:33:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017096799] [2025-02-06 04:33:03,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:03,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:33:03,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:33:03,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:03,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:33:03,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:03,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017096799] [2025-02-06 04:33:03,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017096799] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:33:03,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116867196] [2025-02-06 04:33:03,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:03,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:03,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:33:03,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:33:03,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:33:03,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:33:03,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:33:03,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:03,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:03,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 04:33:03,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:33:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:33:03,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:33:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:33:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116867196] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:33:03,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:33:03,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-02-06 04:33:03,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417314427] [2025-02-06 04:33:03,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:33:03,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:33:03,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:03,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:33:03,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:33:03,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:03,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 224 flow. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:03,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:03,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:03,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:03,496 INFO L124 PetriNetUnfolderBase]: 447/785 cut-off events. [2025-02-06 04:33:03,496 INFO L125 PetriNetUnfolderBase]: For 936/936 co-relation queries the response was YES. [2025-02-06 04:33:03,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 785 events. 447/785 cut-off events. For 936/936 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3477 event pairs, 290 based on Foata normal form. 3/785 useless extension candidates. Maximal degree in co-relation 2242. Up to 741 conditions per place. [2025-02-06 04:33:03,500 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 32 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2025-02-06 04:33:03,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 332 flow [2025-02-06 04:33:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:33:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:33:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-02-06 04:33:03,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-02-06 04:33:03,501 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 224 flow. Second operand 6 states and 66 transitions. [2025-02-06 04:33:03,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 332 flow [2025-02-06 04:33:03,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:33:03,504 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 286 flow [2025-02-06 04:33:03,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2025-02-06 04:33:03,504 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-02-06 04:33:03,504 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 286 flow [2025-02-06 04:33:03,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:03,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:03,505 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:03,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:33:03,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:03,709 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-02-06 04:33:03,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:03,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1801215179, now seen corresponding path program 2 times [2025-02-06 04:33:03,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:03,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109409253] [2025-02-06 04:33:03,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:33:03,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:03,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:33:03,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 27 statements. [2025-02-06 04:33:03,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:33:03,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 04:33:04,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:04,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109409253] [2025-02-06 04:33:04,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109409253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:04,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:04,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:04,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384036918] [2025-02-06 04:33:04,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:04,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:04,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:04,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:04,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:04,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:04,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 286 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:04,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:04,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:04,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:05,228 INFO L124 PetriNetUnfolderBase]: 588/1096 cut-off events. [2025-02-06 04:33:05,229 INFO L125 PetriNetUnfolderBase]: For 1314/1314 co-relation queries the response was YES. [2025-02-06 04:33:05,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3105 conditions, 1096 events. 588/1096 cut-off events. For 1314/1314 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5711 event pairs, 42 based on Foata normal form. 2/1097 useless extension candidates. Maximal degree in co-relation 3034. Up to 219 conditions per place. [2025-02-06 04:33:05,235 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 102 selfloop transitions, 62 changer transitions 7/174 dead transitions. [2025-02-06 04:33:05,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 174 transitions, 1154 flow [2025-02-06 04:33:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 04:33:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 04:33:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 241 transitions. [2025-02-06 04:33:05,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4098639455782313 [2025-02-06 04:33:05,237 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 286 flow. Second operand 21 states and 241 transitions. [2025-02-06 04:33:05,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 174 transitions, 1154 flow [2025-02-06 04:33:05,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 174 transitions, 1138 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:33:05,241 INFO L231 Difference]: Finished difference. Result has 80 places, 94 transitions, 745 flow [2025-02-06 04:33:05,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=745, PETRI_PLACES=80, PETRI_TRANSITIONS=94} [2025-02-06 04:33:05,242 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 54 predicate places. [2025-02-06 04:33:05,242 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 94 transitions, 745 flow [2025-02-06 04:33:05,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:05,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:05,242 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:05,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:33:05,242 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-02-06 04:33:05,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:05,243 INFO L85 PathProgramCache]: Analyzing trace with hash -861624607, now seen corresponding path program 3 times [2025-02-06 04:33:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595270205] [2025-02-06 04:33:05,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:33:05,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:05,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-02-06 04:33:05,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 27 statements. [2025-02-06 04:33:05,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:33:05,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 04:33:05,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:05,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595270205] [2025-02-06 04:33:05,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595270205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:05,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:05,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:05,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338362421] [2025-02-06 04:33:05,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:05,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:05,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:05,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:05,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:05,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:05,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 94 transitions, 745 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:05,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:05,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:05,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:06,547 INFO L124 PetriNetUnfolderBase]: 797/1517 cut-off events. [2025-02-06 04:33:06,547 INFO L125 PetriNetUnfolderBase]: For 4270/4270 co-relation queries the response was YES. [2025-02-06 04:33:06,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5288 conditions, 1517 events. 797/1517 cut-off events. For 4270/4270 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8959 event pairs, 76 based on Foata normal form. 1/1517 useless extension candidates. Maximal degree in co-relation 5214. Up to 328 conditions per place. [2025-02-06 04:33:06,555 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 154 selfloop transitions, 72 changer transitions 8/237 dead transitions. [2025-02-06 04:33:06,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 237 transitions, 1940 flow [2025-02-06 04:33:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 04:33:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-02-06 04:33:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 304 transitions. [2025-02-06 04:33:06,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2025-02-06 04:33:06,558 INFO L175 Difference]: Start difference. First operand has 80 places, 94 transitions, 745 flow. Second operand 25 states and 304 transitions. [2025-02-06 04:33:06,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 237 transitions, 1940 flow [2025-02-06 04:33:06,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 237 transitions, 1816 flow, removed 53 selfloop flow, removed 4 redundant places. [2025-02-06 04:33:06,575 INFO L231 Difference]: Finished difference. Result has 110 places, 130 transitions, 1202 flow [2025-02-06 04:33:06,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1202, PETRI_PLACES=110, PETRI_TRANSITIONS=130} [2025-02-06 04:33:06,576 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 84 predicate places. [2025-02-06 04:33:06,576 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 130 transitions, 1202 flow [2025-02-06 04:33:06,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:06,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:06,576 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:06,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:33:06,577 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-02-06 04:33:06,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash 357605399, now seen corresponding path program 4 times [2025-02-06 04:33:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899620879] [2025-02-06 04:33:06,577 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:33:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:06,586 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:33:06,592 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 27 statements. [2025-02-06 04:33:06,596 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:33:06,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 04:33:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:06,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899620879] [2025-02-06 04:33:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899620879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:06,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:33:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753278550] [2025-02-06 04:33:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:06,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:33:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:06,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:33:06,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:33:06,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:06,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 130 transitions, 1202 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:06,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:06,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:06,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:07,807 INFO L124 PetriNetUnfolderBase]: 1148/2174 cut-off events. [2025-02-06 04:33:07,808 INFO L125 PetriNetUnfolderBase]: For 7583/7583 co-relation queries the response was YES. [2025-02-06 04:33:07,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8147 conditions, 2174 events. 1148/2174 cut-off events. For 7583/7583 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 13875 event pairs, 134 based on Foata normal form. 4/2177 useless extension candidates. Maximal degree in co-relation 8063. Up to 434 conditions per place. [2025-02-06 04:33:07,822 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 182 selfloop transitions, 115 changer transitions 10/310 dead transitions. [2025-02-06 04:33:07,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 310 transitions, 2805 flow [2025-02-06 04:33:07,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 04:33:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-02-06 04:33:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 366 transitions. [2025-02-06 04:33:07,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46683673469387754 [2025-02-06 04:33:07,824 INFO L175 Difference]: Start difference. First operand has 110 places, 130 transitions, 1202 flow. Second operand 28 states and 366 transitions. [2025-02-06 04:33:07,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 310 transitions, 2805 flow [2025-02-06 04:33:07,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 310 transitions, 2604 flow, removed 70 selfloop flow, removed 7 redundant places. [2025-02-06 04:33:07,855 INFO L231 Difference]: Finished difference. Result has 139 places, 174 transitions, 1794 flow [2025-02-06 04:33:07,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1794, PETRI_PLACES=139, PETRI_TRANSITIONS=174} [2025-02-06 04:33:07,856 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 113 predicate places. [2025-02-06 04:33:07,857 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 174 transitions, 1794 flow [2025-02-06 04:33:07,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:07,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:07,857 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:07,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:33:07,857 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-02-06 04:33:07,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash -57228865, now seen corresponding path program 5 times [2025-02-06 04:33:07,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:07,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456889913] [2025-02-06 04:33:07,859 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:33:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:07,868 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-02-06 04:33:07,878 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:33:07,878 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 04:33:07,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:33:07,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:07,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456889913] [2025-02-06 04:33:07,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456889913] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:33:07,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900913076] [2025-02-06 04:33:07,936 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:33:07,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:07,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:33:07,938 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:33:07,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:33:07,986 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-02-06 04:33:08,018 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:33:08,018 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 04:33:08,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:08,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:33:08,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:33:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:33:08,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:33:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:33:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900913076] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:33:08,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:33:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-02-06 04:33:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215382941] [2025-02-06 04:33:08,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:33:08,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:33:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:08,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:33:08,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:33:08,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:08,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 174 transitions, 1794 flow. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:08,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:08,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:08,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:08,280 INFO L124 PetriNetUnfolderBase]: 1138/2151 cut-off events. [2025-02-06 04:33:08,280 INFO L125 PetriNetUnfolderBase]: For 8972/8972 co-relation queries the response was YES. [2025-02-06 04:33:08,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8729 conditions, 2151 events. 1138/2151 cut-off events. For 8972/8972 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13760 event pairs, 626 based on Foata normal form. 1/2150 useless extension candidates. Maximal degree in co-relation 8627. Up to 2013 conditions per place. [2025-02-06 04:33:08,293 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 161 selfloop transitions, 12 changer transitions 0/176 dead transitions. [2025-02-06 04:33:08,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 176 transitions, 2152 flow [2025-02-06 04:33:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:33:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:33:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2025-02-06 04:33:08,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3520408163265306 [2025-02-06 04:33:08,294 INFO L175 Difference]: Start difference. First operand has 139 places, 174 transitions, 1794 flow. Second operand 7 states and 69 transitions. [2025-02-06 04:33:08,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 176 transitions, 2152 flow [2025-02-06 04:33:08,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 176 transitions, 2038 flow, removed 17 selfloop flow, removed 11 redundant places. [2025-02-06 04:33:08,321 INFO L231 Difference]: Finished difference. Result has 134 places, 176 transitions, 1726 flow [2025-02-06 04:33:08,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1680, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1726, PETRI_PLACES=134, PETRI_TRANSITIONS=176} [2025-02-06 04:33:08,322 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 108 predicate places. [2025-02-06 04:33:08,322 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 176 transitions, 1726 flow [2025-02-06 04:33:08,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:08,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:08,322 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:08,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:33:08,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:08,526 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-02-06 04:33:08,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1408233057, now seen corresponding path program 6 times [2025-02-06 04:33:08,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:08,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875044155] [2025-02-06 04:33:08,527 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:33:08,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:08,536 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-02-06 04:33:08,553 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-02-06 04:33:08,553 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:33:08,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:08,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:08,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875044155] [2025-02-06 04:33:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875044155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:08,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:08,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:08,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547547259] [2025-02-06 04:33:08,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:08,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:08,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:08,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:08,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:09,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:09,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 176 transitions, 1726 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:09,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:09,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:09,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:09,923 INFO L124 PetriNetUnfolderBase]: 1204/2269 cut-off events. [2025-02-06 04:33:09,923 INFO L125 PetriNetUnfolderBase]: For 8786/8786 co-relation queries the response was YES. [2025-02-06 04:33:09,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9025 conditions, 2269 events. 1204/2269 cut-off events. For 8786/8786 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 14720 event pairs, 85 based on Foata normal form. 1/2270 useless extension candidates. Maximal degree in co-relation 8913. Up to 347 conditions per place. [2025-02-06 04:33:09,940 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 138 selfloop transitions, 142 changer transitions 7/290 dead transitions. [2025-02-06 04:33:09,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 290 transitions, 2925 flow [2025-02-06 04:33:09,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 04:33:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-02-06 04:33:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 311 transitions. [2025-02-06 04:33:09,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4113756613756614 [2025-02-06 04:33:09,942 INFO L175 Difference]: Start difference. First operand has 134 places, 176 transitions, 1726 flow. Second operand 27 states and 311 transitions. [2025-02-06 04:33:09,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 290 transitions, 2925 flow [2025-02-06 04:33:09,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 290 transitions, 2901 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 04:33:09,970 INFO L231 Difference]: Finished difference. Result has 163 places, 193 transitions, 2285 flow [2025-02-06 04:33:09,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1702, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2285, PETRI_PLACES=163, PETRI_TRANSITIONS=193} [2025-02-06 04:33:09,972 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 137 predicate places. [2025-02-06 04:33:09,972 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 193 transitions, 2285 flow [2025-02-06 04:33:09,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:09,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:09,972 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:09,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:33:09,972 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-02-06 04:33:09,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash 746622253, now seen corresponding path program 7 times [2025-02-06 04:33:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:09,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114241393] [2025-02-06 04:33:09,972 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:33:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:09,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:33:10,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:33:10,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:10,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:10,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114241393] [2025-02-06 04:33:10,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114241393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:10,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:10,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250779353] [2025-02-06 04:33:10,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:10,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:10,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:10,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:10,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:10,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 193 transitions, 2285 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:10,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:10,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:10,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:11,311 INFO L124 PetriNetUnfolderBase]: 1286/2438 cut-off events. [2025-02-06 04:33:11,312 INFO L125 PetriNetUnfolderBase]: For 13040/13040 co-relation queries the response was YES. [2025-02-06 04:33:11,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10931 conditions, 2438 events. 1286/2438 cut-off events. For 13040/13040 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 16138 event pairs, 81 based on Foata normal form. 1/2439 useless extension candidates. Maximal degree in co-relation 10822. Up to 522 conditions per place. [2025-02-06 04:33:11,324 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 141 selfloop transitions, 161 changer transitions 7/312 dead transitions. [2025-02-06 04:33:11,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 312 transitions, 3654 flow [2025-02-06 04:33:11,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 04:33:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-02-06 04:33:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 305 transitions. [2025-02-06 04:33:11,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2025-02-06 04:33:11,325 INFO L175 Difference]: Start difference. First operand has 163 places, 193 transitions, 2285 flow. Second operand 25 states and 305 transitions. [2025-02-06 04:33:11,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 312 transitions, 3654 flow [2025-02-06 04:33:11,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 312 transitions, 3425 flow, removed 35 selfloop flow, removed 17 redundant places. [2025-02-06 04:33:11,363 INFO L231 Difference]: Finished difference. Result has 178 places, 222 transitions, 2855 flow [2025-02-06 04:33:11,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2855, PETRI_PLACES=178, PETRI_TRANSITIONS=222} [2025-02-06 04:33:11,364 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 152 predicate places. [2025-02-06 04:33:11,364 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 222 transitions, 2855 flow [2025-02-06 04:33:11,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:11,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:11,364 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:11,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:33:11,365 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-02-06 04:33:11,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:11,365 INFO L85 PathProgramCache]: Analyzing trace with hash 475306839, now seen corresponding path program 8 times [2025-02-06 04:33:11,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:11,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39661532] [2025-02-06 04:33:11,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:33:11,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:11,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:33:11,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-02-06 04:33:11,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:33:11,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:11,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:11,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39661532] [2025-02-06 04:33:11,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39661532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:11,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:11,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:11,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198418618] [2025-02-06 04:33:11,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:11,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:11,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:11,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:11,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:11,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:11,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 222 transitions, 2855 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:11,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:11,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:11,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:12,523 INFO L124 PetriNetUnfolderBase]: 1281/2441 cut-off events. [2025-02-06 04:33:12,523 INFO L125 PetriNetUnfolderBase]: For 13893/13893 co-relation queries the response was YES. [2025-02-06 04:33:12,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11380 conditions, 2441 events. 1281/2441 cut-off events. For 13893/13893 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 16175 event pairs, 77 based on Foata normal form. 1/2442 useless extension candidates. Maximal degree in co-relation 11263. Up to 500 conditions per place. [2025-02-06 04:33:12,539 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 149 selfloop transitions, 161 changer transitions 7/320 dead transitions. [2025-02-06 04:33:12,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 320 transitions, 3987 flow [2025-02-06 04:33:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 04:33:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-06 04:33:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 301 transitions. [2025-02-06 04:33:12,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2025-02-06 04:33:12,541 INFO L175 Difference]: Start difference. First operand has 178 places, 222 transitions, 2855 flow. Second operand 24 states and 301 transitions. [2025-02-06 04:33:12,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 320 transitions, 3987 flow [2025-02-06 04:33:12,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 320 transitions, 3591 flow, removed 77 selfloop flow, removed 13 redundant places. [2025-02-06 04:33:12,592 INFO L231 Difference]: Finished difference. Result has 194 places, 232 transitions, 3039 flow [2025-02-06 04:33:12,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2516, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3039, PETRI_PLACES=194, PETRI_TRANSITIONS=232} [2025-02-06 04:33:12,593 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 168 predicate places. [2025-02-06 04:33:12,593 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 232 transitions, 3039 flow [2025-02-06 04:33:12,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:12,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:12,594 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:12,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:33:12,595 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-02-06 04:33:12,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash 890141103, now seen corresponding path program 9 times [2025-02-06 04:33:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:12,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108580226] [2025-02-06 04:33:12,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:33:12,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:12,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-02-06 04:33:12,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-02-06 04:33:12,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:33:12,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:12,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108580226] [2025-02-06 04:33:12,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108580226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:12,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:12,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:12,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893840133] [2025-02-06 04:33:12,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:12,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:12,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:12,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:12,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:12,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:12,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 232 transitions, 3039 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:12,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:12,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:12,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:13,517 INFO L124 PetriNetUnfolderBase]: 1297/2453 cut-off events. [2025-02-06 04:33:13,517 INFO L125 PetriNetUnfolderBase]: For 13282/13282 co-relation queries the response was YES. [2025-02-06 04:33:13,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11537 conditions, 2453 events. 1297/2453 cut-off events. For 13282/13282 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16281 event pairs, 234 based on Foata normal form. 1/2444 useless extension candidates. Maximal degree in co-relation 11417. Up to 764 conditions per place. [2025-02-06 04:33:13,533 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 196 selfloop transitions, 89 changer transitions 7/295 dead transitions. [2025-02-06 04:33:13,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 295 transitions, 3930 flow [2025-02-06 04:33:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 04:33:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 04:33:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 214 transitions. [2025-02-06 04:33:13,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4495798319327731 [2025-02-06 04:33:13,534 INFO L175 Difference]: Start difference. First operand has 194 places, 232 transitions, 3039 flow. Second operand 17 states and 214 transitions. [2025-02-06 04:33:13,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 295 transitions, 3930 flow [2025-02-06 04:33:13,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 295 transitions, 3694 flow, removed 21 selfloop flow, removed 12 redundant places. [2025-02-06 04:33:13,579 INFO L231 Difference]: Finished difference. Result has 200 places, 234 transitions, 3047 flow [2025-02-06 04:33:13,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2826, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3047, PETRI_PLACES=200, PETRI_TRANSITIONS=234} [2025-02-06 04:33:13,579 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 174 predicate places. [2025-02-06 04:33:13,580 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 234 transitions, 3047 flow [2025-02-06 04:33:13,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:13,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:13,580 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:13,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:33:13,580 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-02-06 04:33:13,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1551017995, now seen corresponding path program 10 times [2025-02-06 04:33:13,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:13,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862338734] [2025-02-06 04:33:13,581 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:33:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:13,587 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:33:13,591 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-02-06 04:33:13,591 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:33:13,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:13,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:13,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862338734] [2025-02-06 04:33:13,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862338734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:13,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:13,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:33:13,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339111747] [2025-02-06 04:33:13,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:13,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:33:13,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:13,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:33:13,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:33:13,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:13,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 234 transitions, 3047 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:13,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:13,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:13,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:14,423 INFO L124 PetriNetUnfolderBase]: 1358/2617 cut-off events. [2025-02-06 04:33:14,423 INFO L125 PetriNetUnfolderBase]: For 13097/13097 co-relation queries the response was YES. [2025-02-06 04:33:14,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11983 conditions, 2617 events. 1358/2617 cut-off events. For 13097/13097 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 17862 event pairs, 96 based on Foata normal form. 1/2618 useless extension candidates. Maximal degree in co-relation 11862. Up to 576 conditions per place. [2025-02-06 04:33:14,441 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 174 selfloop transitions, 138 changer transitions 8/323 dead transitions. [2025-02-06 04:33:14,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 323 transitions, 4154 flow [2025-02-06 04:33:14,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 04:33:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 04:33:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 262 transitions. [2025-02-06 04:33:14,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46785714285714286 [2025-02-06 04:33:14,442 INFO L175 Difference]: Start difference. First operand has 200 places, 234 transitions, 3047 flow. Second operand 20 states and 262 transitions. [2025-02-06 04:33:14,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 323 transitions, 4154 flow [2025-02-06 04:33:14,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 323 transitions, 3972 flow, removed 8 selfloop flow, removed 12 redundant places. [2025-02-06 04:33:14,485 INFO L231 Difference]: Finished difference. Result has 209 places, 244 transitions, 3351 flow [2025-02-06 04:33:14,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2882, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3351, PETRI_PLACES=209, PETRI_TRANSITIONS=244} [2025-02-06 04:33:14,486 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 183 predicate places. [2025-02-06 04:33:14,486 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 244 transitions, 3351 flow [2025-02-06 04:33:14,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:14,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:14,486 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:14,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:33:14,486 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-02-06 04:33:14,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash 610882669, now seen corresponding path program 11 times [2025-02-06 04:33:14,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:14,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805022590] [2025-02-06 04:33:14,487 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:33:14,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:14,494 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-02-06 04:33:14,507 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:33:14,507 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 04:33:14,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 04:33:15,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805022590] [2025-02-06 04:33:15,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805022590] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:33:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789156365] [2025-02-06 04:33:15,198 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:33:15,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:33:15,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:33:15,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:33:15,260 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-02-06 04:33:15,292 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:33:15,292 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 04:33:15,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:15,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 04:33:15,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:33:15,500 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-02-06 04:33:15,502 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 103 treesize of output 64 [2025-02-06 04:33:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:15,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:33:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789156365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:15,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:33:15,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2025-02-06 04:33:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224286029] [2025-02-06 04:33:15,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:15,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:33:15,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:15,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:33:15,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:33:15,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:15,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 244 transitions, 3351 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:15,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:15,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:15,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:16,091 INFO L124 PetriNetUnfolderBase]: 1345/2578 cut-off events. [2025-02-06 04:33:16,092 INFO L125 PetriNetUnfolderBase]: For 14382/14382 co-relation queries the response was YES. [2025-02-06 04:33:16,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12317 conditions, 2578 events. 1345/2578 cut-off events. For 14382/14382 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 17546 event pairs, 520 based on Foata normal form. 5/2574 useless extension candidates. Maximal degree in co-relation 12194. Up to 1514 conditions per place. [2025-02-06 04:33:16,112 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 202 selfloop transitions, 62 changer transitions 10/277 dead transitions. [2025-02-06 04:33:16,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 277 transitions, 4007 flow [2025-02-06 04:33:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:33:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:33:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-02-06 04:33:16,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2025-02-06 04:33:16,116 INFO L175 Difference]: Start difference. First operand has 209 places, 244 transitions, 3351 flow. Second operand 9 states and 125 transitions. [2025-02-06 04:33:16,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 277 transitions, 4007 flow [2025-02-06 04:33:16,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 277 transitions, 3775 flow, removed 10 selfloop flow, removed 15 redundant places. [2025-02-06 04:33:16,176 INFO L231 Difference]: Finished difference. Result has 202 places, 240 transitions, 3197 flow [2025-02-06 04:33:16,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3108, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3197, PETRI_PLACES=202, PETRI_TRANSITIONS=240} [2025-02-06 04:33:16,177 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 176 predicate places. [2025-02-06 04:33:16,177 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 240 transitions, 3197 flow [2025-02-06 04:33:16,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:16,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:16,177 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:16,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:33:16,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:16,378 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-02-06 04:33:16,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash -329088903, now seen corresponding path program 12 times [2025-02-06 04:33:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:16,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446356812] [2025-02-06 04:33:16,378 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:33:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:16,401 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-02-06 04:33:16,410 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-02-06 04:33:16,410 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:33:16,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:16,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:16,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446356812] [2025-02-06 04:33:16,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446356812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:16,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:16,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:16,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704868108] [2025-02-06 04:33:16,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:16,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:16,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:16,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:16,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:16,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:16,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 240 transitions, 3197 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:16,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:16,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:16,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:17,420 INFO L124 PetriNetUnfolderBase]: 1358/2600 cut-off events. [2025-02-06 04:33:17,421 INFO L125 PetriNetUnfolderBase]: For 14026/14026 co-relation queries the response was YES. [2025-02-06 04:33:17,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12077 conditions, 2600 events. 1358/2600 cut-off events. For 14026/14026 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 17647 event pairs, 169 based on Foata normal form. 1/2597 useless extension candidates. Maximal degree in co-relation 11956. Up to 532 conditions per place. [2025-02-06 04:33:17,440 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 194 selfloop transitions, 120 changer transitions 8/325 dead transitions. [2025-02-06 04:33:17,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 325 transitions, 4210 flow [2025-02-06 04:33:17,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 04:33:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 04:33:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 274 transitions. [2025-02-06 04:33:17,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4448051948051948 [2025-02-06 04:33:17,442 INFO L175 Difference]: Start difference. First operand has 202 places, 240 transitions, 3197 flow. Second operand 22 states and 274 transitions. [2025-02-06 04:33:17,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 325 transitions, 4210 flow [2025-02-06 04:33:17,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 325 transitions, 4032 flow, removed 7 selfloop flow, removed 12 redundant places. [2025-02-06 04:33:17,490 INFO L231 Difference]: Finished difference. Result has 211 places, 243 transitions, 3368 flow [2025-02-06 04:33:17,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3029, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3368, PETRI_PLACES=211, PETRI_TRANSITIONS=243} [2025-02-06 04:33:17,491 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 185 predicate places. [2025-02-06 04:33:17,491 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 243 transitions, 3368 flow [2025-02-06 04:33:17,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:17,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:17,491 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:17,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 04:33:17,492 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-02-06 04:33:17,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash 333006321, now seen corresponding path program 13 times [2025-02-06 04:33:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:17,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590297745] [2025-02-06 04:33:17,492 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:33:17,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:17,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:33:17,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:33:17,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:17,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:17,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:17,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590297745] [2025-02-06 04:33:17,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590297745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:17,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:17,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319252785] [2025-02-06 04:33:17,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:17,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:17,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:17,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:17,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:17,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 243 transitions, 3368 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:17,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:17,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:17,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:18,713 INFO L124 PetriNetUnfolderBase]: 1478/2852 cut-off events. [2025-02-06 04:33:18,713 INFO L125 PetriNetUnfolderBase]: For 17597/17597 co-relation queries the response was YES. [2025-02-06 04:33:18,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13634 conditions, 2852 events. 1478/2852 cut-off events. For 17597/17597 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 19803 event pairs, 70 based on Foata normal form. 1/2853 useless extension candidates. Maximal degree in co-relation 13513. Up to 466 conditions per place. [2025-02-06 04:33:18,731 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 163 selfloop transitions, 217 changer transitions 7/390 dead transitions. [2025-02-06 04:33:18,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 390 transitions, 5305 flow [2025-02-06 04:33:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 04:33:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-06 04:33:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 302 transitions. [2025-02-06 04:33:18,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2025-02-06 04:33:18,733 INFO L175 Difference]: Start difference. First operand has 211 places, 243 transitions, 3368 flow. Second operand 24 states and 302 transitions. [2025-02-06 04:33:18,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 390 transitions, 5305 flow [2025-02-06 04:33:18,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 390 transitions, 5038 flow, removed 13 selfloop flow, removed 22 redundant places. [2025-02-06 04:33:18,789 INFO L231 Difference]: Finished difference. Result has 223 places, 292 transitions, 4524 flow [2025-02-06 04:33:18,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3176, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4524, PETRI_PLACES=223, PETRI_TRANSITIONS=292} [2025-02-06 04:33:18,789 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 197 predicate places. [2025-02-06 04:33:18,789 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 292 transitions, 4524 flow [2025-02-06 04:33:18,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:18,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:18,789 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:18,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 04:33:18,790 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-02-06 04:33:18,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1858875573, now seen corresponding path program 14 times [2025-02-06 04:33:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:18,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385597655] [2025-02-06 04:33:18,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:33:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:18,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:33:18,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-02-06 04:33:18,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:33:18,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:18,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:18,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385597655] [2025-02-06 04:33:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385597655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:18,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:18,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161929078] [2025-02-06 04:33:18,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:19,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:19,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:19,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:19,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:19,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:19,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 292 transitions, 4524 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:19,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:19,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:19,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:19,791 INFO L124 PetriNetUnfolderBase]: 1488/2880 cut-off events. [2025-02-06 04:33:19,791 INFO L125 PetriNetUnfolderBase]: For 21259/21259 co-relation queries the response was YES. [2025-02-06 04:33:19,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14705 conditions, 2880 events. 1488/2880 cut-off events. For 21259/21259 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 20123 event pairs, 79 based on Foata normal form. 1/2881 useless extension candidates. Maximal degree in co-relation 14577. Up to 441 conditions per place. [2025-02-06 04:33:19,810 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 152 selfloop transitions, 222 changer transitions 7/384 dead transitions. [2025-02-06 04:33:19,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 384 transitions, 5770 flow [2025-02-06 04:33:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 04:33:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 04:33:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 274 transitions. [2025-02-06 04:33:19,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4448051948051948 [2025-02-06 04:33:19,811 INFO L175 Difference]: Start difference. First operand has 223 places, 292 transitions, 4524 flow. Second operand 22 states and 274 transitions. [2025-02-06 04:33:19,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 384 transitions, 5770 flow [2025-02-06 04:33:19,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 384 transitions, 5587 flow, removed 57 selfloop flow, removed 5 redundant places. [2025-02-06 04:33:19,906 INFO L231 Difference]: Finished difference. Result has 246 places, 301 transitions, 5034 flow [2025-02-06 04:33:19,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4375, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5034, PETRI_PLACES=246, PETRI_TRANSITIONS=301} [2025-02-06 04:33:19,906 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 220 predicate places. [2025-02-06 04:33:19,906 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 301 transitions, 5034 flow [2025-02-06 04:33:19,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:19,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:19,907 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:19,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 04:33:19,907 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-02-06 04:33:19,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash -701765361, now seen corresponding path program 15 times [2025-02-06 04:33:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:19,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865558773] [2025-02-06 04:33:19,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:33:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:19,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-02-06 04:33:19,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-02-06 04:33:19,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:33:19,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:20,211 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865558773] [2025-02-06 04:33:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865558773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:20,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:20,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907684315] [2025-02-06 04:33:20,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:20,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:20,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:20,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:20,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:20,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:20,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 301 transitions, 5034 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:20,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:20,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:20,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:21,604 INFO L124 PetriNetUnfolderBase]: 1816/3562 cut-off events. [2025-02-06 04:33:21,604 INFO L125 PetriNetUnfolderBase]: For 26432/26432 co-relation queries the response was YES. [2025-02-06 04:33:21,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19282 conditions, 3562 events. 1816/3562 cut-off events. For 26432/26432 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 26288 event pairs, 132 based on Foata normal form. 3/3565 useless extension candidates. Maximal degree in co-relation 19148. Up to 730 conditions per place. [2025-02-06 04:33:21,631 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 230 selfloop transitions, 242 changer transitions 12/487 dead transitions. [2025-02-06 04:33:21,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 487 transitions, 7772 flow [2025-02-06 04:33:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 04:33:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-02-06 04:33:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 354 transitions. [2025-02-06 04:33:21,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43596059113300495 [2025-02-06 04:33:21,633 INFO L175 Difference]: Start difference. First operand has 246 places, 301 transitions, 5034 flow. Second operand 29 states and 354 transitions. [2025-02-06 04:33:21,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 487 transitions, 7772 flow [2025-02-06 04:33:21,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 487 transitions, 7373 flow, removed 16 selfloop flow, removed 11 redundant places. [2025-02-06 04:33:21,765 INFO L231 Difference]: Finished difference. Result has 275 places, 361 transitions, 6524 flow [2025-02-06 04:33:21,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4740, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=6524, PETRI_PLACES=275, PETRI_TRANSITIONS=361} [2025-02-06 04:33:21,766 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 249 predicate places. [2025-02-06 04:33:21,766 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 361 transitions, 6524 flow [2025-02-06 04:33:21,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:21,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:21,767 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:21,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 04:33:21,767 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-02-06 04:33:21,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:21,767 INFO L85 PathProgramCache]: Analyzing trace with hash 700479887, now seen corresponding path program 16 times [2025-02-06 04:33:21,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:21,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606675169] [2025-02-06 04:33:21,768 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:33:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:21,775 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:33:21,778 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-02-06 04:33:21,779 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:33:21,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606675169] [2025-02-06 04:33:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606675169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:21,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:21,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:33:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340597061] [2025-02-06 04:33:21,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:21,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:33:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:21,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:33:21,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:33:21,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:21,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 361 transitions, 6524 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:21,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:21,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:21,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:22,883 INFO L124 PetriNetUnfolderBase]: 1913/3831 cut-off events. [2025-02-06 04:33:22,883 INFO L125 PetriNetUnfolderBase]: For 31456/31456 co-relation queries the response was YES. [2025-02-06 04:33:22,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21029 conditions, 3831 events. 1913/3831 cut-off events. For 31456/31456 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 29413 event pairs, 98 based on Foata normal form. 1/3830 useless extension candidates. Maximal degree in co-relation 20883. Up to 726 conditions per place. [2025-02-06 04:33:22,917 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 132 selfloop transitions, 297 changer transitions 7/439 dead transitions. [2025-02-06 04:33:22,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 439 transitions, 7865 flow [2025-02-06 04:33:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 04:33:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 04:33:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 226 transitions. [2025-02-06 04:33:22,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.424812030075188 [2025-02-06 04:33:22,918 INFO L175 Difference]: Start difference. First operand has 275 places, 361 transitions, 6524 flow. Second operand 19 states and 226 transitions. [2025-02-06 04:33:22,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 439 transitions, 7865 flow [2025-02-06 04:33:23,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 439 transitions, 7464 flow, removed 84 selfloop flow, removed 9 redundant places. [2025-02-06 04:33:23,151 INFO L231 Difference]: Finished difference. Result has 289 places, 376 transitions, 7060 flow [2025-02-06 04:33:23,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6143, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7060, PETRI_PLACES=289, PETRI_TRANSITIONS=376} [2025-02-06 04:33:23,152 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 263 predicate places. [2025-02-06 04:33:23,152 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 376 transitions, 7060 flow [2025-02-06 04:33:23,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:23,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:23,152 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:23,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 04:33:23,152 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-02-06 04:33:23,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash 303719631, now seen corresponding path program 17 times [2025-02-06 04:33:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:23,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468268536] [2025-02-06 04:33:23,153 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:33:23,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:23,163 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-02-06 04:33:23,178 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:33:23,178 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 04:33:23,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468268536] [2025-02-06 04:33:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468268536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:23,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668398532] [2025-02-06 04:33:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:23,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:23,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:23,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:23,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:23,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 376 transitions, 7060 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:23,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:23,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:23,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:24,718 INFO L124 PetriNetUnfolderBase]: 1984/3964 cut-off events. [2025-02-06 04:33:24,718 INFO L125 PetriNetUnfolderBase]: For 34077/34077 co-relation queries the response was YES. [2025-02-06 04:33:24,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22353 conditions, 3964 events. 1984/3964 cut-off events. For 34077/34077 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 30415 event pairs, 160 based on Foata normal form. 4/3968 useless extension candidates. Maximal degree in co-relation 22206. Up to 613 conditions per place. [2025-02-06 04:33:24,752 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 197 selfloop transitions, 298 changer transitions 11/509 dead transitions. [2025-02-06 04:33:24,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 509 transitions, 8822 flow [2025-02-06 04:33:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 04:33:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-02-06 04:33:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 395 transitions. [2025-02-06 04:33:24,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41491596638655465 [2025-02-06 04:33:24,756 INFO L175 Difference]: Start difference. First operand has 289 places, 376 transitions, 7060 flow. Second operand 34 states and 395 transitions. [2025-02-06 04:33:24,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 509 transitions, 8822 flow [2025-02-06 04:33:24,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 509 transitions, 8475 flow, removed 36 selfloop flow, removed 9 redundant places. [2025-02-06 04:33:24,926 INFO L231 Difference]: Finished difference. Result has 317 places, 388 transitions, 7684 flow [2025-02-06 04:33:24,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6762, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=7684, PETRI_PLACES=317, PETRI_TRANSITIONS=388} [2025-02-06 04:33:24,926 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 291 predicate places. [2025-02-06 04:33:24,927 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 388 transitions, 7684 flow [2025-02-06 04:33:24,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:24,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:24,927 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:24,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 04:33:24,927 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-02-06 04:33:24,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash 222320575, now seen corresponding path program 18 times [2025-02-06 04:33:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:24,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972095707] [2025-02-06 04:33:24,928 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:33:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:24,936 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-02-06 04:33:24,950 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-02-06 04:33:24,953 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:33:24,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:25,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:25,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972095707] [2025-02-06 04:33:25,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972095707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:25,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:25,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935939220] [2025-02-06 04:33:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:25,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:25,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:25,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:25,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:25,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 388 transitions, 7684 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:25,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:25,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:25,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:26,277 INFO L124 PetriNetUnfolderBase]: 2055/4121 cut-off events. [2025-02-06 04:33:26,277 INFO L125 PetriNetUnfolderBase]: For 37902/37902 co-relation queries the response was YES. [2025-02-06 04:33:26,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24083 conditions, 4121 events. 2055/4121 cut-off events. For 37902/37902 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 31992 event pairs, 298 based on Foata normal form. 1/4122 useless extension candidates. Maximal degree in co-relation 23934. Up to 961 conditions per place. [2025-02-06 04:33:26,306 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 242 selfloop transitions, 226 changer transitions 8/479 dead transitions. [2025-02-06 04:33:26,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 479 transitions, 9244 flow [2025-02-06 04:33:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 04:33:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 04:33:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 279 transitions. [2025-02-06 04:33:26,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45292207792207795 [2025-02-06 04:33:26,307 INFO L175 Difference]: Start difference. First operand has 317 places, 388 transitions, 7684 flow. Second operand 22 states and 279 transitions. [2025-02-06 04:33:26,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 479 transitions, 9244 flow [2025-02-06 04:33:26,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 479 transitions, 8484 flow, removed 41 selfloop flow, removed 23 redundant places. [2025-02-06 04:33:26,456 INFO L231 Difference]: Finished difference. Result has 319 places, 399 transitions, 7783 flow [2025-02-06 04:33:26,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6969, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7783, PETRI_PLACES=319, PETRI_TRANSITIONS=399} [2025-02-06 04:33:26,456 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 293 predicate places. [2025-02-06 04:33:26,456 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 399 transitions, 7783 flow [2025-02-06 04:33:26,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:26,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:26,457 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:26,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 04:33:26,457 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-02-06 04:33:26,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:26,457 INFO L85 PathProgramCache]: Analyzing trace with hash -853390581, now seen corresponding path program 19 times [2025-02-06 04:33:26,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:26,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908994527] [2025-02-06 04:33:26,458 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:33:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:26,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:33:26,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:33:26,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:26,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:33:27,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:27,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908994527] [2025-02-06 04:33:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908994527] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:33:27,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603556284] [2025-02-06 04:33:27,246 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:33:27,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:27,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:33:27,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:33:27,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:33:27,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:33:27,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:33:27,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:27,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:27,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 04:33:27,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:33:27,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:33:27,419 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 118 treesize of output 74 [2025-02-06 04:33:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:27,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:33:27,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603556284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:27,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:33:27,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 23 [2025-02-06 04:33:27,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648597017] [2025-02-06 04:33:27,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:27,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:33:27,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:27,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:33:27,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-02-06 04:33:27,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:27,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 399 transitions, 7783 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:27,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:27,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:27,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:28,335 INFO L124 PetriNetUnfolderBase]: 2077/4132 cut-off events. [2025-02-06 04:33:28,336 INFO L125 PetriNetUnfolderBase]: For 36433/36433 co-relation queries the response was YES. [2025-02-06 04:33:28,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24178 conditions, 4132 events. 2077/4132 cut-off events. For 36433/36433 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 32313 event pairs, 832 based on Foata normal form. 5/4119 useless extension candidates. Maximal degree in co-relation 24030. Up to 2190 conditions per place. [2025-02-06 04:33:28,373 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 348 selfloop transitions, 97 changer transitions 7/455 dead transitions. [2025-02-06 04:33:28,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 455 transitions, 9039 flow [2025-02-06 04:33:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:33:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:33:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 166 transitions. [2025-02-06 04:33:28,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2025-02-06 04:33:28,374 INFO L175 Difference]: Start difference. First operand has 319 places, 399 transitions, 7783 flow. Second operand 12 states and 166 transitions. [2025-02-06 04:33:28,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 455 transitions, 9039 flow [2025-02-06 04:33:28,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 455 transitions, 8624 flow, removed 12 selfloop flow, removed 15 redundant places. [2025-02-06 04:33:28,547 INFO L231 Difference]: Finished difference. Result has 317 places, 401 transitions, 7676 flow [2025-02-06 04:33:28,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7344, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7676, PETRI_PLACES=317, PETRI_TRANSITIONS=401} [2025-02-06 04:33:28,552 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 291 predicate places. [2025-02-06 04:33:28,552 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 401 transitions, 7676 flow [2025-02-06 04:33:28,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:28,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:28,552 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:28,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 04:33:28,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-06 04:33:28,754 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-02-06 04:33:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -636415695, now seen corresponding path program 20 times [2025-02-06 04:33:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:28,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45742867] [2025-02-06 04:33:28,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:33:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:28,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:33:28,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-02-06 04:33:28,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:33:28,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:29,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:29,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45742867] [2025-02-06 04:33:29,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45742867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:29,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:29,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902569370] [2025-02-06 04:33:29,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:29,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:29,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:29,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:29,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:29,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 401 transitions, 7676 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:29,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:29,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:29,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:30,170 INFO L124 PetriNetUnfolderBase]: 2066/4142 cut-off events. [2025-02-06 04:33:30,170 INFO L125 PetriNetUnfolderBase]: For 35479/35479 co-relation queries the response was YES. [2025-02-06 04:33:30,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23678 conditions, 4142 events. 2066/4142 cut-off events. For 35479/35479 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 32236 event pairs, 221 based on Foata normal form. 1/4143 useless extension candidates. Maximal degree in co-relation 23529. Up to 801 conditions per place. [2025-02-06 04:33:30,204 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 170 selfloop transitions, 295 changer transitions 8/476 dead transitions. [2025-02-06 04:33:30,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 476 transitions, 8883 flow [2025-02-06 04:33:30,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 04:33:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-06 04:33:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 281 transitions. [2025-02-06 04:33:30,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4181547619047619 [2025-02-06 04:33:30,205 INFO L175 Difference]: Start difference. First operand has 317 places, 401 transitions, 7676 flow. Second operand 24 states and 281 transitions. [2025-02-06 04:33:30,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 476 transitions, 8883 flow [2025-02-06 04:33:30,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 476 transitions, 8719 flow, removed 22 selfloop flow, removed 14 redundant places. [2025-02-06 04:33:30,382 INFO L231 Difference]: Finished difference. Result has 326 places, 400 transitions, 8103 flow [2025-02-06 04:33:30,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7522, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8103, PETRI_PLACES=326, PETRI_TRANSITIONS=400} [2025-02-06 04:33:30,383 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 300 predicate places. [2025-02-06 04:33:30,383 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 400 transitions, 8103 flow [2025-02-06 04:33:30,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:30,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:30,383 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:30,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 04:33:30,384 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-02-06 04:33:30,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:30,384 INFO L85 PathProgramCache]: Analyzing trace with hash -717814751, now seen corresponding path program 21 times [2025-02-06 04:33:30,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:30,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864747507] [2025-02-06 04:33:30,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:33:30,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:30,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-02-06 04:33:30,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-02-06 04:33:30,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:33:30,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:30,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864747507] [2025-02-06 04:33:30,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864747507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:30,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:30,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:30,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608663335] [2025-02-06 04:33:30,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:30,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:30,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:30,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:30,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:30,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:30,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 400 transitions, 8103 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:30,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:30,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:30,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:31,656 INFO L124 PetriNetUnfolderBase]: 2182/4309 cut-off events. [2025-02-06 04:33:31,656 INFO L125 PetriNetUnfolderBase]: For 41959/41959 co-relation queries the response was YES. [2025-02-06 04:33:31,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25614 conditions, 4309 events. 2182/4309 cut-off events. For 41959/41959 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 33528 event pairs, 296 based on Foata normal form. 5/4301 useless extension candidates. Maximal degree in co-relation 25474. Up to 1076 conditions per place. [2025-02-06 04:33:31,698 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 250 selfloop transitions, 250 changer transitions 9/512 dead transitions. [2025-02-06 04:33:31,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 512 transitions, 9970 flow [2025-02-06 04:33:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 04:33:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-06 04:33:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 302 transitions. [2025-02-06 04:33:31,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2025-02-06 04:33:31,699 INFO L175 Difference]: Start difference. First operand has 326 places, 400 transitions, 8103 flow. Second operand 24 states and 302 transitions. [2025-02-06 04:33:31,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 512 transitions, 9970 flow [2025-02-06 04:33:31,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 512 transitions, 9440 flow, removed 8 selfloop flow, removed 24 redundant places. [2025-02-06 04:33:32,001 INFO L231 Difference]: Finished difference. Result has 329 places, 416 transitions, 8549 flow [2025-02-06 04:33:32,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7593, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8549, PETRI_PLACES=329, PETRI_TRANSITIONS=416} [2025-02-06 04:33:32,002 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 303 predicate places. [2025-02-06 04:33:32,002 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 416 transitions, 8549 flow [2025-02-06 04:33:32,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:32,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:32,002 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:32,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 04:33:32,003 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-02-06 04:33:32,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash -438556317, now seen corresponding path program 22 times [2025-02-06 04:33:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:32,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173675060] [2025-02-06 04:33:32,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:33:32,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:32,010 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:33:32,012 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-02-06 04:33:32,012 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:33:32,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:32,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:32,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173675060] [2025-02-06 04:33:32,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173675060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:32,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:32,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:33:32,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809497482] [2025-02-06 04:33:32,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:32,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:33:32,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:32,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:33:32,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:33:32,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:32,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 416 transitions, 8549 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:32,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:32,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:32,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:33,162 INFO L124 PetriNetUnfolderBase]: 2285/4551 cut-off events. [2025-02-06 04:33:33,162 INFO L125 PetriNetUnfolderBase]: For 45121/45121 co-relation queries the response was YES. [2025-02-06 04:33:33,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27376 conditions, 4551 events. 2285/4551 cut-off events. For 45121/45121 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 36147 event pairs, 109 based on Foata normal form. 1/4552 useless extension candidates. Maximal degree in co-relation 27235. Up to 955 conditions per place. [2025-02-06 04:33:33,195 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 176 selfloop transitions, 314 changer transitions 8/501 dead transitions. [2025-02-06 04:33:33,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 501 transitions, 10221 flow [2025-02-06 04:33:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 04:33:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 04:33:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 239 transitions. [2025-02-06 04:33:33,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4492481203007519 [2025-02-06 04:33:33,196 INFO L175 Difference]: Start difference. First operand has 329 places, 416 transitions, 8549 flow. Second operand 19 states and 239 transitions. [2025-02-06 04:33:33,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 501 transitions, 10221 flow [2025-02-06 04:33:33,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 501 transitions, 9802 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-02-06 04:33:33,394 INFO L231 Difference]: Finished difference. Result has 335 places, 433 transitions, 9294 flow [2025-02-06 04:33:33,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=8159, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=9294, PETRI_PLACES=335, PETRI_TRANSITIONS=433} [2025-02-06 04:33:33,395 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 309 predicate places. [2025-02-06 04:33:33,395 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 433 transitions, 9294 flow [2025-02-06 04:33:33,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:33,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:33,395 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:33,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 04:33:33,396 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-02-06 04:33:33,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash 886454378, now seen corresponding path program 1 times [2025-02-06 04:33:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:33,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095995366] [2025-02-06 04:33:33,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:33,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:33:33,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:33:33,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:33,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:33,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:33,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095995366] [2025-02-06 04:33:33,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095995366] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:33:33,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791585304] [2025-02-06 04:33:33,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:33,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:33,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:33:33,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:33:33,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:33:33,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:33:33,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:33:33,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:33,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:33,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:33:33,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:33:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:33,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:33:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:33,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791585304] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:33:33,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:33:33,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 04:33:33,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490387688] [2025-02-06 04:33:33,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:33:33,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:33:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:33,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:33:33,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:33:33,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-02-06 04:33:33,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 433 transitions, 9294 flow. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:33,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:33,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-02-06 04:33:33,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:34,453 INFO L124 PetriNetUnfolderBase]: 3255/6032 cut-off events. [2025-02-06 04:33:34,453 INFO L125 PetriNetUnfolderBase]: For 59747/59747 co-relation queries the response was YES. [2025-02-06 04:33:34,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39704 conditions, 6032 events. 3255/6032 cut-off events. For 59747/59747 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 43316 event pairs, 560 based on Foata normal form. 529/6561 useless extension candidates. Maximal degree in co-relation 39562. Up to 1431 conditions per place. [2025-02-06 04:33:34,504 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 593 selfloop transitions, 109 changer transitions 0/704 dead transitions. [2025-02-06 04:33:34,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 704 transitions, 16054 flow [2025-02-06 04:33:34,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:33:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:33:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2025-02-06 04:33:34,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-02-06 04:33:34,505 INFO L175 Difference]: Start difference. First operand has 335 places, 433 transitions, 9294 flow. Second operand 8 states and 116 transitions. [2025-02-06 04:33:34,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 704 transitions, 16054 flow [2025-02-06 04:33:34,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 704 transitions, 15749 flow, removed 31 selfloop flow, removed 15 redundant places. [2025-02-06 04:33:34,864 INFO L231 Difference]: Finished difference. Result has 329 places, 474 transitions, 10194 flow [2025-02-06 04:33:34,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=9029, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10194, PETRI_PLACES=329, PETRI_TRANSITIONS=474} [2025-02-06 04:33:34,865 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 303 predicate places. [2025-02-06 04:33:34,865 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 474 transitions, 10194 flow [2025-02-06 04:33:34,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:34,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:34,869 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:34,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 04:33:35,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:35,069 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-02-06 04:33:35,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:35,070 INFO L85 PathProgramCache]: Analyzing trace with hash 963830412, now seen corresponding path program 1 times [2025-02-06 04:33:35,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:35,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303148805] [2025-02-06 04:33:35,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:35,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:33:35,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:33:35,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:35,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:35,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303148805] [2025-02-06 04:33:35,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303148805] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:33:35,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225768564] [2025-02-06 04:33:35,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:35,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:35,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:33:35,115 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:33:35,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 04:33:35,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:33:35,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:33:35,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:35,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:35,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:33:35,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:33:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:35,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:33:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:35,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225768564] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:33:35,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:33:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 04:33:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145095310] [2025-02-06 04:33:35,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:33:35,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:33:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:35,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:33:35,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:33:35,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-02-06 04:33:35,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 474 transitions, 10194 flow. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:35,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:35,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-02-06 04:33:35,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:36,445 INFO L124 PetriNetUnfolderBase]: 4240/7544 cut-off events. [2025-02-06 04:33:36,446 INFO L125 PetriNetUnfolderBase]: For 76482/76566 co-relation queries the response was YES. [2025-02-06 04:33:36,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53350 conditions, 7544 events. 4240/7544 cut-off events. For 76482/76566 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 51427 event pairs, 1052 based on Foata normal form. 608/8136 useless extension candidates. Maximal degree in co-relation 53207. Up to 1908 conditions per place. [2025-02-06 04:33:36,534 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 689 selfloop transitions, 118 changer transitions 0/809 dead transitions. [2025-02-06 04:33:36,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 809 transitions, 18213 flow [2025-02-06 04:33:36,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:33:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:33:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-02-06 04:33:36,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6173469387755102 [2025-02-06 04:33:36,535 INFO L175 Difference]: Start difference. First operand has 329 places, 474 transitions, 10194 flow. Second operand 7 states and 121 transitions. [2025-02-06 04:33:36,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 809 transitions, 18213 flow [2025-02-06 04:33:37,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 809 transitions, 17917 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-02-06 04:33:37,218 INFO L231 Difference]: Finished difference. Result has 332 places, 517 transitions, 11317 flow [2025-02-06 04:33:37,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=10011, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11317, PETRI_PLACES=332, PETRI_TRANSITIONS=517} [2025-02-06 04:33:37,219 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 306 predicate places. [2025-02-06 04:33:37,219 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 517 transitions, 11317 flow [2025-02-06 04:33:37,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:37,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:37,220 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:37,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 04:33:37,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-02-06 04:33:37,420 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-02-06 04:33:37,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash 504240302, now seen corresponding path program 1 times [2025-02-06 04:33:37,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:37,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319858877] [2025-02-06 04:33:37,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:37,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:33:37,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:33:37,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:37,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:37,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:37,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319858877] [2025-02-06 04:33:37,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319858877] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:33:37,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92590520] [2025-02-06 04:33:37,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:37,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:37,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:33:37,851 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:33:37,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 04:33:37,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:33:37,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:33:37,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:37,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:37,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 04:33:37,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:33:38,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:33:38,073 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 118 treesize of output 74 [2025-02-06 04:33:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:38,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:33:38,210 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-02-06 04:33:38,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 87 [2025-02-06 04:33:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92590520] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:33:38,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:33:38,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 18 [2025-02-06 04:33:38,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146533665] [2025-02-06 04:33:38,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:38,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:33:38,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:38,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:33:38,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:33:38,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:38,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 517 transitions, 11317 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:38,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:38,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:38,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:39,806 INFO L124 PetriNetUnfolderBase]: 4413/8103 cut-off events. [2025-02-06 04:33:39,806 INFO L125 PetriNetUnfolderBase]: For 81682/81858 co-relation queries the response was YES. [2025-02-06 04:33:39,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56687 conditions, 8103 events. 4413/8103 cut-off events. For 81682/81858 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 58971 event pairs, 793 based on Foata normal form. 28/8094 useless extension candidates. Maximal degree in co-relation 56545. Up to 2445 conditions per place. [2025-02-06 04:33:39,898 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 347 selfloop transitions, 242 changer transitions 0/592 dead transitions. [2025-02-06 04:33:39,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 592 transitions, 13198 flow [2025-02-06 04:33:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:33:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:33:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2025-02-06 04:33:39,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5097402597402597 [2025-02-06 04:33:39,899 INFO L175 Difference]: Start difference. First operand has 332 places, 517 transitions, 11317 flow. Second operand 11 states and 157 transitions. [2025-02-06 04:33:39,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 592 transitions, 13198 flow [2025-02-06 04:33:40,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 592 transitions, 13100 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-02-06 04:33:40,542 INFO L231 Difference]: Finished difference. Result has 343 places, 529 transitions, 12066 flow [2025-02-06 04:33:40,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=11186, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12066, PETRI_PLACES=343, PETRI_TRANSITIONS=529} [2025-02-06 04:33:40,543 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 317 predicate places. [2025-02-06 04:33:40,543 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 529 transitions, 12066 flow [2025-02-06 04:33:40,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:40,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:40,543 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:40,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 04:33:40,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:40,744 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-02-06 04:33:40,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1744442157, now seen corresponding path program 1 times [2025-02-06 04:33:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:40,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817649294] [2025-02-06 04:33:40,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:40,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:40,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:33:40,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:33:40,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:40,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:41,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:41,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817649294] [2025-02-06 04:33:41,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817649294] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:33:41,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520874166] [2025-02-06 04:33:41,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:33:41,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:41,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:33:41,016 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:33:41,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 04:33:41,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:33:41,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:33:41,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:33:41,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:41,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 04:33:41,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:33:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:41,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:33:41,268 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-02-06 04:33:41,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-02-06 04:33:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:41,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520874166] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:33:41,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:33:41,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2025-02-06 04:33:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177103854] [2025-02-06 04:33:41,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:33:41,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 04:33:41,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:41,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 04:33:41,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:33:41,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:41,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 529 transitions, 12066 flow. Second operand has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 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-02-06 04:33:41,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:41,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:41,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:43,148 INFO L124 PetriNetUnfolderBase]: 4480/8206 cut-off events. [2025-02-06 04:33:43,148 INFO L125 PetriNetUnfolderBase]: For 90600/90771 co-relation queries the response was YES. [2025-02-06 04:33:43,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59812 conditions, 8206 events. 4480/8206 cut-off events. For 90600/90771 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 59699 event pairs, 412 based on Foata normal form. 50/8211 useless extension candidates. Maximal degree in co-relation 59667. Up to 2171 conditions per place. [2025-02-06 04:33:43,221 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 197 selfloop transitions, 411 changer transitions 1/612 dead transitions. [2025-02-06 04:33:43,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 612 transitions, 14065 flow [2025-02-06 04:33:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 04:33:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 04:33:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 213 transitions. [2025-02-06 04:33:43,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2025-02-06 04:33:43,222 INFO L175 Difference]: Start difference. First operand has 343 places, 529 transitions, 12066 flow. Second operand 18 states and 213 transitions. [2025-02-06 04:33:43,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 612 transitions, 14065 flow [2025-02-06 04:33:43,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 612 transitions, 13758 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-06 04:33:43,851 INFO L231 Difference]: Finished difference. Result has 358 places, 552 transitions, 13166 flow [2025-02-06 04:33:43,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=11709, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=383, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=13166, PETRI_PLACES=358, PETRI_TRANSITIONS=552} [2025-02-06 04:33:43,852 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 332 predicate places. [2025-02-06 04:33:43,855 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 552 transitions, 13166 flow [2025-02-06 04:33:43,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 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-02-06 04:33:43,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:43,856 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:43,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 04:33:44,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:33:44,056 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-02-06 04:33:44,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:44,057 INFO L85 PathProgramCache]: Analyzing trace with hash -556132652, now seen corresponding path program 2 times [2025-02-06 04:33:44,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:44,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241543761] [2025-02-06 04:33:44,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:33:44,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:44,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 04:33:44,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:33:44,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:33:44,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:44,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:44,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241543761] [2025-02-06 04:33:44,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241543761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:44,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:44,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:33:44,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436183237] [2025-02-06 04:33:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:44,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:33:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:44,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:33:44,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:33:44,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:44,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 552 transitions, 13166 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:44,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:44,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:44,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:45,942 INFO L124 PetriNetUnfolderBase]: 4475/8215 cut-off events. [2025-02-06 04:33:45,943 INFO L125 PetriNetUnfolderBase]: For 100252/100422 co-relation queries the response was YES. [2025-02-06 04:33:46,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62335 conditions, 8215 events. 4475/8215 cut-off events. For 100252/100422 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 59904 event pairs, 1150 based on Foata normal form. 5/8191 useless extension candidates. Maximal degree in co-relation 62183. Up to 3070 conditions per place. [2025-02-06 04:33:46,053 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 319 selfloop transitions, 248 changer transitions 10/580 dead transitions. [2025-02-06 04:33:46,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 580 transitions, 14384 flow [2025-02-06 04:33:46,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:33:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:33:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-02-06 04:33:46,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2025-02-06 04:33:46,054 INFO L175 Difference]: Start difference. First operand has 358 places, 552 transitions, 13166 flow. Second operand 10 states and 123 transitions. [2025-02-06 04:33:46,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 580 transitions, 14384 flow [2025-02-06 04:33:46,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 580 transitions, 14141 flow, removed 15 selfloop flow, removed 7 redundant places. [2025-02-06 04:33:46,785 INFO L231 Difference]: Finished difference. Result has 360 places, 549 transitions, 13347 flow [2025-02-06 04:33:46,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12894, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13347, PETRI_PLACES=360, PETRI_TRANSITIONS=549} [2025-02-06 04:33:46,786 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 334 predicate places. [2025-02-06 04:33:46,786 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 549 transitions, 13347 flow [2025-02-06 04:33:46,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:46,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:46,787 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:46,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 04:33:46,787 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-02-06 04:33:46,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash 863555160, now seen corresponding path program 3 times [2025-02-06 04:33:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:46,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824891091] [2025-02-06 04:33:46,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:33:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:46,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-02-06 04:33:46,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 31 statements. [2025-02-06 04:33:46,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:33:46,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:47,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:47,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824891091] [2025-02-06 04:33:47,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824891091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:47,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:47,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:33:47,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330502402] [2025-02-06 04:33:47,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:47,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:33:47,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:47,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:33:47,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:33:47,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:47,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 549 transitions, 13347 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:47,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:47,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:47,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:49,022 INFO L124 PetriNetUnfolderBase]: 4536/8364 cut-off events. [2025-02-06 04:33:49,022 INFO L125 PetriNetUnfolderBase]: For 106642/106812 co-relation queries the response was YES. [2025-02-06 04:33:49,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64125 conditions, 8364 events. 4536/8364 cut-off events. For 106642/106812 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 61673 event pairs, 1177 based on Foata normal form. 5/8332 useless extension candidates. Maximal degree in co-relation 63975. Up to 3042 conditions per place. [2025-02-06 04:33:49,148 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 349 selfloop transitions, 240 changer transitions 5/597 dead transitions. [2025-02-06 04:33:49,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 597 transitions, 14768 flow [2025-02-06 04:33:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 04:33:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 04:33:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 167 transitions. [2025-02-06 04:33:49,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4260204081632653 [2025-02-06 04:33:49,149 INFO L175 Difference]: Start difference. First operand has 360 places, 549 transitions, 13347 flow. Second operand 14 states and 167 transitions. [2025-02-06 04:33:49,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 597 transitions, 14768 flow [2025-02-06 04:33:49,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 597 transitions, 14286 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 04:33:49,981 INFO L231 Difference]: Finished difference. Result has 361 places, 550 transitions, 13387 flow [2025-02-06 04:33:49,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12827, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13387, PETRI_PLACES=361, PETRI_TRANSITIONS=550} [2025-02-06 04:33:49,982 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 335 predicate places. [2025-02-06 04:33:49,982 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 550 transitions, 13387 flow [2025-02-06 04:33:49,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:49,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:49,982 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:49,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 04:33:49,982 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-02-06 04:33:49,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash 647759152, now seen corresponding path program 4 times [2025-02-06 04:33:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:49,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543921098] [2025-02-06 04:33:49,983 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:33:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:49,994 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-06 04:33:50,001 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 31 statements. [2025-02-06 04:33:50,004 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:33:50,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:50,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543921098] [2025-02-06 04:33:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543921098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:50,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:50,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:33:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8592061] [2025-02-06 04:33:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:50,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:33:50,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:50,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:33:50,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:33:50,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:50,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 550 transitions, 13387 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:50,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:50,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:50,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:51,760 INFO L124 PetriNetUnfolderBase]: 4454/8185 cut-off events. [2025-02-06 04:33:51,761 INFO L125 PetriNetUnfolderBase]: For 105681/105851 co-relation queries the response was YES. [2025-02-06 04:33:51,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63246 conditions, 8185 events. 4454/8185 cut-off events. For 105681/105851 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 59856 event pairs, 701 based on Foata normal form. 5/8164 useless extension candidates. Maximal degree in co-relation 63096. Up to 1608 conditions per place. [2025-02-06 04:33:51,860 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 319 selfloop transitions, 280 changer transitions 4/606 dead transitions. [2025-02-06 04:33:51,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 606 transitions, 14891 flow [2025-02-06 04:33:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 04:33:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 04:33:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 179 transitions. [2025-02-06 04:33:51,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45663265306122447 [2025-02-06 04:33:51,862 INFO L175 Difference]: Start difference. First operand has 361 places, 550 transitions, 13387 flow. Second operand 14 states and 179 transitions. [2025-02-06 04:33:51,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 606 transitions, 14891 flow [2025-02-06 04:33:52,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 606 transitions, 14746 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-02-06 04:33:52,575 INFO L231 Difference]: Finished difference. Result has 361 places, 549 transitions, 13802 flow [2025-02-06 04:33:52,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13181, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13802, PETRI_PLACES=361, PETRI_TRANSITIONS=549} [2025-02-06 04:33:52,576 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 335 predicate places. [2025-02-06 04:33:52,576 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 549 transitions, 13802 flow [2025-02-06 04:33:52,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:52,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:52,577 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:52,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 04:33:52,577 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-02-06 04:33:52,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash -555221101, now seen corresponding path program 2 times [2025-02-06 04:33:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:52,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224448802] [2025-02-06 04:33:52,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:33:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:52,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 04:33:52,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 31 statements. [2025-02-06 04:33:52,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:33:52,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:52,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:52,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224448802] [2025-02-06 04:33:52,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224448802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:52,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:52,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:33:52,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218478963] [2025-02-06 04:33:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:52,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:33:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:52,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:33:52,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:33:52,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:52,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 549 transitions, 13802 flow. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:52,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:52,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:52,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:54,540 INFO L124 PetriNetUnfolderBase]: 4375/8091 cut-off events. [2025-02-06 04:33:54,540 INFO L125 PetriNetUnfolderBase]: For 109067/109230 co-relation queries the response was YES. [2025-02-06 04:33:54,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64086 conditions, 8091 events. 4375/8091 cut-off events. For 109067/109230 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 59443 event pairs, 1270 based on Foata normal form. 41/8095 useless extension candidates. Maximal degree in co-relation 63937. Up to 3692 conditions per place. [2025-02-06 04:33:54,628 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 346 selfloop transitions, 261 changer transitions 0/610 dead transitions. [2025-02-06 04:33:54,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 610 transitions, 15815 flow [2025-02-06 04:33:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:33:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:33:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 155 transitions. [2025-02-06 04:33:54,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2025-02-06 04:33:54,629 INFO L175 Difference]: Start difference. First operand has 361 places, 549 transitions, 13802 flow. Second operand 12 states and 155 transitions. [2025-02-06 04:33:54,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 610 transitions, 15815 flow [2025-02-06 04:33:55,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 610 transitions, 15580 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-02-06 04:33:55,316 INFO L231 Difference]: Finished difference. Result has 364 places, 546 transitions, 14072 flow [2025-02-06 04:33:55,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13461, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14072, PETRI_PLACES=364, PETRI_TRANSITIONS=546} [2025-02-06 04:33:55,317 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 338 predicate places. [2025-02-06 04:33:55,317 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 546 transitions, 14072 flow [2025-02-06 04:33:55,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:55,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:55,318 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:55,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 04:33:55,318 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-02-06 04:33:55,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1988259139, now seen corresponding path program 3 times [2025-02-06 04:33:55,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:55,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57552104] [2025-02-06 04:33:55,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:33:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:55,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-02-06 04:33:55,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 31 statements. [2025-02-06 04:33:55,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:33:55,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:55,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:55,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57552104] [2025-02-06 04:33:55,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57552104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:55,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:33:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733605965] [2025-02-06 04:33:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:55,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:33:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:55,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:33:55,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:33:55,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:55,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 546 transitions, 14072 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:55,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:55,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:55,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:57,192 INFO L124 PetriNetUnfolderBase]: 4420/8159 cut-off events. [2025-02-06 04:33:57,193 INFO L125 PetriNetUnfolderBase]: For 115625/115786 co-relation queries the response was YES. [2025-02-06 04:33:57,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65497 conditions, 8159 events. 4420/8159 cut-off events. For 115625/115786 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 59746 event pairs, 1201 based on Foata normal form. 32/8154 useless extension candidates. Maximal degree in co-relation 65346. Up to 3831 conditions per place. [2025-02-06 04:33:57,272 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 315 selfloop transitions, 271 changer transitions 2/591 dead transitions. [2025-02-06 04:33:57,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 591 transitions, 15540 flow [2025-02-06 04:33:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:33:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:33:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2025-02-06 04:33:57,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2025-02-06 04:33:57,273 INFO L175 Difference]: Start difference. First operand has 364 places, 546 transitions, 14072 flow. Second operand 12 states and 150 transitions. [2025-02-06 04:33:57,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 591 transitions, 15540 flow [2025-02-06 04:33:57,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 591 transitions, 15157 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-02-06 04:33:57,919 INFO L231 Difference]: Finished difference. Result has 369 places, 545 transitions, 14363 flow [2025-02-06 04:33:57,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13602, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14363, PETRI_PLACES=369, PETRI_TRANSITIONS=545} [2025-02-06 04:33:57,920 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 343 predicate places. [2025-02-06 04:33:57,920 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 545 transitions, 14363 flow [2025-02-06 04:33:57,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:57,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:33:57,920 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:33:57,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 04:33:57,920 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-02-06 04:33:57,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:33:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash 208176493, now seen corresponding path program 4 times [2025-02-06 04:33:57,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:33:57,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642999484] [2025-02-06 04:33:57,921 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:33:57,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:33:57,929 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-06 04:33:57,931 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 31 statements. [2025-02-06 04:33:57,932 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:33:57,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:33:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:33:58,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:33:58,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642999484] [2025-02-06 04:33:58,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642999484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:33:58,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:33:58,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:33:58,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445873749] [2025-02-06 04:33:58,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:33:58,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:33:58,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:33:58,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:33:58,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:33:58,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:33:58,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 545 transitions, 14363 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:33:58,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:33:58,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:33:58,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:33:59,571 INFO L124 PetriNetUnfolderBase]: 4357/8013 cut-off events. [2025-02-06 04:33:59,571 INFO L125 PetriNetUnfolderBase]: For 128199/128360 co-relation queries the response was YES. [2025-02-06 04:33:59,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66094 conditions, 8013 events. 4357/8013 cut-off events. For 128199/128360 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 58022 event pairs, 1136 based on Foata normal form. 4/7998 useless extension candidates. Maximal degree in co-relation 65941. Up to 2914 conditions per place. [2025-02-06 04:33:59,679 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 315 selfloop transitions, 252 changer transitions 5/575 dead transitions. [2025-02-06 04:33:59,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 575 transitions, 15510 flow [2025-02-06 04:33:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:33:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:33:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2025-02-06 04:33:59,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2025-02-06 04:33:59,680 INFO L175 Difference]: Start difference. First operand has 369 places, 545 transitions, 14363 flow. Second operand 12 states and 153 transitions. [2025-02-06 04:33:59,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 575 transitions, 15510 flow [2025-02-06 04:34:00,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 575 transitions, 14556 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-02-06 04:34:00,460 INFO L231 Difference]: Finished difference. Result has 362 places, 538 transitions, 13910 flow [2025-02-06 04:34:00,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13231, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13910, PETRI_PLACES=362, PETRI_TRANSITIONS=538} [2025-02-06 04:34:00,461 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 336 predicate places. [2025-02-06 04:34:00,462 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 538 transitions, 13910 flow [2025-02-06 04:34:00,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:00,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:00,462 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:00,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 04:34:00,462 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-02-06 04:34:00,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash 261528476, now seen corresponding path program 5 times [2025-02-06 04:34:00,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:00,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481335020] [2025-02-06 04:34:00,463 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:34:00,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:00,471 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-02-06 04:34:00,482 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:34:00,482 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 04:34:00,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:00,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481335020] [2025-02-06 04:34:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481335020] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247796212] [2025-02-06 04:34:00,719 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:34:00,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:00,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:00,725 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:34:00,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 04:34:00,820 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-02-06 04:34:00,910 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:34:00,910 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 04:34:00,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:00,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 04:34:00,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:34:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:01,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:34:01,123 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-02-06 04:34:01,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-02-06 04:34:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:01,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247796212] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:34:01,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:34:01,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-02-06 04:34:01,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656259767] [2025-02-06 04:34:01,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:34:01,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 04:34:01,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:01,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 04:34:01,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-02-06 04:34:01,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:34:01,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 538 transitions, 13910 flow. Second operand has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:01,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:01,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:34:01,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:03,262 INFO L124 PetriNetUnfolderBase]: 4582/8504 cut-off events. [2025-02-06 04:34:03,262 INFO L125 PetriNetUnfolderBase]: For 127233/127393 co-relation queries the response was YES. [2025-02-06 04:34:03,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66205 conditions, 8504 events. 4582/8504 cut-off events. For 127233/127393 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 63404 event pairs, 830 based on Foata normal form. 48/8517 useless extension candidates. Maximal degree in co-relation 66054. Up to 2212 conditions per place. [2025-02-06 04:34:03,368 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 338 selfloop transitions, 303 changer transitions 0/644 dead transitions. [2025-02-06 04:34:03,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 644 transitions, 16507 flow [2025-02-06 04:34:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 04:34:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 04:34:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 222 transitions. [2025-02-06 04:34:03,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2025-02-06 04:34:03,369 INFO L175 Difference]: Start difference. First operand has 362 places, 538 transitions, 13910 flow. Second operand 18 states and 222 transitions. [2025-02-06 04:34:03,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 644 transitions, 16507 flow [2025-02-06 04:34:04,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 644 transitions, 16186 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 04:34:04,251 INFO L231 Difference]: Finished difference. Result has 374 places, 578 transitions, 15356 flow [2025-02-06 04:34:04,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13615, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=15356, PETRI_PLACES=374, PETRI_TRANSITIONS=578} [2025-02-06 04:34:04,252 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 348 predicate places. [2025-02-06 04:34:04,252 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 578 transitions, 15356 flow [2025-02-06 04:34:04,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:04,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:04,253 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:04,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 04:34:04,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-02-06 04:34:04,454 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-02-06 04:34:04,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:04,454 INFO L85 PathProgramCache]: Analyzing trace with hash -599447831, now seen corresponding path program 5 times [2025-02-06 04:34:04,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:04,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365533407] [2025-02-06 04:34:04,454 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:34:04,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:04,462 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-02-06 04:34:04,475 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:34:04,475 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 04:34:04,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 04:34:04,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:04,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365533407] [2025-02-06 04:34:04,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365533407] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:04,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733000608] [2025-02-06 04:34:04,723 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:34:04,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:04,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:04,728 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:34:04,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 04:34:04,824 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-02-06 04:34:04,880 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:34:04,880 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 04:34:04,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:04,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 04:34:04,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:34:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:05,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:34:05,086 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-02-06 04:34:05,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-02-06 04:34:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733000608] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:34:05,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:34:05,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-02-06 04:34:05,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238381700] [2025-02-06 04:34:05,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:34:05,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 04:34:05,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:05,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 04:34:05,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:34:05,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:34:05,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 578 transitions, 15356 flow. Second operand has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 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-02-06 04:34:05,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:05,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:34:05,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:07,521 INFO L124 PetriNetUnfolderBase]: 4923/9202 cut-off events. [2025-02-06 04:34:07,522 INFO L125 PetriNetUnfolderBase]: For 140420/140572 co-relation queries the response was YES. [2025-02-06 04:34:07,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71745 conditions, 9202 events. 4923/9202 cut-off events. For 140420/140572 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 69956 event pairs, 955 based on Foata normal form. 41/9218 useless extension candidates. Maximal degree in co-relation 71586. Up to 2815 conditions per place. [2025-02-06 04:34:07,644 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 336 selfloop transitions, 364 changer transitions 1/704 dead transitions. [2025-02-06 04:34:07,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 704 transitions, 18344 flow [2025-02-06 04:34:07,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 04:34:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 04:34:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 239 transitions. [2025-02-06 04:34:07,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4492481203007519 [2025-02-06 04:34:07,668 INFO L175 Difference]: Start difference. First operand has 374 places, 578 transitions, 15356 flow. Second operand 19 states and 239 transitions. [2025-02-06 04:34:07,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 704 transitions, 18344 flow [2025-02-06 04:34:08,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 704 transitions, 17957 flow, removed 25 selfloop flow, removed 10 redundant places. [2025-02-06 04:34:08,749 INFO L231 Difference]: Finished difference. Result has 388 places, 624 transitions, 17180 flow [2025-02-06 04:34:08,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=14970, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=17180, PETRI_PLACES=388, PETRI_TRANSITIONS=624} [2025-02-06 04:34:08,750 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 362 predicate places. [2025-02-06 04:34:08,753 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 624 transitions, 17180 flow [2025-02-06 04:34:08,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 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-02-06 04:34:08,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:08,754 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:08,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 04:34:08,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:08,954 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-02-06 04:34:08,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1780567274, now seen corresponding path program 6 times [2025-02-06 04:34:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:08,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923467154] [2025-02-06 04:34:08,955 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:34:08,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:08,966 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-02-06 04:34:08,992 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 31 statements. [2025-02-06 04:34:08,995 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:34:08,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:09,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923467154] [2025-02-06 04:34:09,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923467154] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:09,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560218099] [2025-02-06 04:34:09,501 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:34:09,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:09,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:09,504 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:34:09,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 04:34:09,602 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-02-06 04:34:09,622 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 31 statements. [2025-02-06 04:34:09,622 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:34:09,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:09,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 04:34:09,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:34:09,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:34:09,722 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 118 treesize of output 70 [2025-02-06 04:34:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:09,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:34:09,866 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-02-06 04:34:09,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-02-06 04:34:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560218099] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:34:09,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 9] total 17 [2025-02-06 04:34:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528981663] [2025-02-06 04:34:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:09,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:34:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:09,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:34:09,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:34:09,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:34:09,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 624 transitions, 17180 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:09,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:09,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:34:09,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:11,985 INFO L124 PetriNetUnfolderBase]: 5020/9402 cut-off events. [2025-02-06 04:34:11,985 INFO L125 PetriNetUnfolderBase]: For 156795/156950 co-relation queries the response was YES. [2025-02-06 04:34:12,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75981 conditions, 9402 events. 5020/9402 cut-off events. For 156795/156950 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 72155 event pairs, 937 based on Foata normal form. 28/9395 useless extension candidates. Maximal degree in co-relation 75818. Up to 2457 conditions per place. [2025-02-06 04:34:12,103 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 390 selfloop transitions, 306 changer transitions 0/699 dead transitions. [2025-02-06 04:34:12,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 699 transitions, 19217 flow [2025-02-06 04:34:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 04:34:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 04:34:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 196 transitions. [2025-02-06 04:34:12,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-06 04:34:12,104 INFO L175 Difference]: Start difference. First operand has 388 places, 624 transitions, 17180 flow. Second operand 14 states and 196 transitions. [2025-02-06 04:34:12,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 699 transitions, 19217 flow [2025-02-06 04:34:13,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 699 transitions, 18488 flow, removed 32 selfloop flow, removed 20 redundant places. [2025-02-06 04:34:13,220 INFO L231 Difference]: Finished difference. Result has 383 places, 627 transitions, 17234 flow [2025-02-06 04:34:13,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16445, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=17234, PETRI_PLACES=383, PETRI_TRANSITIONS=627} [2025-02-06 04:34:13,222 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 357 predicate places. [2025-02-06 04:34:13,222 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 627 transitions, 17234 flow [2025-02-06 04:34:13,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:13,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:13,222 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:13,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 04:34:13,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-02-06 04:34:13,423 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-02-06 04:34:13,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:13,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1185702602, now seen corresponding path program 7 times [2025-02-06 04:34:13,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:13,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707501817] [2025-02-06 04:34:13,424 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:34:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:13,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:34:13,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:34:13,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:13,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707501817] [2025-02-06 04:34:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707501817] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094110008] [2025-02-06 04:34:13,819 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:34:13,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:13,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:13,821 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:34:13,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 04:34:13,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:34:13,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:34:13,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:13,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:13,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 04:34:13,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:34:14,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:34:14,055 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 118 treesize of output 74 [2025-02-06 04:34:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:14,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:34:14,149 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-02-06 04:34:14,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 95 [2025-02-06 04:34:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:14,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094110008] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:14,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:34:14,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 18 [2025-02-06 04:34:14,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233984675] [2025-02-06 04:34:14,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:14,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:34:14,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:14,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:34:14,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:34:14,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:34:14,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 627 transitions, 17234 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:14,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:14,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:34:14,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:16,287 INFO L124 PetriNetUnfolderBase]: 4877/9123 cut-off events. [2025-02-06 04:34:16,287 INFO L125 PetriNetUnfolderBase]: For 149382/149534 co-relation queries the response was YES. [2025-02-06 04:34:16,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73781 conditions, 9123 events. 4877/9123 cut-off events. For 149382/149534 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 69437 event pairs, 1003 based on Foata normal form. 28/9112 useless extension candidates. Maximal degree in co-relation 73628. Up to 3069 conditions per place. [2025-02-06 04:34:16,396 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 388 selfloop transitions, 281 changer transitions 0/672 dead transitions. [2025-02-06 04:34:16,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 672 transitions, 18793 flow [2025-02-06 04:34:16,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:34:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:34:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2025-02-06 04:34:16,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2025-02-06 04:34:16,398 INFO L175 Difference]: Start difference. First operand has 383 places, 627 transitions, 17234 flow. Second operand 10 states and 149 transitions. [2025-02-06 04:34:16,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 672 transitions, 18793 flow [2025-02-06 04:34:17,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 672 transitions, 18279 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-02-06 04:34:17,403 INFO L231 Difference]: Finished difference. Result has 384 places, 617 transitions, 17076 flow [2025-02-06 04:34:17,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16501, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17076, PETRI_PLACES=384, PETRI_TRANSITIONS=617} [2025-02-06 04:34:17,408 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 358 predicate places. [2025-02-06 04:34:17,408 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 617 transitions, 17076 flow [2025-02-06 04:34:17,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:17,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:17,408 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:17,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 04:34:17,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:17,609 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-02-06 04:34:17,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:17,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1924086124, now seen corresponding path program 8 times [2025-02-06 04:34:17,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:17,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872152411] [2025-02-06 04:34:17,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:34:17,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:17,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 04:34:17,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 31 statements. [2025-02-06 04:34:17,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:34:17,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:17,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872152411] [2025-02-06 04:34:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872152411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:17,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:17,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:34:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561112057] [2025-02-06 04:34:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:17,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:34:17,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:17,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:34:17,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:34:17,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:34:17,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 617 transitions, 17076 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:17,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:17,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:34:17,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:20,486 INFO L124 PetriNetUnfolderBase]: 4845/9065 cut-off events. [2025-02-06 04:34:20,486 INFO L125 PetriNetUnfolderBase]: For 151562/151712 co-relation queries the response was YES. [2025-02-06 04:34:20,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73498 conditions, 9065 events. 4845/9065 cut-off events. For 151562/151712 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 68897 event pairs, 2123 based on Foata normal form. 5/9027 useless extension candidates. Maximal degree in co-relation 73346. Up to 6053 conditions per place. [2025-02-06 04:34:20,611 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 552 selfloop transitions, 87 changer transitions 3/645 dead transitions. [2025-02-06 04:34:20,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 645 transitions, 18496 flow [2025-02-06 04:34:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:34:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:34:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2025-02-06 04:34:20,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-02-06 04:34:20,612 INFO L175 Difference]: Start difference. First operand has 384 places, 617 transitions, 17076 flow. Second operand 11 states and 132 transitions. [2025-02-06 04:34:20,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 645 transitions, 18496 flow [2025-02-06 04:34:22,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 645 transitions, 18038 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:34:22,116 INFO L231 Difference]: Finished difference. Result has 387 places, 613 transitions, 16699 flow [2025-02-06 04:34:22,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16554, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16699, PETRI_PLACES=387, PETRI_TRANSITIONS=613} [2025-02-06 04:34:22,117 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 361 predicate places. [2025-02-06 04:34:22,117 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 613 transitions, 16699 flow [2025-02-06 04:34:22,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:22,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:22,118 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:22,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-06 04:34:22,118 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:34:22,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:22,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1042183752, now seen corresponding path program 9 times [2025-02-06 04:34:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:22,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286079021] [2025-02-06 04:34:22,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:34:22,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:22,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-02-06 04:34:22,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 31 statements. [2025-02-06 04:34:22,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:34:22,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:22,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:22,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286079021] [2025-02-06 04:34:22,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286079021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:22,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:22,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:34:22,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448774367] [2025-02-06 04:34:22,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:22,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:34:22,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:22,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:34:22,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:34:22,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:34:22,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 613 transitions, 16699 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:22,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:22,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:34:22,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:24,106 INFO L124 PetriNetUnfolderBase]: 4833/9043 cut-off events. [2025-02-06 04:34:24,106 INFO L125 PetriNetUnfolderBase]: For 148840/148990 co-relation queries the response was YES. [2025-02-06 04:34:24,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72086 conditions, 9043 events. 4833/9043 cut-off events. For 148840/148990 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 68689 event pairs, 2086 based on Foata normal form. 5/9005 useless extension candidates. Maximal degree in co-relation 71933. Up to 6047 conditions per place. [2025-02-06 04:34:24,232 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 547 selfloop transitions, 95 changer transitions 3/648 dead transitions. [2025-02-06 04:34:24,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 648 transitions, 18163 flow [2025-02-06 04:34:24,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:34:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:34:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2025-02-06 04:34:24,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2025-02-06 04:34:24,236 INFO L175 Difference]: Start difference. First operand has 387 places, 613 transitions, 16699 flow. Second operand 12 states and 143 transitions. [2025-02-06 04:34:24,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 648 transitions, 18163 flow [2025-02-06 04:34:25,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 648 transitions, 17992 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-06 04:34:25,375 INFO L231 Difference]: Finished difference. Result has 389 places, 614 transitions, 16776 flow [2025-02-06 04:34:25,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16480, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16776, PETRI_PLACES=389, PETRI_TRANSITIONS=614} [2025-02-06 04:34:25,375 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 363 predicate places. [2025-02-06 04:34:25,375 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 614 transitions, 16776 flow [2025-02-06 04:34:25,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:25,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:25,376 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:25,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-06 04:34:25,376 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:34:25,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash -535837486, now seen corresponding path program 10 times [2025-02-06 04:34:25,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:25,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929395332] [2025-02-06 04:34:25,377 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:34:25,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:25,383 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-06 04:34:25,385 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 31 statements. [2025-02-06 04:34:25,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:34:25,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:25,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929395332] [2025-02-06 04:34:25,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929395332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:25,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:25,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:34:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097577417] [2025-02-06 04:34:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:25,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:34:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:25,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:34:25,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:34:25,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:34:25,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 614 transitions, 16776 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:25,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:25,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:34:25,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:27,543 INFO L124 PetriNetUnfolderBase]: 4756/8870 cut-off events. [2025-02-06 04:34:27,544 INFO L125 PetriNetUnfolderBase]: For 152022/152174 co-relation queries the response was YES. [2025-02-06 04:34:27,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71246 conditions, 8870 events. 4756/8870 cut-off events. For 152022/152174 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 66837 event pairs, 1001 based on Foata normal form. 5/8844 useless extension candidates. Maximal degree in co-relation 71091. Up to 2462 conditions per place. [2025-02-06 04:34:27,683 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 344 selfloop transitions, 292 changer transitions 9/648 dead transitions. [2025-02-06 04:34:27,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 648 transitions, 18029 flow [2025-02-06 04:34:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:34:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:34:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 157 transitions. [2025-02-06 04:34:27,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2025-02-06 04:34:27,686 INFO L175 Difference]: Start difference. First operand has 389 places, 614 transitions, 16776 flow. Second operand 12 states and 157 transitions. [2025-02-06 04:34:27,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 648 transitions, 18029 flow [2025-02-06 04:34:28,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 648 transitions, 17850 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-02-06 04:34:28,820 INFO L231 Difference]: Finished difference. Result has 389 places, 604 transitions, 16971 flow [2025-02-06 04:34:28,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16425, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16971, PETRI_PLACES=389, PETRI_TRANSITIONS=604} [2025-02-06 04:34:28,822 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 363 predicate places. [2025-02-06 04:34:28,823 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 604 transitions, 16971 flow [2025-02-06 04:34:28,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:28,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:28,823 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:28,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-06 04:34:28,823 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:34:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1485246111, now seen corresponding path program 6 times [2025-02-06 04:34:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642330049] [2025-02-06 04:34:28,824 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:34:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:28,833 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-02-06 04:34:28,854 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 31 statements. [2025-02-06 04:34:28,854 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:34:28,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:29,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:29,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642330049] [2025-02-06 04:34:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642330049] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:29,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316249964] [2025-02-06 04:34:29,274 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:34:29,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:29,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:29,276 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:34:29,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 04:34:29,381 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-02-06 04:34:29,402 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 31 statements. [2025-02-06 04:34:29,402 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:34:29,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:29,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 04:34:29,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:34:29,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:34:29,487 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 118 treesize of output 70 [2025-02-06 04:34:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:29,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:34:29,591 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-02-06 04:34:29,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-02-06 04:34:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316249964] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:29,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:34:29,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 9] total 17 [2025-02-06 04:34:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824133966] [2025-02-06 04:34:29,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:29,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:34:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:29,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:34:29,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:34:29,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:34:29,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 604 transitions, 16971 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:29,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:29,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:34:29,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand