./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-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-nzb-file-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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:34:17,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:34:17,666 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:34:17,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:34:17,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:34:17,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:34:17,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:34:17,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:34:17,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:34:17,695 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:34:17,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:34:17,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:34:17,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:34:17,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:34:17,697 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:34:17,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:34:17,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:34:17,697 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:34:17,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:34:17,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:34:17,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:34:17,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:34:17,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:34:17,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:34:17,698 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:34:17,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:34:17,698 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:34:17,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:34:17,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:34:17,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:34:17,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:34:17,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:34:17,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:34:17,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:34:17,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:34:17,700 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:34:17,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:34:17,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:34:17,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:34:17,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:34:17,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:34:17,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:34:17,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:34:17,700 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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2025-02-06 04:34:17,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:34:18,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:34:18,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:34:18,011 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:34:18,011 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:34:18,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-02-06 04:34:19,402 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d204f2ec7/0943cc2d19b5499d86ab28ac35adddfa/FLAG97582bb2b [2025-02-06 04:34:19,688 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:34:19,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-02-06 04:34:19,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d204f2ec7/0943cc2d19b5499d86ab28ac35adddfa/FLAG97582bb2b [2025-02-06 04:34:19,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d204f2ec7/0943cc2d19b5499d86ab28ac35adddfa [2025-02-06 04:34:19,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:34:19,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:34:19,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:34:19,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:34:19,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:34:19,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:34:19" (1/1) ... [2025-02-06 04:34:19,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7783aab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:19, skipping insertion in model container [2025-02-06 04:34:19,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:34:19" (1/1) ... [2025-02-06 04:34:19,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:34:19,975 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-nzb-file-symm.wvr.c[4955,4968] [2025-02-06 04:34:19,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:34:20,001 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:34:20,041 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-nzb-file-symm.wvr.c[4955,4968] [2025-02-06 04:34:20,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:34:20,066 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:34:20,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20 WrapperNode [2025-02-06 04:34:20,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:34:20,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:34:20,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:34:20,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:34:20,072 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:34:20" (1/1) ... [2025-02-06 04:34:20,083 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:34:20" (1/1) ... [2025-02-06 04:34:20,135 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 399 [2025-02-06 04:34:20,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:34:20,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:34:20,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:34:20,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:34:20,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20" (1/1) ... [2025-02-06 04:34:20,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20" (1/1) ... [2025-02-06 04:34:20,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20" (1/1) ... [2025-02-06 04:34:20,185 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 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:34:20,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20" (1/1) ... [2025-02-06 04:34:20,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20" (1/1) ... [2025-02-06 04:34:20,201 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20" (1/1) ... [2025-02-06 04:34:20,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20" (1/1) ... [2025-02-06 04:34:20,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20" (1/1) ... [2025-02-06 04:34:20,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20" (1/1) ... [2025-02-06 04:34:20,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:34:20,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:34:20,212 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:34:20,212 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:34:20,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20" (1/1) ... [2025-02-06 04:34:20,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:34:20,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:20,251 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:34:20,254 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:34:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:34:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:34:20,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:34:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:34:20,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:34:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:34:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:34:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:34:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:34:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:34:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:34:20,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:34:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:34:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:34:20,281 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:34:20,413 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:34:20,414 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:34:21,063 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:34:21,064 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:34:21,615 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:34:21,615 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:34:21,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:34:21 BoogieIcfgContainer [2025-02-06 04:34:21,615 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:34:21,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:34:21,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:34:21,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:34:21,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:34:19" (1/3) ... [2025-02-06 04:34:21,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e8c300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:34:21, skipping insertion in model container [2025-02-06 04:34:21,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:20" (2/3) ... [2025-02-06 04:34:21,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e8c300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:34:21, skipping insertion in model container [2025-02-06 04:34:21,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:34:21" (3/3) ... [2025-02-06 04:34:21,624 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-02-06 04:34:21,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:34:21,642 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 27 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-06 04:34:21,642 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:34:21,735 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:34:21,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 82 flow [2025-02-06 04:34:21,802 INFO L124 PetriNetUnfolderBase]: 8/32 cut-off events. [2025-02-06 04:34:21,807 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:34:21,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 8/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-06 04:34:21,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 34 transitions, 82 flow [2025-02-06 04:34:21,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 31 transitions, 74 flow [2025-02-06 04:34:21,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:34:21,839 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;@363a577f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:34:21,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:34:21,859 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:34:21,859 INFO L124 PetriNetUnfolderBase]: 8/30 cut-off events. [2025-02-06 04:34:21,859 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:34:21,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:21,860 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:34:21,861 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:34:21,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash -606871496, now seen corresponding path program 1 times [2025-02-06 04:34:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:21,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065489931] [2025-02-06 04:34:21,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:21,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:34:22,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:34:22,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:22,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:22,362 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:34:22,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:22,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065489931] [2025-02-06 04:34:22,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065489931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:22,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:34:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845172643] [2025-02-06 04:34:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:22,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:34:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:22,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:34:22,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:34:22,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:34:22,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 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,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:22,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:34:22,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:22,593 INFO L124 PetriNetUnfolderBase]: 202/329 cut-off events. [2025-02-06 04:34:22,593 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-06 04:34:22,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 329 events. 202/329 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1004 event pairs, 138 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 620. Up to 327 conditions per place. [2025-02-06 04:34:22,601 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 26 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2025-02-06 04:34:22,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 134 flow [2025-02-06 04:34:22,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:34:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:34:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-02-06 04:34:22,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2025-02-06 04:34:22,619 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 74 flow. Second operand 3 states and 43 transitions. [2025-02-06 04:34:22,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 134 flow [2025-02-06 04:34:22,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:34:22,627 INFO L231 Difference]: Finished difference. Result has 29 places, 31 transitions, 84 flow [2025-02-06 04:34:22,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=31} [2025-02-06 04:34:22,635 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-02-06 04:34:22,635 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 31 transitions, 84 flow [2025-02-06 04:34:22,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 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,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:22,636 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:34:22,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:34:22,636 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:34:22,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash -381221047, now seen corresponding path program 1 times [2025-02-06 04:34:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:22,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215405023] [2025-02-06 04:34:22,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:22,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:34:22,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:34:22,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:22,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:22,863 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:34:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215405023] [2025-02-06 04:34:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215405023] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356366117] [2025-02-06 04:34:22,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:22,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:22,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:22,870 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:34:22,872 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:34:22,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:34:23,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:34:23,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:23,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:23,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 04:34:23,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:34:23,090 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:34:23,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:34:23,115 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:34:23,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356366117] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:34:23,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:34:23,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-02-06 04:34:23,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870698069] [2025-02-06 04:34:23,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:34:23,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:34:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:23,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:34:23,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:34:23,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:34:23,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 31 transitions, 84 flow. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:23,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:23,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:34:23,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:23,342 INFO L124 PetriNetUnfolderBase]: 202/335 cut-off events. [2025-02-06 04:34:23,343 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 04:34:23,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 335 events. 202/335 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1007 event pairs, 138 based on Foata normal form. 3/275 useless extension candidates. Maximal degree in co-relation 666. Up to 327 conditions per place. [2025-02-06 04:34:23,345 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 26 selfloop transitions, 10 changer transitions 0/37 dead transitions. [2025-02-06 04:34:23,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 180 flow [2025-02-06 04:34:23,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:34:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:34:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-02-06 04:34:23,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2025-02-06 04:34:23,347 INFO L175 Difference]: Start difference. First operand has 29 places, 31 transitions, 84 flow. Second operand 6 states and 60 transitions. [2025-02-06 04:34:23,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 180 flow [2025-02-06 04:34:23,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:34:23,349 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 146 flow [2025-02-06 04:34:23,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2025-02-06 04:34:23,350 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-02-06 04:34:23,350 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 146 flow [2025-02-06 04:34:23,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:23,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:23,350 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:23,360 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:34:23,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:23,555 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:34:23,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:23,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1648320970, now seen corresponding path program 2 times [2025-02-06 04:34:23,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:23,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215111046] [2025-02-06 04:34:23,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:34:23,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:23,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:34:23,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 25 statements. [2025-02-06 04:34:23,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:34:23,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:24,723 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:34:24,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:24,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215111046] [2025-02-06 04:34:24,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215111046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:24,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:24,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:34:24,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837948591] [2025-02-06 04:34:24,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:24,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:34:24,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:24,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:34:24,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:34:24,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:34:24,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:24,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:24,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:34:24,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:25,001 INFO L124 PetriNetUnfolderBase]: 249/435 cut-off events. [2025-02-06 04:34:25,001 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:34:25,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 435 events. 249/435 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1549 event pairs, 138 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 858. Up to 319 conditions per place. [2025-02-06 04:34:25,005 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 49 selfloop transitions, 1 changer transitions 6/57 dead transitions. [2025-02-06 04:34:25,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 303 flow [2025-02-06 04:34:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:34:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:34:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-02-06 04:34:25,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4485294117647059 [2025-02-06 04:34:25,006 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 146 flow. Second operand 4 states and 61 transitions. [2025-02-06 04:34:25,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 303 flow [2025-02-06 04:34:25,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 287 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:34:25,009 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 137 flow [2025-02-06 04:34:25,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2025-02-06 04:34:25,010 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-02-06 04:34:25,011 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 137 flow [2025-02-06 04:34:25,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:25,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:25,011 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:25,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:34:25,012 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:34:25,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash -199162796, now seen corresponding path program 3 times [2025-02-06 04:34:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:25,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92186239] [2025-02-06 04:34:25,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:34:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:25,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-02-06 04:34:25,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 25 statements. [2025-02-06 04:34:25,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:34:25,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:25,761 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:34:25,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:25,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92186239] [2025-02-06 04:34:25,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92186239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:25,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:25,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:34:25,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928290017] [2025-02-06 04:34:25,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:25,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:34:25,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:25,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:34:25,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:34:25,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:34:25,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:25,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:25,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:34:25,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:26,077 INFO L124 PetriNetUnfolderBase]: 404/698 cut-off events. [2025-02-06 04:34:26,078 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-02-06 04:34:26,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 698 events. 404/698 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2747 event pairs, 154 based on Foata normal form. 1/627 useless extension candidates. Maximal degree in co-relation 1461. Up to 349 conditions per place. [2025-02-06 04:34:26,083 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 57 selfloop transitions, 8 changer transitions 2/68 dead transitions. [2025-02-06 04:34:26,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 345 flow [2025-02-06 04:34:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:34:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:34:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-02-06 04:34:26,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-02-06 04:34:26,086 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 137 flow. Second operand 4 states and 72 transitions. [2025-02-06 04:34:26,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 345 flow [2025-02-06 04:34:26,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 68 transitions, 339 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 04:34:26,090 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 200 flow [2025-02-06 04:34:26,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2025-02-06 04:34:26,092 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-02-06 04:34:26,092 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 45 transitions, 200 flow [2025-02-06 04:34:26,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:26,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:26,093 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, 1] [2025-02-06 04:34:26,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:34:26,093 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:34:26,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash 358720181, now seen corresponding path program 1 times [2025-02-06 04:34:26,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:26,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390111462] [2025-02-06 04:34:26,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:26,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:34:26,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:34:26,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:26,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:26,223 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:34:26,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:26,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390111462] [2025-02-06 04:34:26,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390111462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:26,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:26,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:34:26,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851404877] [2025-02-06 04:34:26,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:26,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:34:26,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:26,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:34:26,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:34:26,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:34:26,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:26,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:26,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:34:26,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:26,478 INFO L124 PetriNetUnfolderBase]: 396/700 cut-off events. [2025-02-06 04:34:26,478 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2025-02-06 04:34:26,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1720 conditions, 700 events. 396/700 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2837 event pairs, 214 based on Foata normal form. 9/678 useless extension candidates. Maximal degree in co-relation 1663. Up to 475 conditions per place. [2025-02-06 04:34:26,483 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 54 selfloop transitions, 3 changer transitions 6/64 dead transitions. [2025-02-06 04:34:26,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 379 flow [2025-02-06 04:34:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:34:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:34:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-02-06 04:34:26,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2025-02-06 04:34:26,485 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 200 flow. Second operand 3 states and 58 transitions. [2025-02-06 04:34:26,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 379 flow [2025-02-06 04:34:26,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 379 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:34:26,488 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 205 flow [2025-02-06 04:34:26,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2025-02-06 04:34:26,489 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2025-02-06 04:34:26,489 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 205 flow [2025-02-06 04:34:26,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:26,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:26,490 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, 1] [2025-02-06 04:34:26,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:34:26,490 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:34:26,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:26,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1399729127, now seen corresponding path program 1 times [2025-02-06 04:34:26,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:26,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735571535] [2025-02-06 04:34:26,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:26,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:26,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:34:26,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:34:26,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:26,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:26,602 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:34:26,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:26,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735571535] [2025-02-06 04:34:26,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735571535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:26,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:26,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:34:26,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722243216] [2025-02-06 04:34:26,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:26,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:34:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:26,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:34:26,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:34:26,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:34:26,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:26,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:26,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:34:26,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:26,764 INFO L124 PetriNetUnfolderBase]: 286/503 cut-off events. [2025-02-06 04:34:26,764 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2025-02-06 04:34:26,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 503 events. 286/503 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1693 event pairs, 103 based on Foata normal form. 27/503 useless extension candidates. Maximal degree in co-relation 1209. Up to 442 conditions per place. [2025-02-06 04:34:26,767 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 42 selfloop transitions, 2 changer transitions 3/48 dead transitions. [2025-02-06 04:34:26,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 289 flow [2025-02-06 04:34:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:34:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:34:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-02-06 04:34:26,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2025-02-06 04:34:26,769 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 205 flow. Second operand 3 states and 47 transitions. [2025-02-06 04:34:26,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 289 flow [2025-02-06 04:34:26,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 278 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 04:34:26,771 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 169 flow [2025-02-06 04:34:26,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-02-06 04:34:26,772 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2025-02-06 04:34:26,772 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 169 flow [2025-02-06 04:34:26,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:26,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:26,772 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, 1, 1, 1, 1] [2025-02-06 04:34:26,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:34:26,773 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:34:26,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:26,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1094502618, now seen corresponding path program 1 times [2025-02-06 04:34:26,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:26,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226578946] [2025-02-06 04:34:26,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:26,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:26,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:34:26,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:34:26,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:26,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:26,929 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:34:26,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:26,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226578946] [2025-02-06 04:34:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226578946] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:26,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448196415] [2025-02-06 04:34:26,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:26,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:26,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:26,933 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:34:26,935 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:34:27,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:34:27,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:34:27,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:27,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:27,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:34:27,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:34:27,180 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:34:27,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:34:27,236 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:34:27,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448196415] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:34:27,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:34:27,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 04:34:27,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034894885] [2025-02-06 04:34:27,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:34:27,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:34:27,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:27,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:34:27,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:34:27,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:34:27,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 169 flow. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:27,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:27,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:34:27,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:27,428 INFO L124 PetriNetUnfolderBase]: 273/478 cut-off events. [2025-02-06 04:34:27,428 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2025-02-06 04:34:27,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 478 events. 273/478 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1550 event pairs, 203 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 1099. Up to 467 conditions per place. [2025-02-06 04:34:27,432 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 29 selfloop transitions, 12 changer transitions 0/42 dead transitions. [2025-02-06 04:34:27,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 263 flow [2025-02-06 04:34:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:34:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:34:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2025-02-06 04:34:27,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24789915966386555 [2025-02-06 04:34:27,436 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 169 flow. Second operand 7 states and 59 transitions. [2025-02-06 04:34:27,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 263 flow [2025-02-06 04:34:27,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 256 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 04:34:27,438 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 208 flow [2025-02-06 04:34:27,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-02-06 04:34:27,441 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2025-02-06 04:34:27,441 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 208 flow [2025-02-06 04:34:27,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:27,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:27,442 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, 1, 1, 1] [2025-02-06 04:34:27,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:34:27,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:27,642 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:34:27,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:27,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1734148965, now seen corresponding path program 2 times [2025-02-06 04:34:27,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:27,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214737661] [2025-02-06 04:34:27,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:34:27,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:27,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:34:27,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 33 statements. [2025-02-06 04:34:27,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:34:27,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:27,762 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:27,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:27,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214737661] [2025-02-06 04:34:27,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214737661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:27,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:27,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:34:27,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467261778] [2025-02-06 04:34:27,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:27,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:34:27,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:27,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:34:27,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:34:27,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:34:27,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 208 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:34:27,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:27,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:34:27,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:27,962 INFO L124 PetriNetUnfolderBase]: 387/670 cut-off events. [2025-02-06 04:34:27,962 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-02-06 04:34:27,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 670 events. 387/670 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2414 event pairs, 226 based on Foata normal form. 26/644 useless extension candidates. Maximal degree in co-relation 1488. Up to 481 conditions per place. [2025-02-06 04:34:27,966 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 51 selfloop transitions, 4 changer transitions 1/57 dead transitions. [2025-02-06 04:34:27,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 361 flow [2025-02-06 04:34:27,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:34:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:34:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-02-06 04:34:27,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-02-06 04:34:27,968 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 208 flow. Second operand 3 states and 49 transitions. [2025-02-06 04:34:27,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 361 flow [2025-02-06 04:34:27,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 337 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 04:34:27,970 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 202 flow [2025-02-06 04:34:27,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-02-06 04:34:27,970 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2025-02-06 04:34:27,971 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 202 flow [2025-02-06 04:34:27,971 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:34:27,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:27,971 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, 1, 1, 1, 1] [2025-02-06 04:34:27,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:34:27,971 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:34:27,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:27,972 INFO L85 PathProgramCache]: Analyzing trace with hash -454404341, now seen corresponding path program 1 times [2025-02-06 04:34:27,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:27,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923717419] [2025-02-06 04:34:27,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:27,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:27,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 04:34:28,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 04:34:28,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:28,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:28,152 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:28,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:28,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923717419] [2025-02-06 04:34:28,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923717419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:28,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:28,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:34:28,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124413930] [2025-02-06 04:34:28,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:28,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:34:28,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:28,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:34:28,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:34:28,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:34:28,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:28,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:28,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:34:28,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:28,341 INFO L124 PetriNetUnfolderBase]: 458/792 cut-off events. [2025-02-06 04:34:28,341 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-02-06 04:34:28,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 792 events. 458/792 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2955 event pairs, 282 based on Foata normal form. 21/813 useless extension candidates. Maximal degree in co-relation 1895. Up to 635 conditions per place. [2025-02-06 04:34:28,347 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 50 selfloop transitions, 3 changer transitions 1/55 dead transitions. [2025-02-06 04:34:28,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 344 flow [2025-02-06 04:34:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:34:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:34:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-02-06 04:34:28,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-02-06 04:34:28,348 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 202 flow. Second operand 3 states and 48 transitions. [2025-02-06 04:34:28,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 344 flow [2025-02-06 04:34:28,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:34:28,350 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 215 flow [2025-02-06 04:34:28,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-02-06 04:34:28,351 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2025-02-06 04:34:28,351 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 215 flow [2025-02-06 04:34:28,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:34:28,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:28,352 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:28,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:34:28,352 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:34:28,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:28,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2043684236, now seen corresponding path program 1 times [2025-02-06 04:34:28,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:28,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551052734] [2025-02-06 04:34:28,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:28,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:28,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:34:28,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:34:28,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:28,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:34:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551052734] [2025-02-06 04:34:36,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551052734] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631333170] [2025-02-06 04:34:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:36,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:36,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:36,738 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:34:36,741 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:34:36,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:34:36,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:34:36,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:36,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:36,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 04:34:36,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:34:38,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:34:38,426 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 356 treesize of output 296 [2025-02-06 04:34:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:39,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:34:42,207 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-02-06 04:34:42,208 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 325 treesize of output 302 [2025-02-06 04:34:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:43,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631333170] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:34:43,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:34:43,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8, 8] total 34 [2025-02-06 04:34:43,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599063051] [2025-02-06 04:34:43,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:34:43,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 04:34:43,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:43,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 04:34:43,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 04:34:43,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:34:43,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 215 flow. Second operand has 34 states, 34 states have (on average 5.4411764705882355) internal successors, (185), 34 states have internal predecessors, (185), 0 states have call successors, (0), 0 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:43,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:43,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:34:43,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:48,106 INFO L124 PetriNetUnfolderBase]: 1768/3038 cut-off events. [2025-02-06 04:34:48,106 INFO L125 PetriNetUnfolderBase]: For 1363/1363 co-relation queries the response was YES. [2025-02-06 04:34:48,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7584 conditions, 3038 events. 1768/3038 cut-off events. For 1363/1363 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16524 event pairs, 332 based on Foata normal form. 2/3040 useless extension candidates. Maximal degree in co-relation 7476. Up to 540 conditions per place. [2025-02-06 04:34:48,127 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 217 selfloop transitions, 81 changer transitions 32/331 dead transitions. [2025-02-06 04:34:48,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 331 transitions, 1866 flow [2025-02-06 04:34:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 04:34:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-02-06 04:34:48,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 438 transitions. [2025-02-06 04:34:48,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28005115089514065 [2025-02-06 04:34:48,131 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 215 flow. Second operand 46 states and 438 transitions. [2025-02-06 04:34:48,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 331 transitions, 1866 flow [2025-02-06 04:34:48,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 331 transitions, 1836 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:34:48,142 INFO L231 Difference]: Finished difference. Result has 99 places, 114 transitions, 830 flow [2025-02-06 04:34:48,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=830, PETRI_PLACES=99, PETRI_TRANSITIONS=114} [2025-02-06 04:34:48,143 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2025-02-06 04:34:48,144 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 114 transitions, 830 flow [2025-02-06 04:34:48,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.4411764705882355) internal successors, (185), 34 states have internal predecessors, (185), 0 states have call successors, (0), 0 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:48,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:48,145 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:48,154 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:34:48,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:48,349 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:34:48,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:48,349 INFO L85 PathProgramCache]: Analyzing trace with hash 277062124, now seen corresponding path program 2 times [2025-02-06 04:34:48,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:48,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606643083] [2025-02-06 04:34:48,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:34:48,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:48,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 04:34:48,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:34:48,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:34:48,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:34:55,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:55,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606643083] [2025-02-06 04:34:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606643083] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:55,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105703241] [2025-02-06 04:34:55,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:34:55,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:55,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:55,601 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:34:55,602 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:34:55,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 04:34:55,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:34:55,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:34:55,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:55,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-06 04:34:55,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:34:56,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:34:56,691 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 326 treesize of output 274 [2025-02-06 04:34:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:34:57,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:34:59,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:34:59,555 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 387 treesize of output 359 [2025-02-06 04:35:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:35:00,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105703241] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:35:00,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:35:00,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 8] total 36 [2025-02-06 04:35:00,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230805044] [2025-02-06 04:35:00,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:35:00,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 04:35:00,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:00,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 04:35:00,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 04:35:00,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:35:00,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 114 transitions, 830 flow. Second operand has 36 states, 36 states have (on average 5.555555555555555) internal successors, (200), 36 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:35:00,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:00,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:35:00,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:03,635 INFO L124 PetriNetUnfolderBase]: 2306/4040 cut-off events. [2025-02-06 04:35:03,636 INFO L125 PetriNetUnfolderBase]: For 5762/5762 co-relation queries the response was YES. [2025-02-06 04:35:03,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11725 conditions, 4040 events. 2306/4040 cut-off events. For 5762/5762 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 23667 event pairs, 704 based on Foata normal form. 2/4042 useless extension candidates. Maximal degree in co-relation 11624. Up to 1571 conditions per place. [2025-02-06 04:35:03,669 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 128 selfloop transitions, 68 changer transitions 11/208 dead transitions. [2025-02-06 04:35:03,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 208 transitions, 1674 flow [2025-02-06 04:35:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 04:35:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 04:35:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 177 transitions. [2025-02-06 04:35:03,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26029411764705884 [2025-02-06 04:35:03,672 INFO L175 Difference]: Start difference. First operand has 99 places, 114 transitions, 830 flow. Second operand 20 states and 177 transitions. [2025-02-06 04:35:03,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 208 transitions, 1674 flow [2025-02-06 04:35:03,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 208 transitions, 1424 flow, removed 84 selfloop flow, removed 13 redundant places. [2025-02-06 04:35:03,693 INFO L231 Difference]: Finished difference. Result has 107 places, 137 transitions, 979 flow [2025-02-06 04:35:03,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=979, PETRI_PLACES=107, PETRI_TRANSITIONS=137} [2025-02-06 04:35:03,694 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2025-02-06 04:35:03,694 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 137 transitions, 979 flow [2025-02-06 04:35:03,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.555555555555555) internal successors, (200), 36 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:35:03,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:03,694 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:03,702 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:35:03,894 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,SelfDestructingSolverStorable10 [2025-02-06 04:35:03,895 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:35:03,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:03,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1104131756, now seen corresponding path program 3 times [2025-02-06 04:35:03,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:03,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748174609] [2025-02-06 04:35:03,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:35:03,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:03,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-02-06 04:35:04,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 37 statements. [2025-02-06 04:35:04,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:35:04,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:07,906 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:35:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748174609] [2025-02-06 04:35:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748174609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:35:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524505085] [2025-02-06 04:35:07,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:35:07,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:35:07,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:35:07,911 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:35:07,945 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:35:08,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-02-06 04:35:08,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 37 statements. [2025-02-06 04:35:08,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:35:08,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:08,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-06 04:35:08,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:35:10,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:35:10,430 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 356 treesize of output 288 [2025-02-06 04:35:11,333 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:35:11,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:35:13,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:35:13,562 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 417 treesize of output 395 [2025-02-06 04:35:15,148 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:35:15,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524505085] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:35:15,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:35:15,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 25 [2025-02-06 04:35:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404224664] [2025-02-06 04:35:15,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:35:15,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 04:35:15,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:15,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 04:35:15,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2025-02-06 04:35:15,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-02-06 04:35:15,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 137 transitions, 979 flow. Second operand has 25 states, 25 states have (on average 6.08) internal successors, (152), 25 states have internal predecessors, (152), 0 states have call successors, (0), 0 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:35:15,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:15,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-02-06 04:35:15,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:18,140 INFO L124 PetriNetUnfolderBase]: 2604/4572 cut-off events. [2025-02-06 04:35:18,141 INFO L125 PetriNetUnfolderBase]: For 9140/9140 co-relation queries the response was YES. [2025-02-06 04:35:18,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13765 conditions, 4572 events. 2604/4572 cut-off events. For 9140/9140 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 27863 event pairs, 744 based on Foata normal form. 2/4574 useless extension candidates. Maximal degree in co-relation 13682. Up to 1673 conditions per place. [2025-02-06 04:35:18,197 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 168 selfloop transitions, 69 changer transitions 13/251 dead transitions. [2025-02-06 04:35:18,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 251 transitions, 1995 flow [2025-02-06 04:35:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 04:35:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 04:35:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 191 transitions. [2025-02-06 04:35:18,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31209150326797386 [2025-02-06 04:35:18,204 INFO L175 Difference]: Start difference. First operand has 107 places, 137 transitions, 979 flow. Second operand 18 states and 191 transitions. [2025-02-06 04:35:18,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 251 transitions, 1995 flow [2025-02-06 04:35:18,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 251 transitions, 1956 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-02-06 04:35:18,287 INFO L231 Difference]: Finished difference. Result has 122 places, 157 transitions, 1300 flow [2025-02-06 04:35:18,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1300, PETRI_PLACES=122, PETRI_TRANSITIONS=157} [2025-02-06 04:35:18,291 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2025-02-06 04:35:18,292 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 157 transitions, 1300 flow [2025-02-06 04:35:18,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.08) internal successors, (152), 25 states have internal predecessors, (152), 0 states have call successors, (0), 0 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:35:18,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:18,293 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:18,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 04:35:18,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 04:35:18,494 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:35:18,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:18,497 INFO L85 PathProgramCache]: Analyzing trace with hash -811548872, now seen corresponding path program 4 times [2025-02-06 04:35:18,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:18,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076445201] [2025-02-06 04:35:18,497 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:35:18,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:18,554 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-02-06 04:35:18,775 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:35:18,775 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:35:18,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat