./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --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/pthread-ext/11_fmaxsymopt.i -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 ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:16:21,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:16:21,299 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:16:21,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:16:21,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:16:21,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:16:21,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:16:21,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:16:21,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:16:21,318 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:16:21,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:16:21,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:16:21,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:16:21,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:16:21,318 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:16:21,318 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:16:21,318 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:16:21,318 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:16:21,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:16:21,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:16:21,319 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:16:21,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:16:21,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:16:21,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:16:21,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:16:21,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:16:21,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:16:21,320 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-02-06 04:16:21,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:16:21,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:16:21,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:16:21,545 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:16:21,546 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:16:21,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-02-06 04:16:22,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ba9b82f2/6493733688724fcfb0e20b4c713c7d80/FLAG94eef053c [2025-02-06 04:16:22,929 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:16:22,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-02-06 04:16:22,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ba9b82f2/6493733688724fcfb0e20b4c713c7d80/FLAG94eef053c [2025-02-06 04:16:22,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ba9b82f2/6493733688724fcfb0e20b4c713c7d80 [2025-02-06 04:16:22,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:16:22,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:16:22,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:16:22,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:16:22,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:16:22,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:16:22" (1/1) ... [2025-02-06 04:16:22,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97cbf56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:22, skipping insertion in model container [2025-02-06 04:16:22,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:16:22" (1/1) ... [2025-02-06 04:16:23,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:16:23,249 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/pthread-ext/11_fmaxsymopt.i[30863,30876] [2025-02-06 04:16:23,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:16:23,271 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:16:23,300 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/pthread-ext/11_fmaxsymopt.i[30863,30876] [2025-02-06 04:16:23,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:16:23,332 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:16:23,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23 WrapperNode [2025-02-06 04:16:23,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:16:23,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:16:23,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:16:23,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:16:23,338 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:16:23" (1/1) ... [2025-02-06 04:16:23,345 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:16:23" (1/1) ... [2025-02-06 04:16:23,356 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-02-06 04:16:23,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:16:23,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:16:23,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:16:23,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:16:23,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23" (1/1) ... [2025-02-06 04:16:23,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23" (1/1) ... [2025-02-06 04:16:23,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23" (1/1) ... [2025-02-06 04:16:23,380 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-02-06 04:16:23,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23" (1/1) ... [2025-02-06 04:16:23,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23" (1/1) ... [2025-02-06 04:16:23,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23" (1/1) ... [2025-02-06 04:16:23,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23" (1/1) ... [2025-02-06 04:16:23,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23" (1/1) ... [2025-02-06 04:16:23,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23" (1/1) ... [2025-02-06 04:16:23,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:16:23,392 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:16:23,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:16:23,392 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:16:23,393 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23" (1/1) ... [2025-02-06 04:16:23,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:16:23,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:16:23,415 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:16:23,417 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:16:23,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:16:23,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:16:23,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:16:23,431 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 04:16:23,431 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 04:16:23,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:16:23,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:16:23,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:16:23,431 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 04:16:23,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:16:23,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:16:23,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:16:23,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:16:23,432 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 04:16:23,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:16:23,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:16:23,433 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:16:23,557 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:16:23,562 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:16:23,691 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:16:23,691 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:16:23,831 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:16:23,831 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:16:23,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:16:23 BoogieIcfgContainer [2025-02-06 04:16:23,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:16:23,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:16:23,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:16:23,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:16:23,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:16:22" (1/3) ... [2025-02-06 04:16:23,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5194b1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:16:23, skipping insertion in model container [2025-02-06 04:16:23,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:16:23" (2/3) ... [2025-02-06 04:16:23,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5194b1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:16:23, skipping insertion in model container [2025-02-06 04:16:23,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:16:23" (3/3) ... [2025-02-06 04:16:23,840 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-02-06 04:16:23,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:16:23,854 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 21 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-06 04:16:23,854 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:16:23,896 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:16:23,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 25 transitions, 54 flow [2025-02-06 04:16:23,944 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-02-06 04:16:23,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:16:23,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-02-06 04:16:23,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 25 transitions, 54 flow [2025-02-06 04:16:23,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 25 transitions, 54 flow [2025-02-06 04:16:23,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:16:23,969 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;@4d0621aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:16:23,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:16:23,977 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:16:23,977 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-02-06 04:16:23,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:16:23,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:23,979 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 04:16:23,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:16:23,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2098449854, now seen corresponding path program 1 times [2025-02-06 04:16:23,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:23,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38156407] [2025-02-06 04:16:23,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:23,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:24,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 04:16:24,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 04:16:24,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:24,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:24,206 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:16:24,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:24,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38156407] [2025-02-06 04:16:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38156407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:16:24,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:16:24,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:16:24,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353318720] [2025-02-06 04:16:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:16:24,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:16:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:24,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:16:24,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:16:24,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-02-06 04:16:24,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 25 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:16:24,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:24,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-02-06 04:16:24,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:24,295 INFO L124 PetriNetUnfolderBase]: 23/73 cut-off events. [2025-02-06 04:16:24,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:16:24,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 73 events. 23/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 16 based on Foata normal form. 3/71 useless extension candidates. Maximal degree in co-relation 109. Up to 51 conditions per place. [2025-02-06 04:16:24,300 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 14 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2025-02-06 04:16:24,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 84 flow [2025-02-06 04:16:24,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:16:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:16:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-02-06 04:16:24,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2025-02-06 04:16:24,310 INFO L175 Difference]: Start difference. First operand has 24 places, 25 transitions, 54 flow. Second operand 3 states and 43 transitions. [2025-02-06 04:16:24,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 84 flow [2025-02-06 04:16:24,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:16:24,314 INFO L231 Difference]: Finished difference. Result has 26 places, 24 transitions, 62 flow [2025-02-06 04:16:24,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=26, PETRI_TRANSITIONS=24} [2025-02-06 04:16:24,318 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-02-06 04:16:24,318 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2025-02-06 04:16:24,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:16:24,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:24,318 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:24,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:16:24,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:16:24,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1313958797, now seen corresponding path program 1 times [2025-02-06 04:16:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652742361] [2025-02-06 04:16:24,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:24,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:16:24,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:16:24,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:24,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:24,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652742361] [2025-02-06 04:16:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652742361] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:16:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274824860] [2025-02-06 04:16:24,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:24,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:16:24,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:16:24,377 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:16:24,381 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:16:24,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:16:24,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:16:24,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:24,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:24,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:16:24,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:16:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:24,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:16:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:24,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274824860] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:16:24,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:16:24,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 04:16:24,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826444678] [2025-02-06 04:16:24,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:16:24,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:16:24,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:24,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:16:24,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:16:24,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-02-06 04:16:24,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:16:24,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:24,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-02-06 04:16:24,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:24,551 INFO L124 PetriNetUnfolderBase]: 23/76 cut-off events. [2025-02-06 04:16:24,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:16:24,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 76 events. 23/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 16 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 133. Up to 51 conditions per place. [2025-02-06 04:16:24,552 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 14 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2025-02-06 04:16:24,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 112 flow [2025-02-06 04:16:24,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:16:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:16:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-02-06 04:16:24,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-02-06 04:16:24,553 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 6 states and 70 transitions. [2025-02-06 04:16:24,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 112 flow [2025-02-06 04:16:24,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 108 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:16:24,554 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 94 flow [2025-02-06 04:16:24,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2025-02-06 04:16:24,555 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2025-02-06 04:16:24,555 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 94 flow [2025-02-06 04:16:24,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:16:24,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:24,555 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-02-06 04:16:24,562 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:16:24,756 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:16:24,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:16:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1368110722, now seen corresponding path program 2 times [2025-02-06 04:16:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:24,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832874594] [2025-02-06 04:16:24,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:16:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:24,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 04:16:24,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:16:24,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:16:24,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:24,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:24,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832874594] [2025-02-06 04:16:24,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832874594] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:16:24,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010906163] [2025-02-06 04:16:24,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:16:24,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:16:24,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:16:24,904 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:16:24,905 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:16:24,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 04:16:24,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:16:24,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:16:24,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:24,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:16:24,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:16:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:24,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:16:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:25,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010906163] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:16:25,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:16:25,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-02-06 04:16:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557848546] [2025-02-06 04:16:25,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:16:25,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:16:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:25,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:16:25,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:16:25,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-02-06 04:16:25,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 94 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:16:25,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:25,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-02-06 04:16:25,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:25,063 INFO L124 PetriNetUnfolderBase]: 23/78 cut-off events. [2025-02-06 04:16:25,064 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 04:16:25,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 78 events. 23/78 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 16 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 124. Up to 51 conditions per place. [2025-02-06 04:16:25,064 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 14 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-02-06 04:16:25,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 148 flow [2025-02-06 04:16:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:16:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:16:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2025-02-06 04:16:25,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435 [2025-02-06 04:16:25,066 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 94 flow. Second operand 8 states and 87 transitions. [2025-02-06 04:16:25,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 148 flow [2025-02-06 04:16:25,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 134 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:16:25,067 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 116 flow [2025-02-06 04:16:25,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2025-02-06 04:16:25,068 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 17 predicate places. [2025-02-06 04:16:25,068 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 116 flow [2025-02-06 04:16:25,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:16:25,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:25,068 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2025-02-06 04:16:25,079 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:16:25,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:16:25,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:16:25,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash 519330, now seen corresponding path program 3 times [2025-02-06 04:16:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:25,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77477708] [2025-02-06 04:16:25,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:16:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:25,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-02-06 04:16:25,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 04:16:25,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 04:16:25,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:16:25,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:16:25,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 04:16:25,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 04:16:25,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:25,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:16:25,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:16:25,360 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:16:25,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-02-06 04:16:25,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-02-06 04:16:25,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-02-06 04:16:25,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:16:25,365 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-06 04:16:25,366 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:16:25,366 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 04:16:25,391 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:16:25,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 43 transitions, 96 flow [2025-02-06 04:16:25,403 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2025-02-06 04:16:25,403 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:16:25,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 48 events. 7/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2025-02-06 04:16:25,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 43 transitions, 96 flow [2025-02-06 04:16:25,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 43 transitions, 96 flow [2025-02-06 04:16:25,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:16:25,406 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;@4d0621aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:16:25,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:16:25,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:16:25,410 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-02-06 04:16:25,410 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:16:25,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:25,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:25,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 04:16:25,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:25,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2095272774, now seen corresponding path program 1 times [2025-02-06 04:16:25,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:25,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876354796] [2025-02-06 04:16:25,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:25,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:25,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:16:25,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:16:25,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:25,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:25,459 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:16:25,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:25,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876354796] [2025-02-06 04:16:25,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876354796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:16:25,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:16:25,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:16:25,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722379678] [2025-02-06 04:16:25,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:16:25,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:16:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:25,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:16:25,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:16:25,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-06 04:16:25,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:16:25,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:25,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-06 04:16:25,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:25,593 INFO L124 PetriNetUnfolderBase]: 452/940 cut-off events. [2025-02-06 04:16:25,593 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-02-06 04:16:25,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 940 events. 452/940 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4852 event pairs, 376 based on Foata normal form. 83/971 useless extension candidates. Maximal degree in co-relation 954. Up to 708 conditions per place. [2025-02-06 04:16:25,600 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-02-06 04:16:25,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 144 flow [2025-02-06 04:16:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:16:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:16:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-02-06 04:16:25,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-02-06 04:16:25,602 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 96 flow. Second operand 3 states and 75 transitions. [2025-02-06 04:16:25,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 144 flow [2025-02-06 04:16:25,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:16:25,604 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 102 flow [2025-02-06 04:16:25,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=102, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-02-06 04:16:25,605 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-02-06 04:16:25,606 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 102 flow [2025-02-06 04:16:25,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:16:25,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:25,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:25,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:16:25,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 04:16:25,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash 233561184, now seen corresponding path program 1 times [2025-02-06 04:16:25,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:25,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667199594] [2025-02-06 04:16:25,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:25,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:25,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:16:25,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:16:25,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:25,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:25,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:25,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667199594] [2025-02-06 04:16:25,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667199594] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:16:25,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172054229] [2025-02-06 04:16:25,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:25,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:16:25,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:16:25,643 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:16:25,646 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:16:25,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:16:25,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:16:25,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:25,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:25,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:16:25,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:16:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:25,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:16:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:25,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172054229] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:16:25,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:16:25,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 04:16:25,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856809069] [2025-02-06 04:16:25,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:16:25,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:16:25,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:25,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:16:25,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:16:25,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-06 04:16:25,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:16:25,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:25,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-06 04:16:25,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:25,883 INFO L124 PetriNetUnfolderBase]: 452/943 cut-off events. [2025-02-06 04:16:25,883 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-02-06 04:16:25,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1697 conditions, 943 events. 452/943 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4847 event pairs, 376 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 1684. Up to 708 conditions per place. [2025-02-06 04:16:25,887 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-02-06 04:16:25,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 172 flow [2025-02-06 04:16:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:16:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:16:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-02-06 04:16:25,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2025-02-06 04:16:25,890 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 102 flow. Second operand 6 states and 122 transitions. [2025-02-06 04:16:25,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 172 flow [2025-02-06 04:16:25,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 168 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:16:25,892 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 134 flow [2025-02-06 04:16:25,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-02-06 04:16:25,893 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2025-02-06 04:16:25,893 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 134 flow [2025-02-06 04:16:25,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:16:25,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:25,894 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:25,904 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:16:26,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:16:26,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 04:16:26,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:26,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1085683258, now seen corresponding path program 2 times [2025-02-06 04:16:26,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:26,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128477357] [2025-02-06 04:16:26,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:16:26,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:26,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 04:16:26,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-02-06 04:16:26,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:16:26,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:16:26,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:26,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128477357] [2025-02-06 04:16:26,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128477357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:16:26,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:16:26,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:16:26,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475929013] [2025-02-06 04:16:26,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:16:26,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:16:26,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:26,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:16:26,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:16:26,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-02-06 04:16:26,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:16:26,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:26,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-02-06 04:16:26,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:26,321 INFO L124 PetriNetUnfolderBase]: 764/1596 cut-off events. [2025-02-06 04:16:26,321 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 04:16:26,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2879 conditions, 1596 events. 764/1596 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9556 event pairs, 331 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 2844. Up to 634 conditions per place. [2025-02-06 04:16:26,328 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 46 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-02-06 04:16:26,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 271 flow [2025-02-06 04:16:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:16:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:16:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-02-06 04:16:26,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2025-02-06 04:16:26,329 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 134 flow. Second operand 3 states and 87 transitions. [2025-02-06 04:16:26,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 271 flow [2025-02-06 04:16:26,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 257 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:16:26,331 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 134 flow [2025-02-06 04:16:26,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2025-02-06 04:16:26,332 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2025-02-06 04:16:26,332 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 134 flow [2025-02-06 04:16:26,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:16:26,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:26,332 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 04:16:26,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:16:26,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 04:16:26,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash -209004737, now seen corresponding path program 1 times [2025-02-06 04:16:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121892923] [2025-02-06 04:16:26,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:26,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:16:26,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:16:26,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:26,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:26,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121892923] [2025-02-06 04:16:26,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121892923] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:16:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285734187] [2025-02-06 04:16:26,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:26,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:16:26,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:16:26,406 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:16:26,410 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:16:26,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:16:26,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:16:26,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:26,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:26,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:16:26,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:16:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:26,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:16:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:26,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285734187] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:16:26,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:16:26,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-02-06 04:16:26,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836577670] [2025-02-06 04:16:26,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:16:26,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:16:26,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:26,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:16:26,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:16:26,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-06 04:16:26,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 134 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:16:26,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:26,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-06 04:16:26,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:26,698 INFO L124 PetriNetUnfolderBase]: 776/1626 cut-off events. [2025-02-06 04:16:26,698 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2025-02-06 04:16:26,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 1626 events. 776/1626 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9761 event pairs, 646 based on Foata normal form. 2/1535 useless extension candidates. Maximal degree in co-relation 3052. Up to 1206 conditions per place. [2025-02-06 04:16:26,706 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 26 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2025-02-06 04:16:26,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 212 flow [2025-02-06 04:16:26,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:16:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:16:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2025-02-06 04:16:26,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44476744186046513 [2025-02-06 04:16:26,707 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 134 flow. Second operand 8 states and 153 transitions. [2025-02-06 04:16:26,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 212 flow [2025-02-06 04:16:26,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:16:26,709 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 166 flow [2025-02-06 04:16:26,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=166, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2025-02-06 04:16:26,710 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2025-02-06 04:16:26,710 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 166 flow [2025-02-06 04:16:26,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:16:26,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:26,710 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 04:16:26,720 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:16:26,911 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,SelfDestructingSolverStorable7 [2025-02-06 04:16:26,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 04:16:26,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:26,912 INFO L85 PathProgramCache]: Analyzing trace with hash -142308737, now seen corresponding path program 2 times [2025-02-06 04:16:26,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:26,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498504099] [2025-02-06 04:16:26,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:16:26,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:26,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 04:16:26,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:16:26,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:16:26,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:16:26,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:16:26,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:16:26,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:16:26,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:26,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:16:26,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:16:26,941 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:16:26,941 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-06 04:16:26,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-02-06 04:16:26,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-02-06 04:16:26,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-06 04:16:26,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:16:26,941 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2025-02-06 04:16:26,942 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:16:26,942 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 04:16:26,964 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:16:26,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 140 flow [2025-02-06 04:16:26,971 INFO L124 PetriNetUnfolderBase]: 10/69 cut-off events. [2025-02-06 04:16:26,971 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 04:16:26,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 69 events. 10/69 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 186 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2025-02-06 04:16:26,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 140 flow [2025-02-06 04:16:26,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 140 flow [2025-02-06 04:16:26,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:16:26,973 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;@4d0621aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:16:26,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:16:26,975 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:16:26,975 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-02-06 04:16:26,975 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:16:26,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:26,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:26,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:16:26,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1155961175, now seen corresponding path program 1 times [2025-02-06 04:16:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:26,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257328079] [2025-02-06 04:16:26,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:26,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:16:26,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:16:26,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:26,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:26,995 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:16:26,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257328079] [2025-02-06 04:16:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257328079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:16:26,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:16:26,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:16:26,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464504172] [2025-02-06 04:16:26,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:16:26,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:16:26,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:26,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:16:26,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:16:26,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-02-06 04:16:26,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:16:26,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:26,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-02-06 04:16:26,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:27,892 INFO L124 PetriNetUnfolderBase]: 6485/10724 cut-off events. [2025-02-06 04:16:27,893 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-02-06 04:16:27,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19890 conditions, 10724 events. 6485/10724 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 72597 event pairs, 5560 based on Foata normal form. 1265/11470 useless extension candidates. Maximal degree in co-relation 2088. Up to 8808 conditions per place. [2025-02-06 04:16:27,938 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 34 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-02-06 04:16:27,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 206 flow [2025-02-06 04:16:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:16:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:16:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-02-06 04:16:27,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846994535519126 [2025-02-06 04:16:27,940 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 140 flow. Second operand 3 states and 107 transitions. [2025-02-06 04:16:27,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 206 flow [2025-02-06 04:16:27,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 204 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 04:16:27,942 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 142 flow [2025-02-06 04:16:27,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2025-02-06 04:16:27,944 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-02-06 04:16:27,944 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 142 flow [2025-02-06 04:16:27,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:16:27,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:27,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:27,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:16:27,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:16:27,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash 708677038, now seen corresponding path program 1 times [2025-02-06 04:16:27,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157561529] [2025-02-06 04:16:27,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:27,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:16:27,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:16:27,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:27,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:27,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157561529] [2025-02-06 04:16:27,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157561529] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:16:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173263840] [2025-02-06 04:16:27,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:27,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:16:27,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:16:27,983 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:16:27,991 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:16:28,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:16:28,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:16:28,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:28,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:28,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:16:28,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:16:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:28,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:16:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:28,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173263840] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:16:28,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:16:28,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 04:16:28,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112703784] [2025-02-06 04:16:28,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:16:28,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:16:28,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:28,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:16:28,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:16:28,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-02-06 04:16:28,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:16:28,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:28,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-02-06 04:16:28,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:28,840 INFO L124 PetriNetUnfolderBase]: 6485/10727 cut-off events. [2025-02-06 04:16:28,841 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2025-02-06 04:16:28,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19825 conditions, 10727 events. 6485/10727 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 72524 event pairs, 5560 based on Foata normal form. 0/10208 useless extension candidates. Maximal degree in co-relation 19811. Up to 8808 conditions per place. [2025-02-06 04:16:28,879 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 34 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-02-06 04:16:28,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 232 flow [2025-02-06 04:16:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:16:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:16:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2025-02-06 04:16:28,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47540983606557374 [2025-02-06 04:16:28,881 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 142 flow. Second operand 6 states and 174 transitions. [2025-02-06 04:16:28,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 232 flow [2025-02-06 04:16:28,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 228 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:16:28,883 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 174 flow [2025-02-06 04:16:28,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-02-06 04:16:28,884 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-02-06 04:16:28,884 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 174 flow [2025-02-06 04:16:28,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:16:28,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:28,884 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:28,890 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:16:29,085 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,SelfDestructingSolverStorable10 [2025-02-06 04:16:29,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:16:29,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1626238743, now seen corresponding path program 2 times [2025-02-06 04:16:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352263669] [2025-02-06 04:16:29,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:16:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:29,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 04:16:29,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-02-06 04:16:29,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:16:29,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:16:29,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:29,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352263669] [2025-02-06 04:16:29,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352263669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:16:29,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:16:29,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:16:29,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500769755] [2025-02-06 04:16:29,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:16:29,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:16:29,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:29,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:16:29,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:16:29,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-02-06 04:16:29,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:16:29,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:29,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-02-06 04:16:29,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:30,121 INFO L124 PetriNetUnfolderBase]: 10967/18271 cut-off events. [2025-02-06 04:16:30,122 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2025-02-06 04:16:30,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33703 conditions, 18271 events. 10967/18271 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 136829 event pairs, 4912 based on Foata normal form. 0/17486 useless extension candidates. Maximal degree in co-relation 33667. Up to 7834 conditions per place. [2025-02-06 04:16:30,272 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 66 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-02-06 04:16:30,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 376 flow [2025-02-06 04:16:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:16:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:16:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-02-06 04:16:30,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6994535519125683 [2025-02-06 04:16:30,274 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 174 flow. Second operand 3 states and 128 transitions. [2025-02-06 04:16:30,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 376 flow [2025-02-06 04:16:30,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 362 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:16:30,277 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 174 flow [2025-02-06 04:16:30,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2025-02-06 04:16:30,278 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2025-02-06 04:16:30,278 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 174 flow [2025-02-06 04:16:30,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:16:30,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:30,279 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:30,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:16:30,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:16:30,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash 366165105, now seen corresponding path program 1 times [2025-02-06 04:16:30,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:30,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751339641] [2025-02-06 04:16:30,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:30,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:30,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:16:30,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:16:30,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:30,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:16:30,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:30,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751339641] [2025-02-06 04:16:30,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751339641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:16:30,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:16:30,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:16:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535483284] [2025-02-06 04:16:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:16:30,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:16:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:30,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:16:30,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:16:30,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-02-06 04:16:30,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:16:30,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:30,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-02-06 04:16:30,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:32,116 INFO L124 PetriNetUnfolderBase]: 18668/31005 cut-off events. [2025-02-06 04:16:32,116 INFO L125 PetriNetUnfolderBase]: For 4419/4419 co-relation queries the response was YES. [2025-02-06 04:16:32,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59770 conditions, 31005 events. 18668/31005 cut-off events. For 4419/4419 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 250148 event pairs, 8353 based on Foata normal form. 0/29699 useless extension candidates. Maximal degree in co-relation 59739. Up to 13303 conditions per place. [2025-02-06 04:16:32,263 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 69 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-02-06 04:16:32,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 391 flow [2025-02-06 04:16:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:16:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:16:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-02-06 04:16:32,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6939890710382514 [2025-02-06 04:16:32,264 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 174 flow. Second operand 3 states and 127 transitions. [2025-02-06 04:16:32,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 391 flow [2025-02-06 04:16:32,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:16:32,278 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 184 flow [2025-02-06 04:16:32,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2025-02-06 04:16:32,279 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2025-02-06 04:16:32,279 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 184 flow [2025-02-06 04:16:32,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:16:32,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:32,279 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:32,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:16:32,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:16:32,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1349479095, now seen corresponding path program 1 times [2025-02-06 04:16:32,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:32,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684505734] [2025-02-06 04:16:32,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:32,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:16:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:16:32,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:32,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:32,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:32,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684505734] [2025-02-06 04:16:32,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684505734] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:16:32,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268919839] [2025-02-06 04:16:32,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:32,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:16:32,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:16:32,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:16:32,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 04:16:32,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:16:32,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:16:32,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:32,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:32,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:16:32,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:16:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:32,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:16:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:32,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268919839] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:16:32,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:16:32,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-02-06 04:16:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381269850] [2025-02-06 04:16:32,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:16:32,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:16:32,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:32,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:16:32,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:16:32,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-02-06 04:16:32,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 184 flow. Second operand has 9 states, 9 states have (on average 23.77777777777778) internal successors, (214), 9 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:16:32,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:32,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-02-06 04:16:32,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:34,197 INFO L124 PetriNetUnfolderBase]: 18836/31249 cut-off events. [2025-02-06 04:16:34,197 INFO L125 PetriNetUnfolderBase]: For 5514/5514 co-relation queries the response was YES. [2025-02-06 04:16:34,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61815 conditions, 31249 events. 18836/31249 cut-off events. For 5514/5514 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 251584 event pairs, 16018 based on Foata normal form. 2/29730 useless extension candidates. Maximal degree in co-relation 61775. Up to 25299 conditions per place. [2025-02-06 04:16:34,388 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 38 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-02-06 04:16:34,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 65 transitions, 286 flow [2025-02-06 04:16:34,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:16:34,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:16:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2025-02-06 04:16:34,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4487704918032787 [2025-02-06 04:16:34,390 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 184 flow. Second operand 8 states and 219 transitions. [2025-02-06 04:16:34,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 65 transitions, 286 flow [2025-02-06 04:16:34,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 65 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:16:34,414 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 216 flow [2025-02-06 04:16:34,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2025-02-06 04:16:34,415 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places. [2025-02-06 04:16:34,415 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 216 flow [2025-02-06 04:16:34,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.77777777777778) internal successors, (214), 9 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:16:34,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:34,416 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:34,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 04:16:34,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 04:16:34,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:16:34,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash 651118185, now seen corresponding path program 2 times [2025-02-06 04:16:34,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:34,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141184768] [2025-02-06 04:16:34,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:16:34,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:34,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 04:16:34,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:16:34,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:16:34,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:16:34,645 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:16:34,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:16:34,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:16:34,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:34,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:16:34,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:16:34,670 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:16:34,670 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 04:16:34,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-06 04:16:34,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-06 04:16:34,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-06 04:16:34,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-06 04:16:34,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:16:34,670 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-02-06 04:16:34,671 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:16:34,671 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 04:16:34,707 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:16:34,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 79 transitions, 186 flow [2025-02-06 04:16:34,714 INFO L124 PetriNetUnfolderBase]: 13/90 cut-off events. [2025-02-06 04:16:34,714 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 04:16:34,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 90 events. 13/90 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 272 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2025-02-06 04:16:34,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 79 transitions, 186 flow [2025-02-06 04:16:34,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 79 transitions, 186 flow [2025-02-06 04:16:34,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:16:34,716 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;@4d0621aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:16:34,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:16:34,718 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:16:34,718 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-02-06 04:16:34,718 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:16:34,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:34,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:34,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-06 04:16:34,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:34,718 INFO L85 PathProgramCache]: Analyzing trace with hash 850687144, now seen corresponding path program 1 times [2025-02-06 04:16:34,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:34,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181362738] [2025-02-06 04:16:34,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:34,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:34,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:16:34,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:16:34,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:34,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:34,736 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:16:34,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:34,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181362738] [2025-02-06 04:16:34,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181362738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:16:34,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:16:34,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:16:34,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055363340] [2025-02-06 04:16:34,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:16:34,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:16:34,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:34,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:16:34,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:16:34,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2025-02-06 04:16:34,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:16:34,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:34,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2025-02-06 04:16:34,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:41,056 INFO L124 PetriNetUnfolderBase]: 80345/117739 cut-off events. [2025-02-06 04:16:41,057 INFO L125 PetriNetUnfolderBase]: For 9197/9197 co-relation queries the response was YES. [2025-02-06 04:16:41,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223134 conditions, 117739 events. 80345/117739 cut-off events. For 9197/9197 co-relation queries the response was YES. Maximal size of possible extension queue 3143. Compared 905583 event pairs, 69712 based on Foata normal form. 16246/129231 useless extension candidates. Maximal degree in co-relation 19970. Up to 101391 conditions per place. [2025-02-06 04:16:41,736 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 44 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-02-06 04:16:41,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 75 transitions, 270 flow [2025-02-06 04:16:41,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:16:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:16:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-02-06 04:16:41,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5864978902953587 [2025-02-06 04:16:41,739 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 186 flow. Second operand 3 states and 139 transitions. [2025-02-06 04:16:41,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 75 transitions, 270 flow [2025-02-06 04:16:41,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 264 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 04:16:41,745 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 182 flow [2025-02-06 04:16:41,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2025-02-06 04:16:41,746 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-02-06 04:16:41,746 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 182 flow [2025-02-06 04:16:41,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:16:41,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:41,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:41,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:16:41,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-06 04:16:41,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:41,748 INFO L85 PathProgramCache]: Analyzing trace with hash -651578802, now seen corresponding path program 1 times [2025-02-06 04:16:41,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:41,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661538177] [2025-02-06 04:16:41,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:41,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:41,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:16:41,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:16:41,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:41,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:41,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:41,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661538177] [2025-02-06 04:16:41,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661538177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:16:41,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473351618] [2025-02-06 04:16:41,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:16:41,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:16:41,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:16:41,794 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:16:41,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 04:16:41,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:16:41,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:16:41,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:41,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:41,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:16:41,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:16:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:41,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:16:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:16:41,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473351618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:16:41,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:16:41,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 04:16:41,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80387433] [2025-02-06 04:16:41,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:16:41,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:16:41,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:41,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:16:41,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:16:41,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2025-02-06 04:16:41,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 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:16:41,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:41,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2025-02-06 04:16:41,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:48,454 INFO L124 PetriNetUnfolderBase]: 80345/117742 cut-off events. [2025-02-06 04:16:48,454 INFO L125 PetriNetUnfolderBase]: For 3919/3919 co-relation queries the response was YES. [2025-02-06 04:16:48,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221611 conditions, 117742 events. 80345/117742 cut-off events. For 3919/3919 co-relation queries the response was YES. Maximal size of possible extension queue 3143. Compared 905896 event pairs, 69712 based on Foata normal form. 0/112988 useless extension candidates. Maximal degree in co-relation 221596. Up to 101391 conditions per place. [2025-02-06 04:16:49,428 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 44 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2025-02-06 04:16:49,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 78 transitions, 292 flow [2025-02-06 04:16:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:16:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:16:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2025-02-06 04:16:49,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4767932489451477 [2025-02-06 04:16:49,430 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 182 flow. Second operand 6 states and 226 transitions. [2025-02-06 04:16:49,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 78 transitions, 292 flow [2025-02-06 04:16:49,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 78 transitions, 288 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:16:49,452 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 214 flow [2025-02-06 04:16:49,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2025-02-06 04:16:49,453 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-02-06 04:16:49,453 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 214 flow [2025-02-06 04:16:49,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 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:16:49,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:49,453 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:49,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 04:16:49,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:16:49,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-06 04:16:49,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash -991318488, now seen corresponding path program 2 times [2025-02-06 04:16:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:49,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942876979] [2025-02-06 04:16:49,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:16:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:49,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 04:16:49,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-02-06 04:16:49,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:16:49,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:16:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:16:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:16:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942876979] [2025-02-06 04:16:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942876979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:16:49,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:16:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:16:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414732818] [2025-02-06 04:16:49,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:16:49,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:16:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:16:49,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:16:49,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:16:49,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2025-02-06 04:16:49,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:16:49,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:16:49,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2025-02-06 04:16:49,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand