./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:01:04,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:01:04,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:01:04,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:01:04,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:01:04,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:01:04,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:01:04,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:01:04,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:01:04,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:01:04,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:01:04,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:01:04,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:01:04,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:01:04,458 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:01:04,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:01:04,458 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:01:04,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:01:04,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:01:04,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:01:04,458 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:01:04,458 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:01:04,458 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:01:04,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:01:04,459 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:01:04,459 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:01:04,459 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:01:04,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:01:04,459 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:01:04,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:01:04,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:01:04,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:01:04,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:01:04,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:01:04,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:01:04,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:01:04,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:01:04,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:01:04,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:01:04,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:01:04,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:01:04,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:01:04,460 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2025-02-06 13:01:04,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:01:04,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:01:04,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:01:04,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:01:04,664 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:01:04,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-02-06 13:01:05,832 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff95325ba/79e022821c7844c1a697e66e3838108b/FLAG47855ab7f [2025-02-06 13:01:06,058 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:01:06,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-02-06 13:01:06,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff95325ba/79e022821c7844c1a697e66e3838108b/FLAG47855ab7f [2025-02-06 13:01:06,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff95325ba/79e022821c7844c1a697e66e3838108b [2025-02-06 13:01:06,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:01:06,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:01:06,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:01:06,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:01:06,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:01:06,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59354560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06, skipping insertion in model container [2025-02-06 13:01:06,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:01:06,224 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:01:06,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:01:06,233 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:01:06,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:01:06,257 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:01:06,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06 WrapperNode [2025-02-06 13:01:06,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:01:06,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:01:06,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:01:06,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:01:06,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,292 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 254 [2025-02-06 13:01:06,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:01:06,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:01:06,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:01:06,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:01:06,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,318 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-06 13:01:06,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:01:06,337 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:01:06,337 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:01:06,337 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:01:06,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (1/1) ... [2025-02-06 13:01:06,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:01:06,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:06,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:01:06,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:01:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:01:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:01:06,380 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:01:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:01:06,380 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:01:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 13:01:06,380 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 13:01:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:01:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:01:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:01:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:01:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:01:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:01:06,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:01:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:01:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:01:06,382 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:01:06,449 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:01:06,451 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:01:06,879 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:01:06,879 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:01:07,102 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:01:07,103 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:01:07,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:01:07 BoogieIcfgContainer [2025-02-06 13:01:07,103 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:01:07,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:01:07,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:01:07,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:01:07,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:01:06" (1/3) ... [2025-02-06 13:01:07,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dc5160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:01:07, skipping insertion in model container [2025-02-06 13:01:07,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:06" (2/3) ... [2025-02-06 13:01:07,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dc5160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:01:07, skipping insertion in model container [2025-02-06 13:01:07,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:01:07" (3/3) ... [2025-02-06 13:01:07,111 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-02-06 13:01:07,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:01:07,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 79 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-02-06 13:01:07,124 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:01:07,173 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 13:01:07,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 195 flow [2025-02-06 13:01:07,221 INFO L124 PetriNetUnfolderBase]: 9/84 cut-off events. [2025-02-06 13:01:07,222 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:01:07,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 9/84 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 274 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2025-02-06 13:01:07,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 195 flow [2025-02-06 13:01:07,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 184 flow [2025-02-06 13:01:07,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:01:07,239 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=None, 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;@2d1e2d3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:01:07,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-02-06 13:01:07,245 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:01:07,245 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:01:07,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:01:07,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:07,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:01:07,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:07,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash 757133, now seen corresponding path program 1 times [2025-02-06 13:01:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:07,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001386983] [2025-02-06 13:01:07,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:07,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:07,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:01:07,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:01:07,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:07,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:07,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:07,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001386983] [2025-02-06 13:01:07,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001386983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:07,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:07,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:01:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665892031] [2025-02-06 13:01:07,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:07,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:01:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:07,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:01:07,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:01:07,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-02-06 13:01:07,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:07,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:07,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-02-06 13:01:07,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:07,710 INFO L124 PetriNetUnfolderBase]: 858/1703 cut-off events. [2025-02-06 13:01:07,711 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-06 13:01:07,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2955 conditions, 1703 events. 858/1703 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10877 event pairs, 507 based on Foata normal form. 1/1149 useless extension candidates. Maximal degree in co-relation 2707. Up to 1158 conditions per place. [2025-02-06 13:01:07,723 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 33 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-02-06 13:01:07,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 244 flow [2025-02-06 13:01:07,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:01:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:01:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-02-06 13:01:07,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2025-02-06 13:01:07,732 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 184 flow. Second operand 3 states and 180 transitions. [2025-02-06 13:01:07,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 244 flow [2025-02-06 13:01:07,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 232 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:01:07,737 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 166 flow [2025-02-06 13:01:07,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2025-02-06 13:01:07,741 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2025-02-06 13:01:07,741 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 166 flow [2025-02-06 13:01:07,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:07,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:07,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:01:07,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:01:07,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:07,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash 757134, now seen corresponding path program 1 times [2025-02-06 13:01:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:07,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718178124] [2025-02-06 13:01:07,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:07,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:01:07,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:01:07,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:07,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:07,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718178124] [2025-02-06 13:01:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718178124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:07,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:07,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:01:07,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130098935] [2025-02-06 13:01:07,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:07,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:07,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:07,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:07,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:08,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-02-06 13:01:08,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:08,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:08,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-02-06 13:01:08,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:08,266 INFO L124 PetriNetUnfolderBase]: 859/1706 cut-off events. [2025-02-06 13:01:08,267 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-06 13:01:08,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2910 conditions, 1706 events. 859/1706 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10895 event pairs, 507 based on Foata normal form. 0/1148 useless extension candidates. Maximal degree in co-relation 2873. Up to 1171 conditions per place. [2025-02-06 13:01:08,276 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 37 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-02-06 13:01:08,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 81 transitions, 254 flow [2025-02-06 13:01:08,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2025-02-06 13:01:08,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2025-02-06 13:01:08,279 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 166 flow. Second operand 4 states and 230 transitions. [2025-02-06 13:01:08,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 81 transitions, 254 flow [2025-02-06 13:01:08,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:08,281 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 189 flow [2025-02-06 13:01:08,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2025-02-06 13:01:08,282 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -6 predicate places. [2025-02-06 13:01:08,282 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 189 flow [2025-02-06 13:01:08,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:08,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:08,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 13:01:08,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:01:08,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:08,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:08,283 INFO L85 PathProgramCache]: Analyzing trace with hash 23472374, now seen corresponding path program 1 times [2025-02-06 13:01:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:08,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464584223] [2025-02-06 13:01:08,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:08,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:08,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:01:08,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:01:08,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:08,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:08,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:08,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464584223] [2025-02-06 13:01:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464584223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:08,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:08,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:01:08,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124167003] [2025-02-06 13:01:08,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:08,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:08,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:08,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:08,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-02-06 13:01:08,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:08,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:08,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-02-06 13:01:08,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:08,913 INFO L124 PetriNetUnfolderBase]: 860/1709 cut-off events. [2025-02-06 13:01:08,913 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-06 13:01:08,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1709 events. 860/1709 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10920 event pairs, 507 based on Foata normal form. 0/1150 useless extension candidates. Maximal degree in co-relation 2902. Up to 1170 conditions per place. [2025-02-06 13:01:08,926 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 37 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-02-06 13:01:08,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 283 flow [2025-02-06 13:01:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:08,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2025-02-06 13:01:08,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2025-02-06 13:01:08,929 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 189 flow. Second operand 5 states and 280 transitions. [2025-02-06 13:01:08,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 283 flow [2025-02-06 13:01:08,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:08,932 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 223 flow [2025-02-06 13:01:08,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2025-02-06 13:01:08,933 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2025-02-06 13:01:08,933 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 223 flow [2025-02-06 13:01:08,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:08,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:08,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:01:08,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:01:08,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:08,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash 727645539, now seen corresponding path program 1 times [2025-02-06 13:01:08,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:08,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612067200] [2025-02-06 13:01:08,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:08,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:08,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:01:08,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:01:08,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:08,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:09,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612067200] [2025-02-06 13:01:09,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612067200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:09,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:09,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:01:09,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065726819] [2025-02-06 13:01:09,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:09,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:09,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:09,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:09,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:09,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-02-06 13:01:09,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:09,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:09,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-02-06 13:01:09,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:09,530 INFO L124 PetriNetUnfolderBase]: 861/1712 cut-off events. [2025-02-06 13:01:09,534 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-06 13:01:09,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 1712 events. 861/1712 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10911 event pairs, 507 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 2918. Up to 1173 conditions per place. [2025-02-06 13:01:09,550 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 38 selfloop transitions, 9 changer transitions 0/87 dead transitions. [2025-02-06 13:01:09,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 323 flow [2025-02-06 13:01:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2025-02-06 13:01:09,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2025-02-06 13:01:09,551 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 223 flow. Second operand 5 states and 280 transitions. [2025-02-06 13:01:09,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 323 flow [2025-02-06 13:01:09,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:09,553 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 265 flow [2025-02-06 13:01:09,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2025-02-06 13:01:09,554 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 4 predicate places. [2025-02-06 13:01:09,557 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 265 flow [2025-02-06 13:01:09,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:09,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:09,558 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:01:09,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:01:09,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:09,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash 727630626, now seen corresponding path program 1 times [2025-02-06 13:01:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:09,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376042911] [2025-02-06 13:01:09,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:09,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:09,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:01:09,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:01:09,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:09,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376042911] [2025-02-06 13:01:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376042911] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353894224] [2025-02-06 13:01:09,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:09,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:09,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:09,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:01:09,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:01:09,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:01:09,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:01:09,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:09,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:09,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 13:01:09,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:09,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-06 13:01:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:09,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:10,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353894224] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:10,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:10,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-06 13:01:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156044089] [2025-02-06 13:01:10,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:10,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:01:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:10,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:01:10,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:01:10,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-02-06 13:01:10,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 265 flow. Second operand has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:10,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:10,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-02-06 13:01:10,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:10,862 INFO L124 PetriNetUnfolderBase]: 861/1711 cut-off events. [2025-02-06 13:01:10,863 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 13:01:10,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 1711 events. 861/1711 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10928 event pairs, 507 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 2933. Up to 1171 conditions per place. [2025-02-06 13:01:10,870 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 37 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2025-02-06 13:01:10,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 86 transitions, 353 flow [2025-02-06 13:01:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:01:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:01:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 370 transitions. [2025-02-06 13:01:10,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6075533661740559 [2025-02-06 13:01:10,871 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 265 flow. Second operand 7 states and 370 transitions. [2025-02-06 13:01:10,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 86 transitions, 353 flow [2025-02-06 13:01:10,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 86 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:10,873 INFO L231 Difference]: Finished difference. Result has 91 places, 86 transitions, 272 flow [2025-02-06 13:01:10,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=91, PETRI_TRANSITIONS=86} [2025-02-06 13:01:10,873 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 7 predicate places. [2025-02-06 13:01:10,873 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 86 transitions, 272 flow [2025-02-06 13:01:10,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:10,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:10,874 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 13:01:10,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:01:11,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:11,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:11,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1082138908, now seen corresponding path program 1 times [2025-02-06 13:01:11,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:11,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434616884] [2025-02-06 13:01:11,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:11,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:01:11,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:01:11,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:11,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:11,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:11,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434616884] [2025-02-06 13:01:11,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434616884] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:11,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048259054] [2025-02-06 13:01:11,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:11,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:11,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:11,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:01:11,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:01:11,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:01:11,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:01:11,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:11,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:11,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:01:11,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:11,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 13:01:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:11,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:11,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048259054] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:11,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:11,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-06 13:01:11,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143969907] [2025-02-06 13:01:11,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:11,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:01:11,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:11,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:01:11,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:01:12,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-02-06 13:01:12,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 272 flow. Second operand has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:12,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:12,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-02-06 13:01:12,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:12,362 INFO L124 PetriNetUnfolderBase]: 861/1710 cut-off events. [2025-02-06 13:01:12,363 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 13:01:12,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2968 conditions, 1710 events. 861/1710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10946 event pairs, 507 based on Foata normal form. 1/1158 useless extension candidates. Maximal degree in co-relation 2930. Up to 1165 conditions per place. [2025-02-06 13:01:12,370 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 33 selfloop transitions, 12 changer transitions 0/85 dead transitions. [2025-02-06 13:01:12,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 85 transitions, 356 flow [2025-02-06 13:01:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:01:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:01:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 372 transitions. [2025-02-06 13:01:12,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6108374384236454 [2025-02-06 13:01:12,371 INFO L175 Difference]: Start difference. First operand has 91 places, 86 transitions, 272 flow. Second operand 7 states and 372 transitions. [2025-02-06 13:01:12,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 85 transitions, 356 flow [2025-02-06 13:01:12,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 85 transitions, 321 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-02-06 13:01:12,373 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 255 flow [2025-02-06 13:01:12,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2025-02-06 13:01:12,373 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 4 predicate places. [2025-02-06 13:01:12,374 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 255 flow [2025-02-06 13:01:12,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:12,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:12,374 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 13:01:12,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:01:12,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:12,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:12,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash -812282841, now seen corresponding path program 1 times [2025-02-06 13:01:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:12,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456001830] [2025-02-06 13:01:12,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:12,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:12,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:01:12,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:01:12,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:12,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:12,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456001830] [2025-02-06 13:01:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456001830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:12,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375096776] [2025-02-06 13:01:12,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:12,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:12,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:12,751 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:01:12,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:01:12,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:01:12,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:01:12,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:12,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:12,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:01:12,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:12,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 13:01:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:12,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375096776] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:13,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:13,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-06 13:01:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401492697] [2025-02-06 13:01:13,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:13,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:01:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:13,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:01:13,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:01:13,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-02-06 13:01:13,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 255 flow. Second operand has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:13,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:13,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-02-06 13:01:13,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:14,061 INFO L124 PetriNetUnfolderBase]: 861/1709 cut-off events. [2025-02-06 13:01:14,062 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-06 13:01:14,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2956 conditions, 1709 events. 861/1709 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10914 event pairs, 507 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 2911. Up to 1164 conditions per place. [2025-02-06 13:01:14,069 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 29 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2025-02-06 13:01:14,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 84 transitions, 338 flow [2025-02-06 13:01:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:01:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:01:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 371 transitions. [2025-02-06 13:01:14,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2025-02-06 13:01:14,071 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 255 flow. Second operand 7 states and 371 transitions. [2025-02-06 13:01:14,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 84 transitions, 338 flow [2025-02-06 13:01:14,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 84 transitions, 313 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-06 13:01:14,072 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 255 flow [2025-02-06 13:01:14,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2025-02-06 13:01:14,073 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 3 predicate places. [2025-02-06 13:01:14,073 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 255 flow [2025-02-06 13:01:14,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:14,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:14,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:14,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 13:01:14,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:14,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:14,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:14,279 INFO L85 PathProgramCache]: Analyzing trace with hash 593170345, now seen corresponding path program 1 times [2025-02-06 13:01:14,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:14,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951722440] [2025-02-06 13:01:14,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:14,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:14,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:01:14,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:01:14,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:14,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:14,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951722440] [2025-02-06 13:01:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951722440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:14,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:14,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532806783] [2025-02-06 13:01:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:14,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:14,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:14,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:14,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:14,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-02-06 13:01:14,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:14,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:14,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-02-06 13:01:14,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:14,582 INFO L124 PetriNetUnfolderBase]: 1467/3027 cut-off events. [2025-02-06 13:01:14,582 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-06 13:01:14,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5185 conditions, 3027 events. 1467/3027 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 22228 event pairs, 659 based on Foata normal form. 62/2186 useless extension candidates. Maximal degree in co-relation 3503. Up to 1332 conditions per place. [2025-02-06 13:01:14,591 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 90 selfloop transitions, 4 changer transitions 0/133 dead transitions. [2025-02-06 13:01:14,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 133 transitions, 595 flow [2025-02-06 13:01:14,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 328 transitions. [2025-02-06 13:01:14,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7540229885057471 [2025-02-06 13:01:14,593 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 255 flow. Second operand 5 states and 328 transitions. [2025-02-06 13:01:14,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 133 transitions, 595 flow [2025-02-06 13:01:14,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 133 transitions, 538 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 13:01:14,595 INFO L231 Difference]: Finished difference. Result has 87 places, 85 transitions, 237 flow [2025-02-06 13:01:14,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=87, PETRI_TRANSITIONS=85} [2025-02-06 13:01:14,596 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 3 predicate places. [2025-02-06 13:01:14,596 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 85 transitions, 237 flow [2025-02-06 13:01:14,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:14,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:14,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:14,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:01:14,596 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:14,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:14,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2125580651, now seen corresponding path program 1 times [2025-02-06 13:01:14,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:14,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011330537] [2025-02-06 13:01:14,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:14,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:14,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:01:14,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:01:14,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:14,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:01:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011330537] [2025-02-06 13:01:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011330537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:14,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:01:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232123244] [2025-02-06 13:01:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:14,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:14,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:14,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:14,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-02-06 13:01:14,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 85 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:14,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:14,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-02-06 13:01:14,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:14,961 INFO L124 PetriNetUnfolderBase]: 2406/4964 cut-off events. [2025-02-06 13:01:14,961 INFO L125 PetriNetUnfolderBase]: For 515/515 co-relation queries the response was YES. [2025-02-06 13:01:14,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8853 conditions, 4964 events. 2406/4964 cut-off events. For 515/515 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 40091 event pairs, 1023 based on Foata normal form. 62/3586 useless extension candidates. Maximal degree in co-relation 5317. Up to 1984 conditions per place. [2025-02-06 13:01:15,013 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 82 selfloop transitions, 8 changer transitions 0/129 dead transitions. [2025-02-06 13:01:15,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 129 transitions, 529 flow [2025-02-06 13:01:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 377 transitions. [2025-02-06 13:01:15,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-02-06 13:01:15,015 INFO L175 Difference]: Start difference. First operand has 87 places, 85 transitions, 237 flow. Second operand 6 states and 377 transitions. [2025-02-06 13:01:15,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 129 transitions, 529 flow [2025-02-06 13:01:15,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:15,017 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 284 flow [2025-02-06 13:01:15,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2025-02-06 13:01:15,018 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 9 predicate places. [2025-02-06 13:01:15,018 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 284 flow [2025-02-06 13:01:15,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:15,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:15,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:15,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:01:15,019 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:15,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1260642438, now seen corresponding path program 1 times [2025-02-06 13:01:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964228395] [2025-02-06 13:01:15,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:15,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:01:15,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:01:15,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:15,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:01:15,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:15,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964228395] [2025-02-06 13:01:15,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964228395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:15,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:15,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:01:15,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360346567] [2025-02-06 13:01:15,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:15,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:15,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:15,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:15,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:15,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-02-06 13:01:15,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:15,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:15,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-02-06 13:01:15,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:15,419 INFO L124 PetriNetUnfolderBase]: 1967/4496 cut-off events. [2025-02-06 13:01:15,419 INFO L125 PetriNetUnfolderBase]: For 1180/1180 co-relation queries the response was YES. [2025-02-06 13:01:15,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8035 conditions, 4496 events. 1967/4496 cut-off events. For 1180/1180 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 37708 event pairs, 1032 based on Foata normal form. 82/3189 useless extension candidates. Maximal degree in co-relation 4943. Up to 2084 conditions per place. [2025-02-06 13:01:15,439 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 77 selfloop transitions, 7 changer transitions 0/123 dead transitions. [2025-02-06 13:01:15,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 123 transitions, 549 flow [2025-02-06 13:01:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:15,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 370 transitions. [2025-02-06 13:01:15,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7088122605363985 [2025-02-06 13:01:15,441 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 284 flow. Second operand 6 states and 370 transitions. [2025-02-06 13:01:15,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 123 transitions, 549 flow [2025-02-06 13:01:15,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 123 transitions, 546 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:15,445 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 305 flow [2025-02-06 13:01:15,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2025-02-06 13:01:15,446 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 15 predicate places. [2025-02-06 13:01:15,447 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 305 flow [2025-02-06 13:01:15,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:15,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:15,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:15,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:01:15,447 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:15,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash -367409643, now seen corresponding path program 1 times [2025-02-06 13:01:15,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:15,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979832109] [2025-02-06 13:01:15,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:15,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:15,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:01:15,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:01:15,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:15,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:15,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:15,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979832109] [2025-02-06 13:01:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979832109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:15,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:15,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:15,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855409705] [2025-02-06 13:01:15,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:15,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:15,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:15,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:15,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:15,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-02-06 13:01:15,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:15,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:15,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-02-06 13:01:15,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:16,135 INFO L124 PetriNetUnfolderBase]: 1636/3376 cut-off events. [2025-02-06 13:01:16,135 INFO L125 PetriNetUnfolderBase]: For 1258/1258 co-relation queries the response was YES. [2025-02-06 13:01:16,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6628 conditions, 3376 events. 1636/3376 cut-off events. For 1258/1258 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 25006 event pairs, 928 based on Foata normal form. 58/2606 useless extension candidates. Maximal degree in co-relation 3803. Up to 1759 conditions per place. [2025-02-06 13:01:16,146 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 92 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-02-06 13:01:16,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 135 transitions, 674 flow [2025-02-06 13:01:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 320 transitions. [2025-02-06 13:01:16,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.735632183908046 [2025-02-06 13:01:16,148 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 305 flow. Second operand 5 states and 320 transitions. [2025-02-06 13:01:16,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 135 transitions, 674 flow [2025-02-06 13:01:16,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 135 transitions, 658 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:01:16,150 INFO L231 Difference]: Finished difference. Result has 102 places, 91 transitions, 312 flow [2025-02-06 13:01:16,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=102, PETRI_TRANSITIONS=91} [2025-02-06 13:01:16,150 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 18 predicate places. [2025-02-06 13:01:16,150 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 312 flow [2025-02-06 13:01:16,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:16,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:16,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:16,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:01:16,151 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:16,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2070568772, now seen corresponding path program 1 times [2025-02-06 13:01:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936436574] [2025-02-06 13:01:16,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:16,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:01:16,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:01:16,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:16,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:01:16,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:16,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936436574] [2025-02-06 13:01:16,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936436574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:16,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73449152] [2025-02-06 13:01:16,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:16,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:16,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:16,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:01:16,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:01:16,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:01:16,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:01:16,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:16,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:16,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 13:01:16,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:16,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 13:01:16,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:01:16,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 13:01:16,532 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 13:01:16,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 13:01:16,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:01:16,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 13:01:16,565 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:01:16,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 13:01:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:01:16,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:16,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2025-02-06 13:01:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:01:16,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73449152] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:16,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:16,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-02-06 13:01:16,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625769971] [2025-02-06 13:01:16,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:16,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 13:01:16,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:16,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 13:01:16,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:01:20,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 87 [2025-02-06 13:01:20,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 312 flow. Second operand has 16 states, 16 states have (on average 38.9375) internal successors, (623), 16 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:20,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:20,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 87 [2025-02-06 13:01:20,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:21,333 INFO L124 PetriNetUnfolderBase]: 4047/7686 cut-off events. [2025-02-06 13:01:21,333 INFO L125 PetriNetUnfolderBase]: For 1869/1869 co-relation queries the response was YES. [2025-02-06 13:01:21,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15019 conditions, 7686 events. 4047/7686 cut-off events. For 1869/1869 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 58740 event pairs, 1005 based on Foata normal form. 0/5932 useless extension candidates. Maximal degree in co-relation 13014. Up to 2166 conditions per place. [2025-02-06 13:01:21,486 INFO L140 encePairwiseOnDemand]: 71/87 looper letters, 116 selfloop transitions, 22 changer transitions 0/168 dead transitions. [2025-02-06 13:01:21,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 168 transitions, 823 flow [2025-02-06 13:01:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:01:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:01:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 475 transitions. [2025-02-06 13:01:21,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6066411238825032 [2025-02-06 13:01:21,488 INFO L175 Difference]: Start difference. First operand has 102 places, 91 transitions, 312 flow. Second operand 9 states and 475 transitions. [2025-02-06 13:01:21,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 168 transitions, 823 flow [2025-02-06 13:01:21,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 168 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:21,491 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 403 flow [2025-02-06 13:01:21,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=105, PETRI_TRANSITIONS=95} [2025-02-06 13:01:21,492 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 21 predicate places. [2025-02-06 13:01:21,492 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 403 flow [2025-02-06 13:01:21,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 38.9375) internal successors, (623), 16 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:21,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:21,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:21,498 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-06 13:01:21,693 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,SelfDestructingSolverStorable11 [2025-02-06 13:01:21,693 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:21,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1623778081, now seen corresponding path program 1 times [2025-02-06 13:01:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:21,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409734785] [2025-02-06 13:01:21,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:21,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:21,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:01:21,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:01:21,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:21,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:01:21,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:21,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409734785] [2025-02-06 13:01:21,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409734785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:21,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:21,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:01:21,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370678978] [2025-02-06 13:01:21,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:21,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:21,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:21,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:21,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:21,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-02-06 13:01:21,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 95 transitions, 403 flow. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:21,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:21,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-02-06 13:01:21,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:22,440 INFO L124 PetriNetUnfolderBase]: 3962/8842 cut-off events. [2025-02-06 13:01:22,441 INFO L125 PetriNetUnfolderBase]: For 5120/5166 co-relation queries the response was YES. [2025-02-06 13:01:22,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17808 conditions, 8842 events. 3962/8842 cut-off events. For 5120/5166 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 78899 event pairs, 2151 based on Foata normal form. 162/6960 useless extension candidates. Maximal degree in co-relation 11982. Up to 3683 conditions per place. [2025-02-06 13:01:22,520 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 94 selfloop transitions, 13 changer transitions 0/142 dead transitions. [2025-02-06 13:01:22,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 142 transitions, 815 flow [2025-02-06 13:01:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2025-02-06 13:01:22,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379310344827587 [2025-02-06 13:01:22,525 INFO L175 Difference]: Start difference. First operand has 105 places, 95 transitions, 403 flow. Second operand 5 states and 321 transitions. [2025-02-06 13:01:22,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 142 transitions, 815 flow [2025-02-06 13:01:22,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 142 transitions, 792 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:22,539 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 442 flow [2025-02-06 13:01:22,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=442, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2025-02-06 13:01:22,540 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 25 predicate places. [2025-02-06 13:01:22,540 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 442 flow [2025-02-06 13:01:22,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:22,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:22,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:22,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:01:22,544 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:22,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash 236878210, now seen corresponding path program 1 times [2025-02-06 13:01:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:22,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941701867] [2025-02-06 13:01:22,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:22,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:01:22,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:01:22,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:22,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:01:22,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:22,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941701867] [2025-02-06 13:01:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941701867] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:22,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463252386] [2025-02-06 13:01:22,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:22,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:22,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:22,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:01:22,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:01:22,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:01:22,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:01:22,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:22,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:22,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:01:22,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:22,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 13:01:22,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:01:22,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 13:01:22,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:01:22,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 13:01:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:01:22,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:23,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-02-06 13:01:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:01:23,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463252386] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:23,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:23,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 13:01:23,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331367917] [2025-02-06 13:01:23,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:23,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:01:23,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:23,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:01:23,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:01:23,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 87 [2025-02-06 13:01:23,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 442 flow. Second operand has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:23,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:23,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 87 [2025-02-06 13:01:23,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:24,640 INFO L124 PetriNetUnfolderBase]: 4462/8708 cut-off events. [2025-02-06 13:01:24,640 INFO L125 PetriNetUnfolderBase]: For 5706/5706 co-relation queries the response was YES. [2025-02-06 13:01:24,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18872 conditions, 8708 events. 4462/8708 cut-off events. For 5706/5706 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 70533 event pairs, 1564 based on Foata normal form. 0/7304 useless extension candidates. Maximal degree in co-relation 13204. Up to 2366 conditions per place. [2025-02-06 13:01:24,718 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 108 selfloop transitions, 24 changer transitions 0/165 dead transitions. [2025-02-06 13:01:24,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 165 transitions, 904 flow [2025-02-06 13:01:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:01:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:01:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 514 transitions. [2025-02-06 13:01:24,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6564495530012772 [2025-02-06 13:01:24,722 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 442 flow. Second operand 9 states and 514 transitions. [2025-02-06 13:01:24,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 165 transitions, 904 flow [2025-02-06 13:01:24,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 165 transitions, 897 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:24,732 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 509 flow [2025-02-06 13:01:24,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=509, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2025-02-06 13:01:24,733 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 33 predicate places. [2025-02-06 13:01:24,733 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 99 transitions, 509 flow [2025-02-06 13:01:24,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:24,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:24,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:24,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:01:24,934 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,SelfDestructingSolverStorable13 [2025-02-06 13:01:24,934 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:24,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash 236878209, now seen corresponding path program 1 times [2025-02-06 13:01:24,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:24,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380437232] [2025-02-06 13:01:24,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:24,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:24,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:01:24,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:01:24,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:24,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:01:24,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:24,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380437232] [2025-02-06 13:01:24,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380437232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:24,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:24,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:01:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559775372] [2025-02-06 13:01:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:24,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:24,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:24,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:25,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 87 [2025-02-06 13:01:25,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 99 transitions, 509 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:25,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:25,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 87 [2025-02-06 13:01:25,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:25,553 INFO L124 PetriNetUnfolderBase]: 5163/9745 cut-off events. [2025-02-06 13:01:25,554 INFO L125 PetriNetUnfolderBase]: For 9051/9051 co-relation queries the response was YES. [2025-02-06 13:01:25,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22420 conditions, 9745 events. 5163/9745 cut-off events. For 9051/9051 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 77690 event pairs, 3904 based on Foata normal form. 205/8641 useless extension candidates. Maximal degree in co-relation 16183. Up to 7450 conditions per place. [2025-02-06 13:01:25,599 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 55 selfloop transitions, 12 changer transitions 0/95 dead transitions. [2025-02-06 13:01:25,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 95 transitions, 635 flow [2025-02-06 13:01:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2025-02-06 13:01:25,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5563218390804597 [2025-02-06 13:01:25,600 INFO L175 Difference]: Start difference. First operand has 117 places, 99 transitions, 509 flow. Second operand 5 states and 242 transitions. [2025-02-06 13:01:25,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 95 transitions, 635 flow [2025-02-06 13:01:25,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 95 transitions, 585 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 13:01:25,608 INFO L231 Difference]: Finished difference. Result has 111 places, 95 transitions, 475 flow [2025-02-06 13:01:25,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=475, PETRI_PLACES=111, PETRI_TRANSITIONS=95} [2025-02-06 13:01:25,608 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 27 predicate places. [2025-02-06 13:01:25,608 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 95 transitions, 475 flow [2025-02-06 13:01:25,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:25,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:25,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:25,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:01:25,609 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:25,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash 990353154, now seen corresponding path program 1 times [2025-02-06 13:01:25,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:25,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177926954] [2025-02-06 13:01:25,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:25,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:01:25,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:01:25,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:25,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:01:25,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:25,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177926954] [2025-02-06 13:01:25,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177926954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:25,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:25,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:01:25,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784853908] [2025-02-06 13:01:25,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:25,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:25,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:25,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:25,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:25,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-02-06 13:01:25,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 95 transitions, 475 flow. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:25,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:25,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-02-06 13:01:25,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:26,067 INFO L124 PetriNetUnfolderBase]: 3442/7049 cut-off events. [2025-02-06 13:01:26,067 INFO L125 PetriNetUnfolderBase]: For 7271/7427 co-relation queries the response was YES. [2025-02-06 13:01:26,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15664 conditions, 7049 events. 3442/7049 cut-off events. For 7271/7427 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 57062 event pairs, 2103 based on Foata normal form. 94/5840 useless extension candidates. Maximal degree in co-relation 10285. Up to 3660 conditions per place. [2025-02-06 13:01:26,094 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 89 selfloop transitions, 13 changer transitions 0/133 dead transitions. [2025-02-06 13:01:26,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 133 transitions, 865 flow [2025-02-06 13:01:26,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2025-02-06 13:01:26,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7218390804597701 [2025-02-06 13:01:26,096 INFO L175 Difference]: Start difference. First operand has 111 places, 95 transitions, 475 flow. Second operand 5 states and 314 transitions. [2025-02-06 13:01:26,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 133 transitions, 865 flow [2025-02-06 13:01:26,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 133 transitions, 849 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:01:26,102 INFO L231 Difference]: Finished difference. Result has 114 places, 97 transitions, 509 flow [2025-02-06 13:01:26,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=509, PETRI_PLACES=114, PETRI_TRANSITIONS=97} [2025-02-06 13:01:26,102 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 30 predicate places. [2025-02-06 13:01:26,102 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 97 transitions, 509 flow [2025-02-06 13:01:26,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:26,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:26,103 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:26,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:01:26,103 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:26,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1154391389, now seen corresponding path program 1 times [2025-02-06 13:01:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:26,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013062066] [2025-02-06 13:01:26,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:26,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:26,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:01:26,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:01:26,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:26,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:01:26,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:26,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013062066] [2025-02-06 13:01:26,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013062066] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:26,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129922637] [2025-02-06 13:01:26,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:26,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:26,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:26,232 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:01:26,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:01:26,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:01:26,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:01:26,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:26,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:26,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:01:26,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:26,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 13:01:26,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:01:26,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 13:01:26,340 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:01:26,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 13:01:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:01:26,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:26,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-02-06 13:01:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:01:26,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129922637] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:26,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:26,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 13:01:26,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219962208] [2025-02-06 13:01:26,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:26,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:01:26,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:26,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:01:26,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:01:27,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 87 [2025-02-06 13:01:27,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 97 transitions, 509 flow. Second operand has 13 states, 13 states have (on average 45.38461538461539) internal successors, (590), 13 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:27,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:27,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 87 [2025-02-06 13:01:27,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:28,201 INFO L124 PetriNetUnfolderBase]: 7077/13268 cut-off events. [2025-02-06 13:01:28,202 INFO L125 PetriNetUnfolderBase]: For 15201/15717 co-relation queries the response was YES. [2025-02-06 13:01:28,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29773 conditions, 13268 events. 7077/13268 cut-off events. For 15201/15717 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 109341 event pairs, 1975 based on Foata normal form. 0/11044 useless extension candidates. Maximal degree in co-relation 22166. Up to 3993 conditions per place. [2025-02-06 13:01:28,344 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 116 selfloop transitions, 24 changer transitions 0/168 dead transitions. [2025-02-06 13:01:28,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 168 transitions, 1065 flow [2025-02-06 13:01:28,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:01:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:01:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 503 transitions. [2025-02-06 13:01:28,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424010217113666 [2025-02-06 13:01:28,346 INFO L175 Difference]: Start difference. First operand has 114 places, 97 transitions, 509 flow. Second operand 9 states and 503 transitions. [2025-02-06 13:01:28,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 168 transitions, 1065 flow [2025-02-06 13:01:28,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 168 transitions, 1047 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:28,355 INFO L231 Difference]: Finished difference. Result has 121 places, 98 transitions, 557 flow [2025-02-06 13:01:28,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=557, PETRI_PLACES=121, PETRI_TRANSITIONS=98} [2025-02-06 13:01:28,355 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 37 predicate places. [2025-02-06 13:01:28,355 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 98 transitions, 557 flow [2025-02-06 13:01:28,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.38461538461539) internal successors, (590), 13 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:28,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:28,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:28,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:01:28,556 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,SelfDestructingSolverStorable16 [2025-02-06 13:01:28,556 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:28,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:28,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1426395410, now seen corresponding path program 1 times [2025-02-06 13:01:28,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:28,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581942479] [2025-02-06 13:01:28,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:28,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:28,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:01:28,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:01:28,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:28,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:01:28,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:28,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581942479] [2025-02-06 13:01:28,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581942479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:28,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:28,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:01:28,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053500547] [2025-02-06 13:01:28,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:28,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:28,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:28,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:28,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:28,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 87 [2025-02-06 13:01:28,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 98 transitions, 557 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:28,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:28,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 87 [2025-02-06 13:01:28,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:29,550 INFO L124 PetriNetUnfolderBase]: 6715/12950 cut-off events. [2025-02-06 13:01:29,550 INFO L125 PetriNetUnfolderBase]: For 16988/17438 co-relation queries the response was YES. [2025-02-06 13:01:29,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30254 conditions, 12950 events. 6715/12950 cut-off events. For 16988/17438 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 108670 event pairs, 5344 based on Foata normal form. 0/12008 useless extension candidates. Maximal degree in co-relation 22807. Up to 9717 conditions per place. [2025-02-06 13:01:29,632 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 59 selfloop transitions, 9 changer transitions 0/94 dead transitions. [2025-02-06 13:01:29,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 94 transitions, 685 flow [2025-02-06 13:01:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-02-06 13:01:29,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5890804597701149 [2025-02-06 13:01:29,634 INFO L175 Difference]: Start difference. First operand has 121 places, 98 transitions, 557 flow. Second operand 4 states and 205 transitions. [2025-02-06 13:01:29,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 94 transitions, 685 flow [2025-02-06 13:01:29,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 94 transitions, 641 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-02-06 13:01:29,644 INFO L231 Difference]: Finished difference. Result has 114 places, 94 transitions, 523 flow [2025-02-06 13:01:29,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=523, PETRI_PLACES=114, PETRI_TRANSITIONS=94} [2025-02-06 13:01:29,645 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 30 predicate places. [2025-02-06 13:01:29,645 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 94 transitions, 523 flow [2025-02-06 13:01:29,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:29,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:29,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:29,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 13:01:29,646 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:29,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:29,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1426395411, now seen corresponding path program 1 times [2025-02-06 13:01:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:29,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195231853] [2025-02-06 13:01:29,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:29,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:29,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:01:29,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:01:29,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:29,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:01:29,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:29,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195231853] [2025-02-06 13:01:29,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195231853] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:29,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908436146] [2025-02-06 13:01:29,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:29,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:29,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:29,812 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:01:29,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:01:29,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:01:29,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:01:29,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:29,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:29,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 13:01:29,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:01:29,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:30,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-06 13:01:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:01:30,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908436146] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:30,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:30,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 13:01:30,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13031038] [2025-02-06 13:01:30,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:30,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:01:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:30,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:01:30,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:01:30,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-02-06 13:01:30,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 94 transitions, 523 flow. Second operand has 11 states, 11 states have (on average 49.18181818181818) internal successors, (541), 11 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:30,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:30,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-02-06 13:01:30,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:31,096 INFO L124 PetriNetUnfolderBase]: 6288/11209 cut-off events. [2025-02-06 13:01:31,096 INFO L125 PetriNetUnfolderBase]: For 15001/15412 co-relation queries the response was YES. [2025-02-06 13:01:31,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27190 conditions, 11209 events. 6288/11209 cut-off events. For 15001/15412 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 84953 event pairs, 2100 based on Foata normal form. 0/10271 useless extension candidates. Maximal degree in co-relation 20038. Up to 3122 conditions per place. [2025-02-06 13:01:31,150 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 112 selfloop transitions, 24 changer transitions 0/161 dead transitions. [2025-02-06 13:01:31,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 161 transitions, 1073 flow [2025-02-06 13:01:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:01:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:01:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 437 transitions. [2025-02-06 13:01:31,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7175697865353038 [2025-02-06 13:01:31,152 INFO L175 Difference]: Start difference. First operand has 114 places, 94 transitions, 523 flow. Second operand 7 states and 437 transitions. [2025-02-06 13:01:31,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 161 transitions, 1073 flow [2025-02-06 13:01:31,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 161 transitions, 1063 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:31,164 INFO L231 Difference]: Finished difference. Result has 119 places, 94 transitions, 577 flow [2025-02-06 13:01:31,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=577, PETRI_PLACES=119, PETRI_TRANSITIONS=94} [2025-02-06 13:01:31,164 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 35 predicate places. [2025-02-06 13:01:31,164 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 94 transitions, 577 flow [2025-02-06 13:01:31,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.18181818181818) internal successors, (541), 11 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:31,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:31,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:31,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 13:01:31,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:31,365 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:01:31,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2032867518, now seen corresponding path program 1 times [2025-02-06 13:01:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:31,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914225606] [2025-02-06 13:01:31,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:31,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:31,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:01:31,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:01:31,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:31,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:01:31,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:31,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914225606] [2025-02-06 13:01:31,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914225606] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:31,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112552004] [2025-02-06 13:01:31,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:31,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:31,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:31,543 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:01:31,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:01:31,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:01:31,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:01:31,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:31,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:31,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 13:01:31,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:31,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 13:01:31,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:01:31,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 13:01:31,661 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:01:31,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 13:01:31,675 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:01:31,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 13:01:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:01:31,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:31,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-02-06 13:01:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:01:31,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112552004] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:31,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:31,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 13 [2025-02-06 13:01:31,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886203182] [2025-02-06 13:01:31,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:31,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 13:01:31,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:31,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 13:01:31,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-02-06 13:01:35,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:01:39,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:01:43,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:01:48,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:01:52,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:01:53,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:01:57,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:01,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:05,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:09,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:13,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:17,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:21,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:25,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:26,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-02-06 13:02:26,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 94 transitions, 577 flow. Second operand has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:02:26,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:26,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-02-06 13:02:26,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:27,831 INFO L124 PetriNetUnfolderBase]: 14501/25014 cut-off events. [2025-02-06 13:02:27,831 INFO L125 PetriNetUnfolderBase]: For 35720/36533 co-relation queries the response was YES. [2025-02-06 13:02:27,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60964 conditions, 25014 events. 14501/25014 cut-off events. For 35720/36533 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 204765 event pairs, 4729 based on Foata normal form. 0/22909 useless extension candidates. Maximal degree in co-relation 52182. Up to 6412 conditions per place. [2025-02-06 13:02:27,963 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 134 selfloop transitions, 24 changer transitions 0/179 dead transitions. [2025-02-06 13:02:27,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 179 transitions, 1287 flow [2025-02-06 13:02:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:02:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:02:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 409 transitions. [2025-02-06 13:02:27,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47011494252873565 [2025-02-06 13:02:27,965 INFO L175 Difference]: Start difference. First operand has 119 places, 94 transitions, 577 flow. Second operand 10 states and 409 transitions. [2025-02-06 13:02:27,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 179 transitions, 1287 flow [2025-02-06 13:02:27,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 179 transitions, 1226 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-06 13:02:27,980 INFO L231 Difference]: Finished difference. Result has 125 places, 96 transitions, 605 flow [2025-02-06 13:02:27,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=605, PETRI_PLACES=125, PETRI_TRANSITIONS=96} [2025-02-06 13:02:27,982 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 41 predicate places. [2025-02-06 13:02:27,982 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 96 transitions, 605 flow [2025-02-06 13:02:27,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:02:27,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:27,983 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:27,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 13:02:28,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:28,184 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:02:28,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash 208187522, now seen corresponding path program 1 times [2025-02-06 13:02:28,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:28,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597624022] [2025-02-06 13:02:28,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:28,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:02:28,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:02:28,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:28,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:02:28,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:28,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597624022] [2025-02-06 13:02:28,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597624022] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:28,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908335546] [2025-02-06 13:02:28,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:28,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:28,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:28,258 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:02:28,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 13:02:28,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:02:28,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:02:28,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:28,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:28,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:02:28,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:02:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:02:28,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:02:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:02:28,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908335546] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:02:28,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:02:28,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-02-06 13:02:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527181729] [2025-02-06 13:02:28,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:02:28,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 13:02:28,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:28,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 13:02:28,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:02:28,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-02-06 13:02:28,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 96 transitions, 605 flow. Second operand has 16 states, 16 states have (on average 51.125) internal successors, (818), 16 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:02:28,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:28,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-02-06 13:02:28,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:32,545 INFO L124 PetriNetUnfolderBase]: 26284/47428 cut-off events. [2025-02-06 13:02:32,546 INFO L125 PetriNetUnfolderBase]: For 78093/81167 co-relation queries the response was YES. [2025-02-06 13:02:32,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120877 conditions, 47428 events. 26284/47428 cut-off events. For 78093/81167 co-relation queries the response was YES. Maximal size of possible extension queue 1873. Compared 454502 event pairs, 11026 based on Foata normal form. 744/46259 useless extension candidates. Maximal degree in co-relation 60819. Up to 11115 conditions per place. [2025-02-06 13:02:32,853 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 295 selfloop transitions, 56 changer transitions 0/378 dead transitions. [2025-02-06 13:02:32,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 378 transitions, 2845 flow [2025-02-06 13:02:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 13:02:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-02-06 13:02:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1489 transitions. [2025-02-06 13:02:32,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6845977011494253 [2025-02-06 13:02:32,855 INFO L175 Difference]: Start difference. First operand has 125 places, 96 transitions, 605 flow. Second operand 25 states and 1489 transitions. [2025-02-06 13:02:32,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 378 transitions, 2845 flow [2025-02-06 13:02:32,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 378 transitions, 2727 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-02-06 13:02:32,912 INFO L231 Difference]: Finished difference. Result has 155 places, 134 transitions, 1062 flow [2025-02-06 13:02:32,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1062, PETRI_PLACES=155, PETRI_TRANSITIONS=134} [2025-02-06 13:02:32,913 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 71 predicate places. [2025-02-06 13:02:32,913 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 134 transitions, 1062 flow [2025-02-06 13:02:32,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.125) internal successors, (818), 16 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:02:32,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:32,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:32,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 13:02:33,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:33,114 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:02:33,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:33,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1405615644, now seen corresponding path program 1 times [2025-02-06 13:02:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:33,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063443000] [2025-02-06 13:02:33,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:33,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:33,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:02:33,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:02:33,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:33,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:02:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063443000] [2025-02-06 13:02:33,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063443000] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792870310] [2025-02-06 13:02:33,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:33,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:33,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:33,217 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:02:33,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 13:02:33,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:02:33,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:02:33,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:33,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:33,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 13:02:33,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:02:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:02:33,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:02:33,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-06 13:02:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:02:33,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792870310] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:02:33,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:02:33,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 13:02:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417160481] [2025-02-06 13:02:33,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:02:33,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:02:33,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:33,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:02:33,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:02:33,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-02-06 13:02:33,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 134 transitions, 1062 flow. Second operand has 11 states, 11 states have (on average 49.54545454545455) internal successors, (545), 11 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:02:33,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:33,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-02-06 13:02:33,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:38,039 INFO L124 PetriNetUnfolderBase]: 28248/48922 cut-off events. [2025-02-06 13:02:38,040 INFO L125 PetriNetUnfolderBase]: For 119480/125524 co-relation queries the response was YES. [2025-02-06 13:02:38,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128597 conditions, 48922 events. 28248/48922 cut-off events. For 119480/125524 co-relation queries the response was YES. Maximal size of possible extension queue 1997. Compared 454270 event pairs, 9294 based on Foata normal form. 0/47467 useless extension candidates. Maximal degree in co-relation 125819. Up to 13189 conditions per place. [2025-02-06 13:02:38,336 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 160 selfloop transitions, 37 changer transitions 0/222 dead transitions. [2025-02-06 13:02:38,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 2075 flow [2025-02-06 13:02:38,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:02:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:02:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 433 transitions. [2025-02-06 13:02:38,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7110016420361248 [2025-02-06 13:02:38,337 INFO L175 Difference]: Start difference. First operand has 155 places, 134 transitions, 1062 flow. Second operand 7 states and 433 transitions. [2025-02-06 13:02:38,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 2075 flow [2025-02-06 13:02:38,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 222 transitions, 2052 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:02:38,395 INFO L231 Difference]: Finished difference. Result has 158 places, 134 transitions, 1132 flow [2025-02-06 13:02:38,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1132, PETRI_PLACES=158, PETRI_TRANSITIONS=134} [2025-02-06 13:02:38,396 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 74 predicate places. [2025-02-06 13:02:38,396 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 134 transitions, 1132 flow [2025-02-06 13:02:38,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.54545454545455) internal successors, (545), 11 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:02:38,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:38,396 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:38,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 13:02:38,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:38,597 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-02-06 13:02:38,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:38,597 INFO L85 PathProgramCache]: Analyzing trace with hash -660018909, now seen corresponding path program 1 times [2025-02-06 13:02:38,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:38,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028875692] [2025-02-06 13:02:38,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:38,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:38,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:02:38,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:02:38,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:38,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:02:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:38,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028875692] [2025-02-06 13:02:38,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028875692] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:38,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076555711] [2025-02-06 13:02:38,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:38,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:38,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:38,660 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:02:38,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 13:02:38,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:02:38,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:02:38,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:38,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:38,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:02:38,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:02:38,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:02:38,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:02:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:02:38,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076555711] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:02:38,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:02:38,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-06 13:02:38,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063619527] [2025-02-06 13:02:38,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:02:38,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 13:02:38,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:38,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 13:02:38,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:02:39,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-02-06 13:02:39,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 134 transitions, 1132 flow. Second operand has 16 states, 16 states have (on average 51.3125) internal successors, (821), 16 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:02:39,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:39,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-02-06 13:02:39,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand