./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:55:35,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:55:35,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 00:55:35,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:55:35,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:55:35,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:55:35,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:55:35,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:55:35,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:55:35,123 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:55:35,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:55:35,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:55:35,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:55:35,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:55:35,124 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:55:35,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:55:35,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:55:35,124 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 00:55:35,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:55:35,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 00:55:35,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:55:35,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:55:35,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:55:35,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:55:35,125 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 00:55:35,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:55:35,125 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:55:35,125 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:55:35,125 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:55:35,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:55:35,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:55:35,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:55:35,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:55:35,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:55:35,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:55:35,126 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:55:35,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:55:35,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:55:35,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:55:35,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:55:35,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:55:35,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:55:35,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:55:35,126 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-02-08 00:55:35,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:55:35,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:55:35,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:55:35,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:55:35,338 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:55:35,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-02-08 00:55:36,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d65ff0c62/fb034816048f4407a89c435436e47087/FLAG60832f929 [2025-02-08 00:55:36,713 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:55:36,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-02-08 00:55:36,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d65ff0c62/fb034816048f4407a89c435436e47087/FLAG60832f929 [2025-02-08 00:55:36,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d65ff0c62/fb034816048f4407a89c435436e47087 [2025-02-08 00:55:36,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:55:36,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:55:36,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:55:36,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:55:36,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:55:36,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b211f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36, skipping insertion in model container [2025-02-08 00:55:36,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:55:36,973 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i[30746,30759] [2025-02-08 00:55:36,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:55:36,991 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:55:37,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i[30746,30759] [2025-02-08 00:55:37,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:55:37,061 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:55:37,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37 WrapperNode [2025-02-08 00:55:37,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:55:37,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:55:37,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:55:37,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:55:37,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,096 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2025-02-08 00:55:37,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:55:37,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:55:37,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:55:37,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:55:37,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,123 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-02-08 00:55:37,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:55:37,141 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:55:37,141 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:55:37,141 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:55:37,142 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (1/1) ... [2025-02-08 00:55:37,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:55:37,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:37,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:55:37,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 00:55:37,195 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 00:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:55:37,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:55:37,196 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 00:55:37,305 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:55:37,307 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:55:37,457 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 00:55:37,457 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:55:37,572 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:55:37,573 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:55:37,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:37 BoogieIcfgContainer [2025-02-08 00:55:37,573 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:55:37,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:55:37,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:55:37,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:55:37,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:55:36" (1/3) ... [2025-02-08 00:55:37,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da0a624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:55:37, skipping insertion in model container [2025-02-08 00:55:37,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:37" (2/3) ... [2025-02-08 00:55:37,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da0a624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:55:37, skipping insertion in model container [2025-02-08 00:55:37,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:37" (3/3) ... [2025-02-08 00:55:37,587 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-02-08 00:55:37,599 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:55:37,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 20 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-08 00:55:37,602 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 00:55:37,645 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:37,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 23 transitions, 50 flow [2025-02-08 00:55:37,703 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-02-08 00:55:37,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:55:37,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 25 events. 3/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 22 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-02-08 00:55:37,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 23 transitions, 50 flow [2025-02-08 00:55:37,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 23 transitions, 50 flow [2025-02-08 00:55:37,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:37,733 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;@7b937343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:37,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 00:55:37,740 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:37,741 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-02-08 00:55:37,741 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:55:37,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:37,741 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:55:37,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:55:37,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1413728522, now seen corresponding path program 1 times [2025-02-08 00:55:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:37,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128836849] [2025-02-08 00:55:37,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:37,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:55:37,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:55:37,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:37,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:37,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:37,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128836849] [2025-02-08 00:55:37,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128836849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:37,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:37,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:55:37,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601167228] [2025-02-08 00:55:37,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:37,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:55:37,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:37,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:55:37,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:55:37,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-02-08 00:55:37,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:37,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:37,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-02-08 00:55:37,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:38,048 INFO L124 PetriNetUnfolderBase]: 20/68 cut-off events. [2025-02-08 00:55:38,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:55:38,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 68 events. 20/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 16 based on Foata normal form. 3/64 useless extension candidates. Maximal degree in co-relation 105. Up to 51 conditions per place. [2025-02-08 00:55:38,051 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 14 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2025-02-08 00:55:38,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 80 flow [2025-02-08 00:55:38,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:55:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:55:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-02-08 00:55:38,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2025-02-08 00:55:38,061 INFO L175 Difference]: Start difference. First operand has 23 places, 23 transitions, 50 flow. Second operand 3 states and 37 transitions. [2025-02-08 00:55:38,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 80 flow [2025-02-08 00:55:38,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 00:55:38,069 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 58 flow [2025-02-08 00:55:38,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2025-02-08 00:55:38,073 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-02-08 00:55:38,075 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 58 flow [2025-02-08 00:55:38,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:38,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:38,075 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:38,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:55:38,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:55:38,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:38,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2096037558, now seen corresponding path program 1 times [2025-02-08 00:55:38,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:38,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073433041] [2025-02-08 00:55:38,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:38,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:55:38,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:55:38,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:38,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073433041] [2025-02-08 00:55:38,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073433041] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:55:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181807884] [2025-02-08 00:55:38,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:38,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:38,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:38,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:55:38,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:55:38,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:55:38,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:55:38,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:38,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:38,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 00:55:38,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:55:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:38,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:55:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:38,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181807884] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:55:38,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:55:38,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 00:55:38,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138140262] [2025-02-08 00:55:38,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:55:38,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:55:38,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:38,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:55:38,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:55:38,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-02-08 00:55:38,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 58 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:38,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:38,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-02-08 00:55:38,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:38,334 INFO L124 PetriNetUnfolderBase]: 20/71 cut-off events. [2025-02-08 00:55:38,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:55:38,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 71 events. 20/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 16 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 128. Up to 51 conditions per place. [2025-02-08 00:55:38,335 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 14 selfloop transitions, 5 changer transitions 0/25 dead transitions. [2025-02-08 00:55:38,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 108 flow [2025-02-08 00:55:38,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:55:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 00:55:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-02-08 00:55:38,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42028985507246375 [2025-02-08 00:55:38,338 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 58 flow. Second operand 6 states and 58 transitions. [2025-02-08 00:55:38,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 108 flow [2025-02-08 00:55:38,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 104 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 00:55:38,339 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 90 flow [2025-02-08 00:55:38,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2025-02-08 00:55:38,340 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 9 predicate places. [2025-02-08 00:55:38,340 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 90 flow [2025-02-08 00:55:38,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:38,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:38,340 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-02-08 00:55:38,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:55:38,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:38,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:55:38,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1069951990, now seen corresponding path program 2 times [2025-02-08 00:55:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:38,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131858666] [2025-02-08 00:55:38,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:38,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:38,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 00:55:38,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 00:55:38,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:55:38,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:38,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131858666] [2025-02-08 00:55:38,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131858666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:55:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309021389] [2025-02-08 00:55:38,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:38,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:38,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:38,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:55:38,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:55:38,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 00:55:38,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 00:55:38,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:55:38,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:38,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 00:55:38,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:55:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:38,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:55:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:38,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309021389] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:55:38,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:55:38,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-02-08 00:55:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325605968] [2025-02-08 00:55:38,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:55:38,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:55:38,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:38,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:55:38,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:55:38,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-02-08 00:55:38,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 90 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:38,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:38,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-02-08 00:55:38,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:38,842 INFO L124 PetriNetUnfolderBase]: 20/73 cut-off events. [2025-02-08 00:55:38,843 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 00:55:38,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 73 events. 20/73 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 16 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 119. Up to 51 conditions per place. [2025-02-08 00:55:38,843 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 14 selfloop transitions, 7 changer transitions 0/27 dead transitions. [2025-02-08 00:55:38,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 144 flow [2025-02-08 00:55:38,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:55:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 00:55:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2025-02-08 00:55:38,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3858695652173913 [2025-02-08 00:55:38,845 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 90 flow. Second operand 8 states and 71 transitions. [2025-02-08 00:55:38,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 144 flow [2025-02-08 00:55:38,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 130 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 00:55:38,846 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 112 flow [2025-02-08 00:55:38,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=112, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2025-02-08 00:55:38,847 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 17 predicate places. [2025-02-08 00:55:38,847 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 112 flow [2025-02-08 00:55:38,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:38,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:38,847 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2025-02-08 00:55:38,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 00:55:39,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:39,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:55:39,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:39,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1337341558, now seen corresponding path program 3 times [2025-02-08 00:55:39,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:39,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954112748] [2025-02-08 00:55:39,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 00:55:39,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:39,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-02-08 00:55:39,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 00:55:39,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 00:55:39,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:39,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:55:39,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 00:55:39,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 00:55:39,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:39,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:39,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:55:39,128 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:55:39,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-02-08 00:55:39,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-02-08 00:55:39,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-02-08 00:55:39,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:55:39,131 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-08 00:55:39,132 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:55:39,133 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 00:55:39,148 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:39,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 39 transitions, 88 flow [2025-02-08 00:55:39,162 INFO L124 PetriNetUnfolderBase]: 5/44 cut-off events. [2025-02-08 00:55:39,162 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 00:55:39,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 44 events. 5/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2025-02-08 00:55:39,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 39 transitions, 88 flow [2025-02-08 00:55:39,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 39 transitions, 88 flow [2025-02-08 00:55:39,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:39,166 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;@7b937343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:39,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 00:55:39,171 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:39,172 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-08 00:55:39,172 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 00:55:39,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:39,172 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-02-08 00:55:39,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 00:55:39,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash 302701224, now seen corresponding path program 1 times [2025-02-08 00:55:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:39,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574259958] [2025-02-08 00:55:39,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:39,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:39,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 00:55:39,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 00:55:39,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:39,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:39,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:39,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574259958] [2025-02-08 00:55:39,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574259958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:39,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:39,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:55:39,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960770433] [2025-02-08 00:55:39,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:39,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:55:39,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:39,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:55:39,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:55:39,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-02-08 00:55:39,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:39,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:39,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-02-08 00:55:39,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:39,340 INFO L124 PetriNetUnfolderBase]: 434/922 cut-off events. [2025-02-08 00:55:39,341 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 00:55:39,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 922 events. 434/922 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4760 event pairs, 376 based on Foata normal form. 51/864 useless extension candidates. Maximal degree in co-relation 1014. Up to 708 conditions per place. [2025-02-08 00:55:39,349 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 24 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-02-08 00:55:39,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 136 flow [2025-02-08 00:55:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:55:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:55:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-02-08 00:55:39,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-02-08 00:55:39,352 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 88 flow. Second operand 3 states and 63 transitions. [2025-02-08 00:55:39,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 136 flow [2025-02-08 00:55:39,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 00:55:39,353 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 94 flow [2025-02-08 00:55:39,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-02-08 00:55:39,353 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2025-02-08 00:55:39,353 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 94 flow [2025-02-08 00:55:39,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:39,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:39,353 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:39,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:55:39,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 00:55:39,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:39,354 INFO L85 PathProgramCache]: Analyzing trace with hash 352795451, now seen corresponding path program 1 times [2025-02-08 00:55:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:39,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149104782] [2025-02-08 00:55:39,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:39,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 00:55:39,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 00:55:39,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:39,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:39,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149104782] [2025-02-08 00:55:39,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149104782] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:55:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422420249] [2025-02-08 00:55:39,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:39,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:39,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:39,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:55:39,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 00:55:39,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 00:55:39,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 00:55:39,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:39,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:39,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 00:55:39,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:55:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:39,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:55:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422420249] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:55:39,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:55:39,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 00:55:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683716056] [2025-02-08 00:55:39,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:55:39,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:55:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:39,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:55:39,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:55:39,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-02-08 00:55:39,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:39,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:39,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-02-08 00:55:39,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:39,610 INFO L124 PetriNetUnfolderBase]: 434/925 cut-off events. [2025-02-08 00:55:39,611 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 00:55:39,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 925 events. 434/925 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4756 event pairs, 376 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1666. Up to 708 conditions per place. [2025-02-08 00:55:39,616 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 24 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2025-02-08 00:55:39,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 164 flow [2025-02-08 00:55:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:55:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 00:55:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-02-08 00:55:39,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4188034188034188 [2025-02-08 00:55:39,618 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 94 flow. Second operand 6 states and 98 transitions. [2025-02-08 00:55:39,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 164 flow [2025-02-08 00:55:39,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 160 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 00:55:39,619 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 126 flow [2025-02-08 00:55:39,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-02-08 00:55:39,622 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2025-02-08 00:55:39,622 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 126 flow [2025-02-08 00:55:39,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:39,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:39,622 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 00:55:39,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 00:55:39,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:39,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 00:55:39,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:39,823 INFO L85 PathProgramCache]: Analyzing trace with hash 510125928, now seen corresponding path program 2 times [2025-02-08 00:55:39,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:39,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790887451] [2025-02-08 00:55:39,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:39,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-08 00:55:39,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:55:39,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:55:39,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:39,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:39,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790887451] [2025-02-08 00:55:39,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790887451] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:55:39,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217454145] [2025-02-08 00:55:39,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:39,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:39,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:39,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:55:39,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 00:55:39,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-08 00:55:39,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:55:39,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:55:39,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:39,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 00:55:39,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:55:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:39,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:55:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:40,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217454145] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:55:40,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:55:40,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-02-08 00:55:40,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558747404] [2025-02-08 00:55:40,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:55:40,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:55:40,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:40,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:55:40,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:55:40,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-02-08 00:55:40,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 126 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:40,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:40,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-02-08 00:55:40,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:40,181 INFO L124 PetriNetUnfolderBase]: 434/927 cut-off events. [2025-02-08 00:55:40,181 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 00:55:40,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1700 conditions, 927 events. 434/927 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4764 event pairs, 376 based on Foata normal form. 2/821 useless extension candidates. Maximal degree in co-relation 1657. Up to 708 conditions per place. [2025-02-08 00:55:40,185 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 24 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2025-02-08 00:55:40,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 42 transitions, 200 flow [2025-02-08 00:55:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:55:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 00:55:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2025-02-08 00:55:40,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38782051282051283 [2025-02-08 00:55:40,189 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 126 flow. Second operand 8 states and 121 transitions. [2025-02-08 00:55:40,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 42 transitions, 200 flow [2025-02-08 00:55:40,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 42 transitions, 186 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 00:55:40,195 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 148 flow [2025-02-08 00:55:40,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-02-08 00:55:40,195 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2025-02-08 00:55:40,196 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 148 flow [2025-02-08 00:55:40,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:40,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:40,196 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 00:55:40,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 00:55:40,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-08 00:55:40,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 00:55:40,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash -622605880, now seen corresponding path program 3 times [2025-02-08 00:55:40,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:40,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421751560] [2025-02-08 00:55:40,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 00:55:40,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:40,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 4 equivalence classes. [2025-02-08 00:55:40,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 00:55:40,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 00:55:40,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:40,422 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:55:40,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 00:55:40,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 00:55:40,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:40,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:40,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:55:40,444 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:55:40,444 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-08 00:55:40,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-02-08 00:55:40,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-02-08 00:55:40,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-08 00:55:40,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:55:40,444 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-08 00:55:40,445 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:55:40,445 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 00:55:40,476 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:40,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 128 flow [2025-02-08 00:55:40,485 INFO L124 PetriNetUnfolderBase]: 7/63 cut-off events. [2025-02-08 00:55:40,486 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 00:55:40,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 7/63 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2025-02-08 00:55:40,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 55 transitions, 128 flow [2025-02-08 00:55:40,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 55 transitions, 128 flow [2025-02-08 00:55:40,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:40,489 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;@7b937343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:40,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 00:55:40,493 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:40,493 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2025-02-08 00:55:40,493 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 00:55:40,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:40,494 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:40,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 00:55:40,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1337150675, now seen corresponding path program 1 times [2025-02-08 00:55:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:40,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146335539] [2025-02-08 00:55:40,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:40,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 00:55:40,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 00:55:40,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:40,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:40,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:40,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146335539] [2025-02-08 00:55:40,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146335539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:40,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:40,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:55:40,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749088286] [2025-02-08 00:55:40,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:40,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:55:40,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:40,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:55:40,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:55:40,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-08 00:55:40,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:40,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:40,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-08 00:55:40,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:41,212 INFO L124 PetriNetUnfolderBase]: 6347/10809 cut-off events. [2025-02-08 00:55:41,212 INFO L125 PetriNetUnfolderBase]: For 607/607 co-relation queries the response was YES. [2025-02-08 00:55:41,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19975 conditions, 10809 events. 6347/10809 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 74720 event pairs, 5560 based on Foata normal form. 713/10235 useless extension candidates. Maximal degree in co-relation 1663. Up to 8808 conditions per place. [2025-02-08 00:55:41,265 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-02-08 00:55:41,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 194 flow [2025-02-08 00:55:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:55:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:55:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-08 00:55:41,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2025-02-08 00:55:41,266 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 128 flow. Second operand 3 states and 89 transitions. [2025-02-08 00:55:41,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 194 flow [2025-02-08 00:55:41,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 00:55:41,268 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 130 flow [2025-02-08 00:55:41,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-02-08 00:55:41,269 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2025-02-08 00:55:41,269 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 130 flow [2025-02-08 00:55:41,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:41,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:41,269 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:41,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:55:41,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 00:55:41,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1304694921, now seen corresponding path program 1 times [2025-02-08 00:55:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:41,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878735956] [2025-02-08 00:55:41,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:41,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:41,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 00:55:41,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:55:41,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:41,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:41,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:41,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878735956] [2025-02-08 00:55:41,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878735956] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:55:41,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847199428] [2025-02-08 00:55:41,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:41,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:41,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:41,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:55:41,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 00:55:41,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 00:55:41,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:55:41,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:41,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:41,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 00:55:41,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:55:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:41,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:55:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:41,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847199428] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:55:41,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:55:41,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 00:55:41,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408294080] [2025-02-08 00:55:41,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:55:41,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:55:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:41,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:55:41,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:55:41,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-08 00:55:41,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 130 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:41,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:41,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-08 00:55:41,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:42,072 INFO L124 PetriNetUnfolderBase]: 6347/10812 cut-off events. [2025-02-08 00:55:42,072 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2025-02-08 00:55:42,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19910 conditions, 10812 events. 6347/10812 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 74703 event pairs, 5560 based on Foata normal form. 0/9525 useless extension candidates. Maximal degree in co-relation 19896. Up to 8808 conditions per place. [2025-02-08 00:55:42,133 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 34 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-02-08 00:55:42,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 220 flow [2025-02-08 00:55:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:55:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 00:55:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-02-08 00:55:42,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2025-02-08 00:55:42,134 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 130 flow. Second operand 6 states and 138 transitions. [2025-02-08 00:55:42,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 220 flow [2025-02-08 00:55:42,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 216 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 00:55:42,136 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 162 flow [2025-02-08 00:55:42,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-02-08 00:55:42,137 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2025-02-08 00:55:42,137 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 162 flow [2025-02-08 00:55:42,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:42,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:42,137 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:42,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 00:55:42,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 00:55:42,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 00:55:42,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1348367789, now seen corresponding path program 2 times [2025-02-08 00:55:42,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:42,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73620201] [2025-02-08 00:55:42,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:42,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 00:55:42,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 00:55:42,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:55:42,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:42,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73620201] [2025-02-08 00:55:42,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73620201] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:55:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478967217] [2025-02-08 00:55:42,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:42,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:42,409 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:55:42,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 00:55:42,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 00:55:42,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 00:55:42,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:55:42,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:42,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 00:55:42,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:55:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:42,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:55:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:42,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478967217] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:55:42,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:55:42,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-02-08 00:55:42,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004014043] [2025-02-08 00:55:42,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:55:42,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:55:42,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:42,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:55:42,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:55:42,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-08 00:55:42,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:42,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:42,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-08 00:55:42,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:43,181 INFO L124 PetriNetUnfolderBase]: 6347/10814 cut-off events. [2025-02-08 00:55:43,182 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2025-02-08 00:55:43,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19931 conditions, 10814 events. 6347/10814 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 74715 event pairs, 5560 based on Foata normal form. 2/9530 useless extension candidates. Maximal degree in co-relation 19887. Up to 8808 conditions per place. [2025-02-08 00:55:43,232 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 34 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2025-02-08 00:55:43,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 256 flow [2025-02-08 00:55:43,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:55:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 00:55:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-02-08 00:55:43,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3886363636363636 [2025-02-08 00:55:43,233 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 162 flow. Second operand 8 states and 171 transitions. [2025-02-08 00:55:43,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 256 flow [2025-02-08 00:55:43,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 57 transitions, 242 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 00:55:43,235 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 184 flow [2025-02-08 00:55:43,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=184, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2025-02-08 00:55:43,236 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2025-02-08 00:55:43,236 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 184 flow [2025-02-08 00:55:43,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:43,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:43,236 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:43,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 00:55:43,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 00:55:43,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 00:55:43,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:43,440 INFO L85 PathProgramCache]: Analyzing trace with hash 790667539, now seen corresponding path program 3 times [2025-02-08 00:55:43,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:43,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306873474] [2025-02-08 00:55:43,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 00:55:43,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:43,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 4 equivalence classes. [2025-02-08 00:55:43,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 00:55:43,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 00:55:43,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:43,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:55:43,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 00:55:43,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 00:55:43,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:43,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:43,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:55:43,547 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:55:43,547 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 00:55:43,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-08 00:55:43,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-08 00:55:43,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-08 00:55:43,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-08 00:55:43,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:55:43,547 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-08 00:55:43,548 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:55:43,548 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 00:55:43,574 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:43,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 170 flow [2025-02-08 00:55:43,579 INFO L124 PetriNetUnfolderBase]: 9/82 cut-off events. [2025-02-08 00:55:43,579 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 00:55:43,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 82 events. 9/82 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 209 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 73. Up to 5 conditions per place. [2025-02-08 00:55:43,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 170 flow [2025-02-08 00:55:43,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 170 flow [2025-02-08 00:55:43,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:43,581 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;@7b937343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:43,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 00:55:43,583 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:43,583 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2025-02-08 00:55:43,583 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 00:55:43,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:43,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:43,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:55:43,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash 550949583, now seen corresponding path program 1 times [2025-02-08 00:55:43,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:43,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111312308] [2025-02-08 00:55:43,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:43,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:43,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 00:55:43,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:55:43,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:43,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:43,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:43,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111312308] [2025-02-08 00:55:43,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111312308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:43,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:43,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:55:43,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728950949] [2025-02-08 00:55:43,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:43,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:55:43,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:43,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:55:43,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:55:43,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2025-02-08 00:55:43,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:43,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:43,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2025-02-08 00:55:43,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:49,065 INFO L124 PetriNetUnfolderBase]: 79247/119475 cut-off events. [2025-02-08 00:55:49,065 INFO L125 PetriNetUnfolderBase]: For 9589/9589 co-relation queries the response was YES. [2025-02-08 00:55:49,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224870 conditions, 119475 events. 79247/119475 cut-off events. For 9589/9589 co-relation queries the response was YES. Maximal size of possible extension queue 3771. Compared 958310 event pairs, 69712 based on Foata normal form. 8858/114257 useless extension candidates. Maximal degree in co-relation 20055. Up to 101391 conditions per place. [2025-02-08 00:55:49,678 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 44 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2025-02-08 00:55:49,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 254 flow [2025-02-08 00:55:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:55:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:55:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-02-08 00:55:49,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.539906103286385 [2025-02-08 00:55:49,679 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 170 flow. Second operand 3 states and 115 transitions. [2025-02-08 00:55:49,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 254 flow [2025-02-08 00:55:49,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 248 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 00:55:49,684 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 166 flow [2025-02-08 00:55:49,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2025-02-08 00:55:49,685 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2025-02-08 00:55:49,685 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 166 flow [2025-02-08 00:55:49,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:49,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:49,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:49,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:55:49,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:55:49,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash -793182752, now seen corresponding path program 1 times [2025-02-08 00:55:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:49,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905546896] [2025-02-08 00:55:49,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:49,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:49,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:55:49,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:55:49,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:49,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905546896] [2025-02-08 00:55:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905546896] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:55:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367891001] [2025-02-08 00:55:49,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:49,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:49,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:49,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:55:49,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 00:55:49,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:55:49,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:55:49,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:49,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:49,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 00:55:49,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:55:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:49,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:55:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:49,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367891001] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:55:49,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:55:49,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 00:55:49,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212388385] [2025-02-08 00:55:49,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:55:49,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:55:49,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:49,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:55:49,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:55:49,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2025-02-08 00:55:49,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:49,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:49,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2025-02-08 00:55:49,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:56,022 INFO L124 PetriNetUnfolderBase]: 79247/119478 cut-off events. [2025-02-08 00:55:56,023 INFO L125 PetriNetUnfolderBase]: For 4319/4319 co-relation queries the response was YES. [2025-02-08 00:55:56,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223347 conditions, 119478 events. 79247/119478 cut-off events. For 4319/4319 co-relation queries the response was YES. Maximal size of possible extension queue 3771. Compared 958261 event pairs, 69712 based on Foata normal form. 0/105402 useless extension candidates. Maximal degree in co-relation 223332. Up to 101391 conditions per place. [2025-02-08 00:55:56,845 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 44 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2025-02-08 00:55:56,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 276 flow [2025-02-08 00:55:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:55:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 00:55:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-02-08 00:55:56,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41784037558685444 [2025-02-08 00:55:56,846 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 166 flow. Second operand 6 states and 178 transitions. [2025-02-08 00:55:56,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 276 flow [2025-02-08 00:55:56,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 272 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 00:55:56,859 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 198 flow [2025-02-08 00:55:56,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2025-02-08 00:55:56,859 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2025-02-08 00:55:56,860 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 198 flow [2025-02-08 00:55:56,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:56,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:56,860 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:56,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 00:55:57,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:57,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:55:57,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash 496078607, now seen corresponding path program 2 times [2025-02-08 00:55:57,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:57,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224535286] [2025-02-08 00:55:57,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:57,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:57,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 00:55:57,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 18 statements. [2025-02-08 00:55:57,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 00:55:57,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 00:55:57,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:57,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224535286] [2025-02-08 00:55:57,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224535286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:57,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:57,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:55:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249835096] [2025-02-08 00:55:57,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:57,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:55:57,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:57,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:55:57,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:55:57,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2025-02-08 00:55:57,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:57,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:57,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2025-02-08 00:55:57,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:56:04,475 INFO L124 PetriNetUnfolderBase]: 99317/141309 cut-off events. [2025-02-08 00:56:04,475 INFO L125 PetriNetUnfolderBase]: For 4035/4035 co-relation queries the response was YES. [2025-02-08 00:56:04,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270727 conditions, 141309 events. 99317/141309 cut-off events. For 4035/4035 co-relation queries the response was YES. Maximal size of possible extension queue 3792. Compared 1043054 event pairs, 37636 based on Foata normal form. 0/124816 useless extension candidates. Maximal degree in co-relation 270690. Up to 67590 conditions per place. [2025-02-08 00:56:05,421 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 81 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-02-08 00:56:05,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 102 transitions, 445 flow [2025-02-08 00:56:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:56:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:56:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-02-08 00:56:05,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.647887323943662 [2025-02-08 00:56:05,426 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 198 flow. Second operand 3 states and 138 transitions. [2025-02-08 00:56:05,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 102 transitions, 445 flow [2025-02-08 00:56:05,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 102 transitions, 431 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 00:56:05,434 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 197 flow [2025-02-08 00:56:05,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2025-02-08 00:56:05,434 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2025-02-08 00:56:05,434 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 197 flow [2025-02-08 00:56:05,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:56:05,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:05,434 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:56:05,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:56:05,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:56:05,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:05,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2056216165, now seen corresponding path program 1 times [2025-02-08 00:56:05,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:05,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599162999] [2025-02-08 00:56:05,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:05,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:05,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 00:56:05,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 00:56:05,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:05,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:56:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:56:05,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:56:05,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599162999] [2025-02-08 00:56:05,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599162999] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:56:05,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831929137] [2025-02-08 00:56:05,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:05,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:56:05,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:56:05,502 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:56:05,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 00:56:05,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 00:56:05,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 00:56:05,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:05,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:56:05,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 00:56:05,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:56:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:56:05,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:56:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:56:05,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831929137] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:56:05,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:56:05,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-02-08 00:56:05,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84157189] [2025-02-08 00:56:05,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:56:05,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:56:05,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:56:05,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:56:05,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:56:05,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2025-02-08 00:56:05,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 22.88888888888889) internal successors, (206), 9 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:56:05,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:56:05,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2025-02-08 00:56:05,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand