./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 f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:27:12,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:27:12,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:27:12,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:27:12,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:27:12,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:27:12,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:27:12,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:27:12,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:27:12,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:27:12,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:27:12,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:27:12,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:27:12,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:27:12,156 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:27:12,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:27:12,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:27:12,156 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:27:12,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:27:12,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:27:12,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:27:12,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:27:12,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:27:12,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:27:12,158 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:27:12,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:27:12,158 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:27:12,158 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:27:12,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:27:12,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:27:12,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:27:12,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:27:12,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:27:12,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:27:12,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:27:12,160 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:27:12,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:27:12,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:27:12,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:27:12,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:27:12,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:27:12,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:27:12,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:27:12,160 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-03-13 21:27:12,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:27:12,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:27:12,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:27:12,390 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:27:12,390 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:27:12,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-13 21:27:13,479 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0b38551/be72e24528f14d3096e50400e814fc3e/FLAG78eee8b23 [2025-03-13 21:27:13,728 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:27:13,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-13 21:27:13,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0b38551/be72e24528f14d3096e50400e814fc3e/FLAG78eee8b23 [2025-03-13 21:27:13,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0b38551/be72e24528f14d3096e50400e814fc3e [2025-03-13 21:27:13,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:27:13,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:27:13,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:27:13,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:27:13,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:27:13,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:27:13" (1/1) ... [2025-03-13 21:27:13,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb6a6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:13, skipping insertion in model container [2025-03-13 21:27:13,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:27:13" (1/1) ... [2025-03-13 21:27:13,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:27:14,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30863,30876] [2025-03-13 21:27:14,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:27:14,035 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:27:14,063 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30863,30876] [2025-03-13 21:27:14,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:27:14,091 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:27:14,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14 WrapperNode [2025-03-13 21:27:14,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:27:14,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:27:14,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:27:14,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:27:14,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,114 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-03-13 21:27:14,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:27:14,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:27:14,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:27:14,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:27:14,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,130 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-03-13 21:27:14,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:27:14,137 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:27:14,137 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:27:14,137 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:27:14,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (1/1) ... [2025-03-13 21:27:14,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:27:14,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:14,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:27:14,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:27:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:27:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:27:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:27:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:27:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:27:14,176 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:27:14,258 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:27:14,260 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:27:14,396 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:27:14,396 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:27:14,396 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:27:14,499 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:27:14,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:27:14 BoogieIcfgContainer [2025-03-13 21:27:14,502 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:27:14,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:27:14,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:27:14,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:27:14,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:27:13" (1/3) ... [2025-03-13 21:27:14,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f677e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:27:14, skipping insertion in model container [2025-03-13 21:27:14,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:27:14" (2/3) ... [2025-03-13 21:27:14,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f677e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:27:14, skipping insertion in model container [2025-03-13 21:27:14,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:27:14" (3/3) ... [2025-03-13 21:27:14,509 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-03-13 21:27:14,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:27:14,521 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-03-13 21:27:14,521 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:27:14,552 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:14,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 25 transitions, 54 flow [2025-03-13 21:27:14,593 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-13 21:27:14,595 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:27:14,597 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-03-13 21:27:14,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 25 transitions, 54 flow [2025-03-13 21:27:14,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 25 transitions, 54 flow [2025-03-13 21:27:14,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:14,615 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;@444abd27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:14,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:27:14,623 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:14,625 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-03-13 21:27:14,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:27:14,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:14,627 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-13 21:27:14,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-13 21:27:14,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2127079005, now seen corresponding path program 1 times [2025-03-13 21:27:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:14,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927897017] [2025-03-13 21:27:14,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:14,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:14,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:27:14,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:27:14,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:14,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:14,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:14,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927897017] [2025-03-13 21:27:14,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927897017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:14,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:14,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:14,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930827733] [2025-03-13 21:27:14,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:14,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:14,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:14,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:14,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:14,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-13 21:27:14,845 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-03-13 21:27:14,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:14,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-13 21:27:14,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:14,897 INFO L124 PetriNetUnfolderBase]: 23/73 cut-off events. [2025-03-13 21:27:14,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:27:14,899 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-03-13 21:27:14,900 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 14 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2025-03-13 21:27:14,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 84 flow [2025-03-13 21:27:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-13 21:27:14,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2025-03-13 21:27:14,911 INFO L175 Difference]: Start difference. First operand has 24 places, 25 transitions, 54 flow. Second operand 3 states and 43 transitions. [2025-03-13 21:27:14,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 84 flow [2025-03-13 21:27:14,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:27:14,916 INFO L231 Difference]: Finished difference. Result has 26 places, 24 transitions, 62 flow [2025-03-13 21:27:14,918 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-03-13 21:27:14,922 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-03-13 21:27:14,922 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2025-03-13 21:27:14,922 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-03-13 21:27:14,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:14,923 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:14,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:27:14,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-13 21:27:14,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:14,924 INFO L85 PathProgramCache]: Analyzing trace with hash -455084267, now seen corresponding path program 1 times [2025-03-13 21:27:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:14,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739258183] [2025-03-13 21:27:14,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:14,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:14,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:27:14,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:27:14,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:14,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:15,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:15,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739258183] [2025-03-13 21:27:15,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739258183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:15,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38975396] [2025-03-13 21:27:15,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:15,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:15,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:15,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:27:15,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:27:15,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:27:15,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:27:15,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:15,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:15,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:27:15,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:15,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:15,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38975396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:15,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:15,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:27:15,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670783189] [2025-03-13 21:27:15,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:15,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:27:15,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:15,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:27:15,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:27:15,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-13 21:27:15,134 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-03-13 21:27:15,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:15,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-13 21:27:15,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:15,191 INFO L124 PetriNetUnfolderBase]: 23/76 cut-off events. [2025-03-13 21:27:15,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:27:15,191 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-03-13 21:27:15,192 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 14 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2025-03-13 21:27:15,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 112 flow [2025-03-13 21:27:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:27:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:27:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-03-13 21:27:15,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-13 21:27:15,193 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 6 states and 70 transitions. [2025-03-13 21:27:15,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 112 flow [2025-03-13 21:27:15,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 108 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:15,194 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 94 flow [2025-03-13 21:27:15,194 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-03-13 21:27:15,194 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2025-03-13 21:27:15,194 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 94 flow [2025-03-13 21:27:15,194 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-03-13 21:27:15,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:15,194 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-03-13 21:27:15,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:27:15,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:15,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-13 21:27:15,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1965827619, now seen corresponding path program 2 times [2025-03-13 21:27:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:15,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192827654] [2025-03-13 21:27:15,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:15,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-13 21:27:15,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:27:15,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:27:15,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:15,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:15,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192827654] [2025-03-13 21:27:15,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192827654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:15,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283523471] [2025-03-13 21:27:15,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:15,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:15,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:27:15,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:27:15,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-13 21:27:15,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:27:15,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:27:15,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:15,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:27:15,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:15,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:15,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283523471] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:15,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:15,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-13 21:27:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630767271] [2025-03-13 21:27:15,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:15,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:27:15,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:15,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:27:15,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:27:15,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-13 21:27:15,649 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-03-13 21:27:15,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:15,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-13 21:27:15,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:15,697 INFO L124 PetriNetUnfolderBase]: 23/78 cut-off events. [2025-03-13 21:27:15,697 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 21:27:15,697 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-03-13 21:27:15,698 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 14 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-03-13 21:27:15,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 148 flow [2025-03-13 21:27:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:27:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:27:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2025-03-13 21:27:15,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435 [2025-03-13 21:27:15,699 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 94 flow. Second operand 8 states and 87 transitions. [2025-03-13 21:27:15,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 148 flow [2025-03-13 21:27:15,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 134 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:15,700 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 116 flow [2025-03-13 21:27:15,700 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-03-13 21:27:15,701 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 17 predicate places. [2025-03-13 21:27:15,701 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 116 flow [2025-03-13 21:27:15,701 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-03-13 21:27:15,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:15,701 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2025-03-13 21:27:15,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:27:15,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-13 21:27:15,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-13 21:27:15,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1069632413, now seen corresponding path program 3 times [2025-03-13 21:27:15,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:15,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609300543] [2025-03-13 21:27:15,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:27:15,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:15,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-03-13 21:27:15,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:27:15,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-13 21:27:15,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:15,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:27:15,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:27:15,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:27:15,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:15,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:15,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:27:15,972 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:27:15,972 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-13 21:27:15,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-13 21:27:15,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-13 21:27:15,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:27:15,974 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-13 21:27:15,975 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:27:15,975 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:27:15,990 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:15,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 43 transitions, 96 flow [2025-03-13 21:27:15,997 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2025-03-13 21:27:15,997 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:27:15,997 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-03-13 21:27:15,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 43 transitions, 96 flow [2025-03-13 21:27:15,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 43 transitions, 96 flow [2025-03-13 21:27:15,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:15,998 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;@444abd27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:15,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:27:16,001 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:16,001 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-13 21:27:16,001 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:27:16,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:16,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:16,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:27:16,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1207769093, now seen corresponding path program 1 times [2025-03-13 21:27:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:16,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586049512] [2025-03-13 21:27:16,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:16,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:27:16,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:27:16,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:16,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:16,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:16,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586049512] [2025-03-13 21:27:16,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586049512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:16,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:16,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:16,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668166833] [2025-03-13 21:27:16,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:16,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:16,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:16,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:16,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-13 21:27:16,048 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-03-13 21:27:16,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:16,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-13 21:27:16,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:16,165 INFO L124 PetriNetUnfolderBase]: 452/940 cut-off events. [2025-03-13 21:27:16,165 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-13 21:27:16,167 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-03-13 21:27:16,171 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-03-13 21:27:16,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 144 flow [2025-03-13 21:27:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-03-13 21:27:16,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-03-13 21:27:16,172 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 96 flow. Second operand 3 states and 75 transitions. [2025-03-13 21:27:16,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 144 flow [2025-03-13 21:27:16,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:27:16,174 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 102 flow [2025-03-13 21:27:16,174 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-03-13 21:27:16,174 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-03-13 21:27:16,174 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 102 flow [2025-03-13 21:27:16,175 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-03-13 21:27:16,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:16,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:16,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:27:16,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:27:16,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1088867838, now seen corresponding path program 1 times [2025-03-13 21:27:16,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:16,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576644488] [2025-03-13 21:27:16,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:16,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:16,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:27:16,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:27:16,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:16,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:16,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:16,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576644488] [2025-03-13 21:27:16,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576644488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:16,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872148367] [2025-03-13 21:27:16,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:16,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:16,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:16,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:27:16,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:27:16,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:27:16,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:27:16,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:16,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:16,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:27:16,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:16,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:16,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872148367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:16,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:16,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:27:16,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190135041] [2025-03-13 21:27:16,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:16,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:27:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:16,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:27:16,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:27:16,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-13 21:27:16,320 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-03-13 21:27:16,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:16,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-13 21:27:16,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:16,427 INFO L124 PetriNetUnfolderBase]: 452/943 cut-off events. [2025-03-13 21:27:16,428 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-13 21:27:16,430 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-03-13 21:27:16,433 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-03-13 21:27:16,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 172 flow [2025-03-13 21:27:16,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:27:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:27:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-03-13 21:27:16,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2025-03-13 21:27:16,442 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 102 flow. Second operand 6 states and 122 transitions. [2025-03-13 21:27:16,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 172 flow [2025-03-13 21:27:16,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 168 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:16,444 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 134 flow [2025-03-13 21:27:16,444 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-03-13 21:27:16,444 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2025-03-13 21:27:16,444 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 134 flow [2025-03-13 21:27:16,444 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-03-13 21:27:16,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:16,444 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:16,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:27:16,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:16,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:27:16,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:16,645 INFO L85 PathProgramCache]: Analyzing trace with hash 263671365, now seen corresponding path program 2 times [2025-03-13 21:27:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:16,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257572645] [2025-03-13 21:27:16,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:16,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:16,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-13 21:27:16,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-13 21:27:16,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:27:16,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:27:16,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:16,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257572645] [2025-03-13 21:27:16,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257572645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:16,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:16,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:27:16,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232067234] [2025-03-13 21:27:16,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:16,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:16,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:16,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:16,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:16,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-13 21:27:16,718 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-03-13 21:27:16,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:16,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-13 21:27:16,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:16,912 INFO L124 PetriNetUnfolderBase]: 764/1596 cut-off events. [2025-03-13 21:27:16,912 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-13 21:27:16,915 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-03-13 21:27:16,921 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 46 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-03-13 21:27:16,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 271 flow [2025-03-13 21:27:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-13 21:27:16,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2025-03-13 21:27:16,922 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 134 flow. Second operand 3 states and 87 transitions. [2025-03-13 21:27:16,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 271 flow [2025-03-13 21:27:16,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 257 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:16,923 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 134 flow [2025-03-13 21:27:16,924 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-03-13 21:27:16,928 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2025-03-13 21:27:16,928 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 134 flow [2025-03-13 21:27:16,928 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-03-13 21:27:16,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:16,928 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:27:16,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:27:16,928 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-03-13 21:27:16,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash -559335426, now seen corresponding path program 1 times [2025-03-13 21:27:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:16,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730847649] [2025-03-13 21:27:16,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:16,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:16,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:27:16,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:27:16,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:16,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:17,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730847649] [2025-03-13 21:27:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730847649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708196006] [2025-03-13 21:27:17,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:17,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:17,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:17,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:27:17,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:27:17,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:27:17,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:27:17,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:17,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:17,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:27:17,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:17,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:17,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708196006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:17,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:17,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-13 21:27:17,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998745852] [2025-03-13 21:27:17,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:17,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:27:17,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:17,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:27:17,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:27:17,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-13 21:27:17,151 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-03-13 21:27:17,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:17,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-13 21:27:17,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:17,310 INFO L124 PetriNetUnfolderBase]: 776/1626 cut-off events. [2025-03-13 21:27:17,311 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2025-03-13 21:27:17,316 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-03-13 21:27:17,323 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 26 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2025-03-13 21:27:17,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 212 flow [2025-03-13 21:27:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:27:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:27:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2025-03-13 21:27:17,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44476744186046513 [2025-03-13 21:27:17,325 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 134 flow. Second operand 8 states and 153 transitions. [2025-03-13 21:27:17,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 212 flow [2025-03-13 21:27:17,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:27:17,329 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 166 flow [2025-03-13 21:27:17,329 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-03-13 21:27:17,329 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2025-03-13 21:27:17,329 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 166 flow [2025-03-13 21:27:17,330 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-03-13 21:27:17,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:17,330 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:27:17,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:27:17,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:17,530 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-03-13 21:27:17,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash 509353758, now seen corresponding path program 2 times [2025-03-13 21:27:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:17,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335072963] [2025-03-13 21:27:17,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:17,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-13 21:27:17,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:27:17,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:27:17,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:17,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:27:17,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:27:17,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:27:17,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:17,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:17,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:27:17,557 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:27:17,559 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-13 21:27:17,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-13 21:27:17,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-13 21:27:17,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-13 21:27:17,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:27:17,560 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2025-03-13 21:27:17,561 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:27:17,561 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:27:17,584 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:17,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 140 flow [2025-03-13 21:27:17,590 INFO L124 PetriNetUnfolderBase]: 10/69 cut-off events. [2025-03-13 21:27:17,590 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:27:17,590 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-03-13 21:27:17,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 140 flow [2025-03-13 21:27:17,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 140 flow [2025-03-13 21:27:17,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:17,591 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;@444abd27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:17,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:27:17,593 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:17,593 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-03-13 21:27:17,593 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:27:17,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:17,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:17,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:27:17,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:17,594 INFO L85 PathProgramCache]: Analyzing trace with hash 268457494, now seen corresponding path program 1 times [2025-03-13 21:27:17,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:17,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852566941] [2025-03-13 21:27:17,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:17,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:17,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:27:17,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:27:17,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:17,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:17,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852566941] [2025-03-13 21:27:17,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852566941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:17,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:17,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:17,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748324511] [2025-03-13 21:27:17,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:17,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:17,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:17,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:17,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:17,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-13 21:27:17,625 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-03-13 21:27:17,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:17,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-13 21:27:17,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:18,342 INFO L124 PetriNetUnfolderBase]: 6485/10724 cut-off events. [2025-03-13 21:27:18,342 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-03-13 21:27:18,355 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-03-13 21:27:18,397 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 34 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-03-13 21:27:18,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 206 flow [2025-03-13 21:27:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-13 21:27:18,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846994535519126 [2025-03-13 21:27:18,398 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 140 flow. Second operand 3 states and 107 transitions. [2025-03-13 21:27:18,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 206 flow [2025-03-13 21:27:18,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 204 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:27:18,402 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 142 flow [2025-03-13 21:27:18,403 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-03-13 21:27:18,404 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-03-13 21:27:18,404 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 142 flow [2025-03-13 21:27:18,405 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-03-13 21:27:18,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:18,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:18,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:27:18,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:27:18,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1563983692, now seen corresponding path program 1 times [2025-03-13 21:27:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334384685] [2025-03-13 21:27:18,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:18,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:27:18,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:27:18,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:18,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:18,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-03-13 21:27:18,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:18,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334384685] [2025-03-13 21:27:18,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334384685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:18,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612528202] [2025-03-13 21:27:18,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:18,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:18,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:18,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:27:18,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:27:18,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:27:18,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:27:18,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:18,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:18,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:27:18,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:18,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612528202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:18,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:27:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921800322] [2025-03-13 21:27:18,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:18,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:27:18,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:18,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:27:18,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:27:18,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-13 21:27:18,634 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-03-13 21:27:18,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:18,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-13 21:27:18,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:19,326 INFO L124 PetriNetUnfolderBase]: 6485/10727 cut-off events. [2025-03-13 21:27:19,326 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2025-03-13 21:27:19,344 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-03-13 21:27:19,376 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 34 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-03-13 21:27:19,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 232 flow [2025-03-13 21:27:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:27:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:27:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2025-03-13 21:27:19,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47540983606557374 [2025-03-13 21:27:19,377 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 142 flow. Second operand 6 states and 174 transitions. [2025-03-13 21:27:19,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 232 flow [2025-03-13 21:27:19,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 228 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:19,379 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 174 flow [2025-03-13 21:27:19,379 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-03-13 21:27:19,380 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-03-13 21:27:19,380 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 174 flow [2025-03-13 21:27:19,380 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-03-13 21:27:19,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:19,380 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:19,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 21:27:19,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-13 21:27:19,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:27:19,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1319373930, now seen corresponding path program 2 times [2025-03-13 21:27:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961375309] [2025-03-13 21:27:19,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:19,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-13 21:27:19,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-13 21:27:19,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:27:19,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:27:19,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:19,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961375309] [2025-03-13 21:27:19,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961375309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:19,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:19,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:27:19,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304146795] [2025-03-13 21:27:19,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:19,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:19,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:19,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:19,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:19,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-03-13 21:27:19,616 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-03-13 21:27:19,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:19,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-03-13 21:27:19,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:20,835 INFO L124 PetriNetUnfolderBase]: 10967/18271 cut-off events. [2025-03-13 21:27:20,835 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2025-03-13 21:27:20,860 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-03-13 21:27:20,916 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 66 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-03-13 21:27:20,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 376 flow [2025-03-13 21:27:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-03-13 21:27:20,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6994535519125683 [2025-03-13 21:27:20,918 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 174 flow. Second operand 3 states and 128 transitions. [2025-03-13 21:27:20,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 376 flow [2025-03-13 21:27:20,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 362 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:20,919 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 174 flow [2025-03-13 21:27:20,920 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-03-13 21:27:20,920 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2025-03-13 21:27:20,920 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 174 flow [2025-03-13 21:27:20,920 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-03-13 21:27:20,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:20,920 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:20,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:27:20,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:27:20,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:20,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1904151662, now seen corresponding path program 1 times [2025-03-13 21:27:20,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:20,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142037083] [2025-03-13 21:27:20,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:20,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:20,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:27:20,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:27:20,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:20,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:27:20,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:20,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142037083] [2025-03-13 21:27:20,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142037083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:20,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:20,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:27:20,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447979496] [2025-03-13 21:27:20,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:20,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:20,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:20,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:20,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-03-13 21:27:20,979 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-03-13 21:27:20,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:20,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-03-13 21:27:20,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:22,544 INFO L124 PetriNetUnfolderBase]: 18668/31005 cut-off events. [2025-03-13 21:27:22,544 INFO L125 PetriNetUnfolderBase]: For 4419/4419 co-relation queries the response was YES. [2025-03-13 21:27:22,609 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-03-13 21:27:22,701 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 69 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-03-13 21:27:22,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 391 flow [2025-03-13 21:27:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-03-13 21:27:22,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6939890710382514 [2025-03-13 21:27:22,703 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 174 flow. Second operand 3 states and 127 transitions. [2025-03-13 21:27:22,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 391 flow [2025-03-13 21:27:22,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:27:22,718 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 184 flow [2025-03-13 21:27:22,718 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-03-13 21:27:22,718 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2025-03-13 21:27:22,718 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 184 flow [2025-03-13 21:27:22,719 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-03-13 21:27:22,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:22,719 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:22,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:27:22,719 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-03-13 21:27:22,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1280505814, now seen corresponding path program 1 times [2025-03-13 21:27:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:22,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322462438] [2025-03-13 21:27:22,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:22,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:22,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:27:22,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:27:22,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:22,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:22,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322462438] [2025-03-13 21:27:22,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322462438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607309179] [2025-03-13 21:27:22,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:22,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:22,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:22,784 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:27:22,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:27:22,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:27:22,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:27:22,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:22,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:22,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:27:22,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:22,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607309179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:22,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-13 21:27:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573338822] [2025-03-13 21:27:22,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:22,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:27:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:22,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:27:22,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:27:22,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-03-13 21:27:22,906 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-03-13 21:27:22,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:22,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-03-13 21:27:22,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:24,770 INFO L124 PetriNetUnfolderBase]: 18836/31249 cut-off events. [2025-03-13 21:27:24,770 INFO L125 PetriNetUnfolderBase]: For 5514/5514 co-relation queries the response was YES. [2025-03-13 21:27:24,883 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-03-13 21:27:24,992 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 38 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-03-13 21:27:24,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 65 transitions, 286 flow [2025-03-13 21:27:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:27:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:27:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2025-03-13 21:27:24,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4487704918032787 [2025-03-13 21:27:24,995 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 184 flow. Second operand 8 states and 219 transitions. [2025-03-13 21:27:24,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 65 transitions, 286 flow [2025-03-13 21:27:25,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 65 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:27:25,020 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 216 flow [2025-03-13 21:27:25,020 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-03-13 21:27:25,021 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places. [2025-03-13 21:27:25,022 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 216 flow [2025-03-13 21:27:25,022 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-03-13 21:27:25,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:25,022 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:25,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-13 21:27:25,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:25,227 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-03-13 21:27:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1076328810, now seen corresponding path program 2 times [2025-03-13 21:27:25,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:25,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223881227] [2025-03-13 21:27:25,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:25,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:25,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:27:25,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:27:25,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:27:25,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:25,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:27:25,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:27:25,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:27:25,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:25,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:25,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:27:25,265 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:27:25,265 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-13 21:27:25,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-13 21:27:25,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-13 21:27:25,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-13 21:27:25,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-13 21:27:25,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:27:25,265 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-03-13 21:27:25,266 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:27:25,266 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:27:25,294 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:25,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 79 transitions, 186 flow [2025-03-13 21:27:25,303 INFO L124 PetriNetUnfolderBase]: 13/90 cut-off events. [2025-03-13 21:27:25,303 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:27:25,304 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-03-13 21:27:25,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 79 transitions, 186 flow [2025-03-13 21:27:25,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 79 transitions, 186 flow [2025-03-13 21:27:25,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:25,305 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;@444abd27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:25,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:27:25,307 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:25,307 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-13 21:27:25,307 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:27:25,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:25,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:25,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:27:25,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:25,308 INFO L85 PathProgramCache]: Analyzing trace with hash -36816537, now seen corresponding path program 1 times [2025-03-13 21:27:25,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:25,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919026474] [2025-03-13 21:27:25,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:25,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:25,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:27:25,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:27:25,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:25,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:25,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:25,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919026474] [2025-03-13 21:27:25,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919026474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:25,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:25,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:25,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748838068] [2025-03-13 21:27:25,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:25,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:25,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:25,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:25,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:25,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2025-03-13 21:27:25,329 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-03-13 21:27:25,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:25,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2025-03-13 21:27:25,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:31,633 INFO L124 PetriNetUnfolderBase]: 80345/117739 cut-off events. [2025-03-13 21:27:31,633 INFO L125 PetriNetUnfolderBase]: For 9197/9197 co-relation queries the response was YES. [2025-03-13 21:27:31,909 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-03-13 21:27:32,556 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 44 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-03-13 21:27:32,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 75 transitions, 270 flow [2025-03-13 21:27:32,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-03-13 21:27:32,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5864978902953587 [2025-03-13 21:27:32,558 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 186 flow. Second operand 3 states and 139 transitions. [2025-03-13 21:27:32,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 75 transitions, 270 flow [2025-03-13 21:27:32,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 264 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-13 21:27:32,562 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 182 flow [2025-03-13 21:27:32,562 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-03-13 21:27:32,562 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-03-13 21:27:32,562 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 182 flow [2025-03-13 21:27:32,562 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-03-13 21:27:32,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:32,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:32,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:27:32,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:27:32,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash 203727852, now seen corresponding path program 1 times [2025-03-13 21:27:32,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:32,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351048829] [2025-03-13 21:27:32,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:32,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:32,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:27:32,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:27:32,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:32,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:32,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:32,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351048829] [2025-03-13 21:27:32,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351048829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:32,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372415004] [2025-03-13 21:27:32,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:32,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:32,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:32,590 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:27:32,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 21:27:32,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:27:32,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:27:32,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:32,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:32,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:27:32,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:32,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:32,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372415004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:32,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:32,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:27:32,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864497817] [2025-03-13 21:27:32,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:32,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:27:32,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:32,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:27:32,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:27:32,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2025-03-13 21:27:32,673 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-03-13 21:27:32,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:32,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2025-03-13 21:27:32,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:39,368 INFO L124 PetriNetUnfolderBase]: 80345/117742 cut-off events. [2025-03-13 21:27:39,368 INFO L125 PetriNetUnfolderBase]: For 3919/3919 co-relation queries the response was YES. [2025-03-13 21:27:39,661 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-03-13 21:27:40,115 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 44 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2025-03-13 21:27:40,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 78 transitions, 292 flow [2025-03-13 21:27:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:27:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:27:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2025-03-13 21:27:40,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4767932489451477 [2025-03-13 21:27:40,117 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 182 flow. Second operand 6 states and 226 transitions. [2025-03-13 21:27:40,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 78 transitions, 292 flow [2025-03-13 21:27:40,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 78 transitions, 288 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:40,128 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 214 flow [2025-03-13 21:27:40,128 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-03-13 21:27:40,128 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-03-13 21:27:40,128 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 214 flow [2025-03-13 21:27:40,128 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-03-13 21:27:40,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:40,128 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:40,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-13 21:27:40,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:40,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:27:40,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash 358036135, now seen corresponding path program 2 times [2025-03-13 21:27:40,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:40,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636414267] [2025-03-13 21:27:40,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:40,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:40,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-13 21:27:40,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-13 21:27:40,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:27:40,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:27:40,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:40,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636414267] [2025-03-13 21:27:40,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636414267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:40,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:40,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:27:40,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071833517] [2025-03-13 21:27:40,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:40,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:40,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:40,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:40,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:40,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2025-03-13 21:27:40,541 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-03-13 21:27:40,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:40,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2025-03-13 21:27:40,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:52,279 INFO L124 PetriNetUnfolderBase]: 135494/200633 cut-off events. [2025-03-13 21:27:52,279 INFO L125 PetriNetUnfolderBase]: For 5377/5377 co-relation queries the response was YES. [2025-03-13 21:27:52,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376203 conditions, 200633 events. 135494/200633 cut-off events. For 5377/5377 co-relation queries the response was YES. Maximal size of possible extension queue 5304. Compared 1683956 event pairs, 61693 based on Foata normal form. 0/193517 useless extension candidates. Maximal degree in co-relation 376166. Up to 90130 conditions per place. [2025-03-13 21:27:53,602 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 86 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2025-03-13 21:27:53,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 116 transitions, 481 flow [2025-03-13 21:27:53,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-03-13 21:27:53,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7130801687763713 [2025-03-13 21:27:53,603 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 214 flow. Second operand 3 states and 169 transitions. [2025-03-13 21:27:53,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 116 transitions, 481 flow [2025-03-13 21:27:53,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 116 transitions, 467 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:53,619 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 214 flow [2025-03-13 21:27:53,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2025-03-13 21:27:53,620 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 12 predicate places. [2025-03-13 21:27:53,620 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 214 flow [2025-03-13 21:27:53,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-03-13 21:27:53,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:53,621 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:53,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 21:27:53,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:27:53,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:53,622 INFO L85 PathProgramCache]: Analyzing trace with hash -519687839, now seen corresponding path program 1 times [2025-03-13 21:27:53,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:53,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343256942] [2025-03-13 21:27:53,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:53,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:53,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:27:53,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:27:53,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:53,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:27:53,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:53,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343256942] [2025-03-13 21:27:53,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343256942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:53,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:53,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:27:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552689762] [2025-03-13 21:27:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:53,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:53,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:53,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:53,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2025-03-13 21:27:53,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:27:53,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:53,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2025-03-13 21:27:53,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand