./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/array-eq-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 e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:33:07,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:33:07,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:33:07,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:33:07,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:33:07,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:33:07,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:33:07,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:33:07,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:33:07,207 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:33:07,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:33:07,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:33:07,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:33:07,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:33:07,208 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:33:07,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:33:07,208 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:33:07,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:33:07,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:33:07,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:33:07,208 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:33:07,208 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:33:07,208 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:33:07,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:33:07,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:33:07,209 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:33:07,209 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:33:07,209 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:33:07,209 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:33:07,209 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:33:07,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:33:07,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:33:07,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:33:07,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:33:07,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:33:07,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:33:07,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:33:07,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:33:07,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:33:07,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:33:07,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:33:07,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:33:07,210 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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2025-02-08 08:33:07,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:33:07,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:33:07,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:33:07,432 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:33:07,433 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:33:07,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-02-08 08:33:08,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/081e6f390/51d9eb8f52ba4380b8d1af9a56047415/FLAGd26d6aead [2025-02-08 08:33:09,018 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:33:09,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-02-08 08:33:09,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/081e6f390/51d9eb8f52ba4380b8d1af9a56047415/FLAGd26d6aead [2025-02-08 08:33:09,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/081e6f390/51d9eb8f52ba4380b8d1af9a56047415 [2025-02-08 08:33:09,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:33:09,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:33:09,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:33:09,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:33:09,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:33:09,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568aa19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09, skipping insertion in model container [2025-02-08 08:33:09,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:33:09,476 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-08 08:33:09,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:33:09,486 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:33:09,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:33:09,535 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:33:09,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09 WrapperNode [2025-02-08 08:33:09,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:33:09,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:33:09,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:33:09,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:33:09,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,579 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 187 [2025-02-08 08:33:09,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:33:09,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:33:09,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:33:09,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:33:09,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,620 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-08 08:33:09,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:33:09,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:33:09,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:33:09,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:33:09,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (1/1) ... [2025-02-08 08:33:09,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:33:09,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:33:09,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:33:09,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:33:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:33:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:33:09,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:33:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:33:09,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:33:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:33:09,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:33:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:33:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:33:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:33:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:33:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:33:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:33:09,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:33:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:33:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:33:09,690 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:33:09,774 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:33:09,776 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:33:10,167 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:33:10,167 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:33:10,353 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:33:10,353 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:33:10,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:33:10 BoogieIcfgContainer [2025-02-08 08:33:10,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:33:10,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:33:10,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:33:10,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:33:10,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:33:09" (1/3) ... [2025-02-08 08:33:10,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb80e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:33:10, skipping insertion in model container [2025-02-08 08:33:10,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:33:09" (2/3) ... [2025-02-08 08:33:10,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb80e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:33:10, skipping insertion in model container [2025-02-08 08:33:10,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:33:10" (3/3) ... [2025-02-08 08:33:10,359 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2025-02-08 08:33:10,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:33:10,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 91 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-02-08 08:33:10,380 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:33:10,438 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:33:10,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 105 transitions, 231 flow [2025-02-08 08:33:10,503 INFO L124 PetriNetUnfolderBase]: 15/102 cut-off events. [2025-02-08 08:33:10,506 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:33:10,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 15/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 269 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-02-08 08:33:10,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 105 transitions, 231 flow [2025-02-08 08:33:10,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 101 transitions, 220 flow [2025-02-08 08:33:10,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:33:10,533 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;@31e4db78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:33:10,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-02-08 08:33:10,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:33:10,535 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:33:10,535 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:33:10,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:10,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:33:10,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:10,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 663282, now seen corresponding path program 1 times [2025-02-08 08:33:10,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:10,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670106935] [2025-02-08 08:33:10,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:10,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:33:10,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:33:10,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:10,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:33:10,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:10,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670106935] [2025-02-08 08:33:10,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670106935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:33:10,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:33:10,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:33:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471928842] [2025-02-08 08:33:10,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:33:10,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:33:10,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:10,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:33:10,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:33:10,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-08 08:33:10,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:10,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:10,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-08 08:33:10,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:11,016 INFO L124 PetriNetUnfolderBase]: 534/1059 cut-off events. [2025-02-08 08:33:11,016 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-08 08:33:11,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 1059 events. 534/1059 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6160 event pairs, 210 based on Foata normal form. 1/570 useless extension candidates. Maximal degree in co-relation 1547. Up to 662 conditions per place. [2025-02-08 08:33:11,028 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 35 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-02-08 08:33:11,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 284 flow [2025-02-08 08:33:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:33:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:33:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2025-02-08 08:33:11,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7301587301587301 [2025-02-08 08:33:11,039 INFO L175 Difference]: Start difference. First operand has 96 places, 101 transitions, 220 flow. Second operand 3 states and 230 transitions. [2025-02-08 08:33:11,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 284 flow [2025-02-08 08:33:11,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 96 transitions, 272 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:33:11,047 INFO L231 Difference]: Finished difference. Result has 87 places, 96 transitions, 202 flow [2025-02-08 08:33:11,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=87, PETRI_TRANSITIONS=96} [2025-02-08 08:33:11,051 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -9 predicate places. [2025-02-08 08:33:11,052 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 202 flow [2025-02-08 08:33:11,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:11,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:11,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:33:11,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:33:11,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:11,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash 663283, now seen corresponding path program 1 times [2025-02-08 08:33:11,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:11,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454565674] [2025-02-08 08:33:11,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:11,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:33:11,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:33:11,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:11,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:33:11,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454565674] [2025-02-08 08:33:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454565674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:33:11,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:33:11,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:33:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490697111] [2025-02-08 08:33:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:33:11,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:33:11,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:11,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:33:11,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:33:11,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-08 08:33:11,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:11,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:11,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-08 08:33:11,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:11,571 INFO L124 PetriNetUnfolderBase]: 535/1062 cut-off events. [2025-02-08 08:33:11,571 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 08:33:11,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 1062 events. 535/1062 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6174 event pairs, 210 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1727. Up to 675 conditions per place. [2025-02-08 08:33:11,579 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 39 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2025-02-08 08:33:11,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 99 transitions, 294 flow [2025-02-08 08:33:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:33:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:33:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 296 transitions. [2025-02-08 08:33:11,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2025-02-08 08:33:11,582 INFO L175 Difference]: Start difference. First operand has 87 places, 96 transitions, 202 flow. Second operand 4 states and 296 transitions. [2025-02-08 08:33:11,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 99 transitions, 294 flow [2025-02-08 08:33:11,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 99 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:33:11,584 INFO L231 Difference]: Finished difference. Result has 90 places, 99 transitions, 225 flow [2025-02-08 08:33:11,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=90, PETRI_TRANSITIONS=99} [2025-02-08 08:33:11,585 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -6 predicate places. [2025-02-08 08:33:11,585 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 99 transitions, 225 flow [2025-02-08 08:33:11,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:11,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:11,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:33:11,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:33:11,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:11,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:11,587 INFO L85 PathProgramCache]: Analyzing trace with hash 20561102, now seen corresponding path program 1 times [2025-02-08 08:33:11,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:11,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770369639] [2025-02-08 08:33:11,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:11,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:33:11,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:33:11,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:11,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:33:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770369639] [2025-02-08 08:33:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770369639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:33:11,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:33:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:33:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115879797] [2025-02-08 08:33:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:33:11,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:33:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:11,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:33:11,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:33:12,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-08 08:33:12,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 99 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:12,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:12,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-08 08:33:12,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:12,364 INFO L124 PetriNetUnfolderBase]: 536/1065 cut-off events. [2025-02-08 08:33:12,364 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 08:33:12,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 1065 events. 536/1065 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6227 event pairs, 210 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 1756. Up to 674 conditions per place. [2025-02-08 08:33:12,376 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 39 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2025-02-08 08:33:12,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 323 flow [2025-02-08 08:33:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:33:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:33:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 362 transitions. [2025-02-08 08:33:12,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6895238095238095 [2025-02-08 08:33:12,378 INFO L175 Difference]: Start difference. First operand has 90 places, 99 transitions, 225 flow. Second operand 5 states and 362 transitions. [2025-02-08 08:33:12,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 323 flow [2025-02-08 08:33:12,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:33:12,380 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 259 flow [2025-02-08 08:33:12,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2025-02-08 08:33:12,381 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2025-02-08 08:33:12,381 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 259 flow [2025-02-08 08:33:12,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:12,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:12,384 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:33:12,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:33:12,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:12,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:12,385 INFO L85 PathProgramCache]: Analyzing trace with hash 637434376, now seen corresponding path program 1 times [2025-02-08 08:33:12,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:12,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136057191] [2025-02-08 08:33:12,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:12,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:12,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:33:12,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:33:12,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:12,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:12,643 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-08 08:33:12,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:12,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136057191] [2025-02-08 08:33:12,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136057191] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:33:12,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049238798] [2025-02-08 08:33:12,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:12,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:33:12,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:33:12,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:33:12,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:33:12,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:33:12,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:33:12,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:12,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:12,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:33:12,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:33:12,794 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-08 08:33:13,058 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-08 08:33:13,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:33:13,135 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-08 08:33:13,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049238798] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:33:13,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:33:13,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:33:13,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815951488] [2025-02-08 08:33:13,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:33:13,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:33:13,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:13,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:33:13,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:33:13,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-08 08:33:13,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 259 flow. Second operand has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:13,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:13,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-08 08:33:13,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:13,765 INFO L124 PetriNetUnfolderBase]: 537/1067 cut-off events. [2025-02-08 08:33:13,765 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 08:33:13,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 1067 events. 537/1067 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6211 event pairs, 210 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 1766. Up to 675 conditions per place. [2025-02-08 08:33:13,773 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 38 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2025-02-08 08:33:13,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 104 transitions, 366 flow [2025-02-08 08:33:13,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:33:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:33:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 551 transitions. [2025-02-08 08:33:13,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655952380952381 [2025-02-08 08:33:13,775 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 259 flow. Second operand 8 states and 551 transitions. [2025-02-08 08:33:13,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 104 transitions, 366 flow [2025-02-08 08:33:13,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 104 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:33:13,778 INFO L231 Difference]: Finished difference. Result has 100 places, 104 transitions, 289 flow [2025-02-08 08:33:13,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=289, PETRI_PLACES=100, PETRI_TRANSITIONS=104} [2025-02-08 08:33:13,779 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2025-02-08 08:33:13,779 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 104 transitions, 289 flow [2025-02-08 08:33:13,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:13,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:13,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:33:13,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:33:13,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:33:13,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:13,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash 637396975, now seen corresponding path program 1 times [2025-02-08 08:33:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:13,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511798775] [2025-02-08 08:33:13,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:13,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:13,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:33:13,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:33:13,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:13,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:33:14,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:14,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511798775] [2025-02-08 08:33:14,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511798775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:33:14,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:33:14,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:33:14,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463154689] [2025-02-08 08:33:14,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:33:14,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:33:14,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:14,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:33:14,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:33:14,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-08 08:33:14,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 104 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:14,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:14,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-08 08:33:14,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:14,505 INFO L124 PetriNetUnfolderBase]: 538/1070 cut-off events. [2025-02-08 08:33:14,505 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 08:33:14,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 1070 events. 538/1070 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6214 event pairs, 210 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 1774. Up to 679 conditions per place. [2025-02-08 08:33:14,519 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 42 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2025-02-08 08:33:14,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 107 transitions, 397 flow [2025-02-08 08:33:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:33:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:33:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2025-02-08 08:33:14,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6876190476190476 [2025-02-08 08:33:14,525 INFO L175 Difference]: Start difference. First operand has 100 places, 104 transitions, 289 flow. Second operand 5 states and 361 transitions. [2025-02-08 08:33:14,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 107 transitions, 397 flow [2025-02-08 08:33:14,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 107 transitions, 350 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-02-08 08:33:14,527 INFO L231 Difference]: Finished difference. Result has 98 places, 107 transitions, 285 flow [2025-02-08 08:33:14,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=98, PETRI_TRANSITIONS=107} [2025-02-08 08:33:14,528 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 2 predicate places. [2025-02-08 08:33:14,528 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 107 transitions, 285 flow [2025-02-08 08:33:14,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:14,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:14,531 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:33:14,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:33:14,532 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:14,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:14,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1715597731, now seen corresponding path program 1 times [2025-02-08 08:33:14,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:14,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414615869] [2025-02-08 08:33:14,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:14,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:14,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:33:14,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:33:14,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:14,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:14,726 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-08 08:33:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414615869] [2025-02-08 08:33:14,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414615869] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:33:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622493451] [2025-02-08 08:33:14,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:14,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:33:14,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:33:14,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:33:14,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:33:14,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:33:14,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:33:14,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:14,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:14,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:33:14,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:33:14,794 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-08 08:33:14,870 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-08 08:33:14,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:33:14,965 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-08 08:33:14,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622493451] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:33:14,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:33:14,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 08:33:14,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152974485] [2025-02-08 08:33:14,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:33:14,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:33:14,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:14,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:33:14,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:33:15,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-08 08:33:15,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 107 transitions, 285 flow. Second operand has 13 states, 13 states have (on average 64.3076923076923) internal successors, (836), 13 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:15,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:15,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-08 08:33:15,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:15,786 INFO L124 PetriNetUnfolderBase]: 538/1069 cut-off events. [2025-02-08 08:33:15,786 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 08:33:15,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 1069 events. 538/1069 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6250 event pairs, 210 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 1763. Up to 669 conditions per place. [2025-02-08 08:33:15,793 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 35 selfloop transitions, 15 changer transitions 0/106 dead transitions. [2025-02-08 08:33:15,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 106 transitions, 381 flow [2025-02-08 08:33:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:33:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:33:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 486 transitions. [2025-02-08 08:33:15,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612244897959184 [2025-02-08 08:33:15,796 INFO L175 Difference]: Start difference. First operand has 98 places, 107 transitions, 285 flow. Second operand 7 states and 486 transitions. [2025-02-08 08:33:15,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 106 transitions, 381 flow [2025-02-08 08:33:15,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 106 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:33:15,799 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 304 flow [2025-02-08 08:33:15,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2025-02-08 08:33:15,801 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-02-08 08:33:15,802 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 304 flow [2025-02-08 08:33:15,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.3076923076923) internal successors, (836), 13 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:15,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:15,802 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 08:33:15,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:33:16,003 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-08 08:33:16,003 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:16,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1641808940, now seen corresponding path program 1 times [2025-02-08 08:33:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898340753] [2025-02-08 08:33:16,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:16,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:33:16,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:33:16,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:16,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:16,233 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-08 08:33:16,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898340753] [2025-02-08 08:33:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898340753] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:33:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427688650] [2025-02-08 08:33:16,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:16,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:33:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:33:16,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:33:16,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:33:16,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:33:16,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:33:16,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:16,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:16,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:33:16,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:33:16,318 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-08 08:33:16,412 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-08 08:33:16,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:33:16,551 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-08 08:33:16,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427688650] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:33:16,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:33:16,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 08:33:16,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831118295] [2025-02-08 08:33:16,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:33:16,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:33:16,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:16,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:33:16,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:33:17,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-02-08 08:33:17,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 304 flow. Second operand has 13 states, 13 states have (on average 64.46153846153847) internal successors, (838), 13 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:17,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:17,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-02-08 08:33:17,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:17,742 INFO L124 PetriNetUnfolderBase]: 539/1071 cut-off events. [2025-02-08 08:33:17,742 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 08:33:17,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 1071 events. 539/1071 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6229 event pairs, 210 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 1768. Up to 670 conditions per place. [2025-02-08 08:33:17,748 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 31 selfloop transitions, 21 changer transitions 0/108 dead transitions. [2025-02-08 08:33:17,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 416 flow [2025-02-08 08:33:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:33:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:33:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 618 transitions. [2025-02-08 08:33:17,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.653968253968254 [2025-02-08 08:33:17,750 INFO L175 Difference]: Start difference. First operand has 101 places, 106 transitions, 304 flow. Second operand 9 states and 618 transitions. [2025-02-08 08:33:17,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 416 flow [2025-02-08 08:33:17,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 108 transitions, 389 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 08:33:17,752 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 327 flow [2025-02-08 08:33:17,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=103, PETRI_TRANSITIONS=108} [2025-02-08 08:33:17,753 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 7 predicate places. [2025-02-08 08:33:17,753 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 327 flow [2025-02-08 08:33:17,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.46153846153847) internal successors, (838), 13 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:17,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:17,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:33:17,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:33:17,958 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-08 08:33:17,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:17,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash 647960884, now seen corresponding path program 1 times [2025-02-08 08:33:17,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:17,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414966461] [2025-02-08 08:33:17,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:17,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:33:17,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:33:17,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:17,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:33:18,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:18,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414966461] [2025-02-08 08:33:18,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414966461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:33:18,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:33:18,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:33:18,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325339018] [2025-02-08 08:33:18,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:33:18,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:33:18,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:18,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:33:18,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:33:18,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-02-08 08:33:18,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:18,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:18,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-02-08 08:33:18,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:18,267 INFO L124 PetriNetUnfolderBase]: 847/1773 cut-off events. [2025-02-08 08:33:18,267 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 08:33:18,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3006 conditions, 1773 events. 847/1773 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11922 event pairs, 368 based on Foata normal form. 32/1038 useless extension candidates. Maximal degree in co-relation 2055. Up to 781 conditions per place. [2025-02-08 08:33:18,280 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 86 selfloop transitions, 7 changer transitions 0/148 dead transitions. [2025-02-08 08:33:18,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 148 transitions, 657 flow [2025-02-08 08:33:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:33:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:33:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2025-02-08 08:33:18,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7695238095238095 [2025-02-08 08:33:18,283 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 327 flow. Second operand 5 states and 404 transitions. [2025-02-08 08:33:18,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 148 transitions, 657 flow [2025-02-08 08:33:18,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 148 transitions, 585 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-02-08 08:33:18,286 INFO L231 Difference]: Finished difference. Result has 103 places, 112 transitions, 333 flow [2025-02-08 08:33:18,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=103, PETRI_TRANSITIONS=112} [2025-02-08 08:33:18,288 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 7 predicate places. [2025-02-08 08:33:18,289 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 112 transitions, 333 flow [2025-02-08 08:33:18,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:18,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:18,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:33:18,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:33:18,289 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:18,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash 100754238, now seen corresponding path program 1 times [2025-02-08 08:33:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023353945] [2025-02-08 08:33:18,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:18,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:33:18,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:33:18,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:18,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:33:18,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023353945] [2025-02-08 08:33:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023353945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:33:18,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:33:18,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:33:18,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253003341] [2025-02-08 08:33:18,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:33:18,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:33:18,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:18,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:33:18,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:33:18,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-02-08 08:33:18,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 112 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:18,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:18,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-02-08 08:33:18,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:18,701 INFO L124 PetriNetUnfolderBase]: 1761/3656 cut-off events. [2025-02-08 08:33:18,701 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-02-08 08:33:18,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6204 conditions, 3656 events. 1761/3656 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 27950 event pairs, 543 based on Foata normal form. 32/2164 useless extension candidates. Maximal degree in co-relation 4434. Up to 943 conditions per place. [2025-02-08 08:33:18,714 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 112 selfloop transitions, 8 changer transitions 0/175 dead transitions. [2025-02-08 08:33:18,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 175 transitions, 742 flow [2025-02-08 08:33:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:33:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:33:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2025-02-08 08:33:18,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-02-08 08:33:18,718 INFO L175 Difference]: Start difference. First operand has 103 places, 112 transitions, 333 flow. Second operand 5 states and 422 transitions. [2025-02-08 08:33:18,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 175 transitions, 742 flow [2025-02-08 08:33:18,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 175 transitions, 737 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:33:18,720 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 358 flow [2025-02-08 08:33:18,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2025-02-08 08:33:18,721 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 11 predicate places. [2025-02-08 08:33:18,721 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 358 flow [2025-02-08 08:33:18,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:18,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:18,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:33:18,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:33:18,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:18,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:18,722 INFO L85 PathProgramCache]: Analyzing trace with hash -127694267, now seen corresponding path program 1 times [2025-02-08 08:33:18,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:18,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432597993] [2025-02-08 08:33:18,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:18,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:18,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:33:18,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:33:18,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:18,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:18,787 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-08 08:33:18,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:18,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432597993] [2025-02-08 08:33:18,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432597993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:33:18,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:33:18,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:33:18,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965918311] [2025-02-08 08:33:18,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:33:18,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:33:18,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:18,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:33:18,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:33:18,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-02-08 08:33:18,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 113 transitions, 358 flow. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:18,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:18,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-02-08 08:33:18,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:19,040 INFO L124 PetriNetUnfolderBase]: 1364/2920 cut-off events. [2025-02-08 08:33:19,041 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-02-08 08:33:19,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 2920 events. 1364/2920 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 21824 event pairs, 678 based on Foata normal form. 40/1912 useless extension candidates. Maximal degree in co-relation 3168. Up to 1561 conditions per place. [2025-02-08 08:33:19,051 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 85 selfloop transitions, 7 changer transitions 0/147 dead transitions. [2025-02-08 08:33:19,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 147 transitions, 646 flow [2025-02-08 08:33:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:33:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:33:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2025-02-08 08:33:19,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7485714285714286 [2025-02-08 08:33:19,053 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 358 flow. Second operand 5 states and 393 transitions. [2025-02-08 08:33:19,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 147 transitions, 646 flow [2025-02-08 08:33:19,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 147 transitions, 644 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:33:19,057 INFO L231 Difference]: Finished difference. Result has 111 places, 113 transitions, 373 flow [2025-02-08 08:33:19,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=111, PETRI_TRANSITIONS=113} [2025-02-08 08:33:19,057 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 15 predicate places. [2025-02-08 08:33:19,057 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 113 transitions, 373 flow [2025-02-08 08:33:19,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:19,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:19,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:33:19,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:33:19,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:19,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash -362152307, now seen corresponding path program 1 times [2025-02-08 08:33:19,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:19,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043280645] [2025-02-08 08:33:19,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:19,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:19,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:33:19,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:33:19,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:19,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:33:19,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:19,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043280645] [2025-02-08 08:33:19,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043280645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:33:19,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:33:19,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:33:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049958615] [2025-02-08 08:33:19,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:33:19,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:33:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:19,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:33:19,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:33:19,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 105 [2025-02-08 08:33:19,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 113 transitions, 373 flow. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:19,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:19,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 105 [2025-02-08 08:33:19,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:19,389 INFO L124 PetriNetUnfolderBase]: 1756/3157 cut-off events. [2025-02-08 08:33:19,390 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-02-08 08:33:19,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5784 conditions, 3157 events. 1756/3157 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20938 event pairs, 905 based on Foata normal form. 0/2268 useless extension candidates. Maximal degree in co-relation 3895. Up to 2311 conditions per place. [2025-02-08 08:33:19,403 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 53 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2025-02-08 08:33:19,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 109 transitions, 487 flow [2025-02-08 08:33:19,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:33:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:33:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 320 transitions. [2025-02-08 08:33:19,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2025-02-08 08:33:19,404 INFO L175 Difference]: Start difference. First operand has 111 places, 113 transitions, 373 flow. Second operand 5 states and 320 transitions. [2025-02-08 08:33:19,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 109 transitions, 487 flow [2025-02-08 08:33:19,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 474 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:33:19,406 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 368 flow [2025-02-08 08:33:19,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2025-02-08 08:33:19,407 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 12 predicate places. [2025-02-08 08:33:19,407 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 368 flow [2025-02-08 08:33:19,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:19,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:19,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:33:19,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:33:19,408 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:19,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:19,409 INFO L85 PathProgramCache]: Analyzing trace with hash -362152306, now seen corresponding path program 1 times [2025-02-08 08:33:19,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:19,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421375430] [2025-02-08 08:33:19,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:19,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:33:19,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:33:19,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:19,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:19,587 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-08 08:33:19,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:19,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421375430] [2025-02-08 08:33:19,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421375430] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:33:19,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563106763] [2025-02-08 08:33:19,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:19,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:33:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:33:19,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:33:19,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:33:19,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:33:19,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:33:19,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:19,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:19,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 08:33:19,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:33:19,661 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-08 08:33:19,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:33:19,701 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-08 08:33:19,717 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 08:33:19,717 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-08 08:33:19,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:33:19,755 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-08 08:33:19,762 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:33:19,762 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-08 08:33:19,793 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-08 08:33:19,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:33:19,964 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 115 treesize of output 111 [2025-02-08 08:33:20,103 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-08 08:33:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563106763] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:33:20,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:33:20,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 08:33:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620954435] [2025-02-08 08:33:20,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:33:20,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:33:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:20,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:33:20,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:33:21,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 105 [2025-02-08 08:33:21,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 368 flow. Second operand has 14 states, 14 states have (on average 55.142857142857146) internal successors, (772), 14 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:21,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:21,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 105 [2025-02-08 08:33:21,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:21,775 INFO L124 PetriNetUnfolderBase]: 2093/3814 cut-off events. [2025-02-08 08:33:21,775 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-02-08 08:33:21,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6948 conditions, 3814 events. 2093/3814 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 26356 event pairs, 799 based on Foata normal form. 0/2725 useless extension candidates. Maximal degree in co-relation 4972. Up to 1151 conditions per place. [2025-02-08 08:33:21,789 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 110 selfloop transitions, 20 changer transitions 0/176 dead transitions. [2025-02-08 08:33:21,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 176 transitions, 803 flow [2025-02-08 08:33:21,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:33:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:33:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 548 transitions. [2025-02-08 08:33:21,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-02-08 08:33:21,791 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 368 flow. Second operand 8 states and 548 transitions. [2025-02-08 08:33:21,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 176 transitions, 803 flow [2025-02-08 08:33:21,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 176 transitions, 789 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:33:21,794 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 433 flow [2025-02-08 08:33:21,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=433, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2025-02-08 08:33:21,795 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 19 predicate places. [2025-02-08 08:33:21,796 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 433 flow [2025-02-08 08:33:21,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 55.142857142857146) internal successors, (772), 14 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:21,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:21,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:33:21,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:33:21,997 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-08 08:33:21,997 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:21,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1798242791, now seen corresponding path program 1 times [2025-02-08 08:33:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:21,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860633149] [2025-02-08 08:33:21,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:21,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:22,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:33:22,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:33:22,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:22,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:22,052 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-08 08:33:22,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:22,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860633149] [2025-02-08 08:33:22,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860633149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:33:22,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:33:22,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:33:22,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327929496] [2025-02-08 08:33:22,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:33:22,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:33:22,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:22,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:33:22,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:33:22,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-02-08 08:33:22,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 433 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:22,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:22,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-02-08 08:33:22,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:22,271 INFO L124 PetriNetUnfolderBase]: 1367/2553 cut-off events. [2025-02-08 08:33:22,271 INFO L125 PetriNetUnfolderBase]: For 668/704 co-relation queries the response was YES. [2025-02-08 08:33:22,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 2553 events. 1367/2553 cut-off events. For 668/704 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16809 event pairs, 735 based on Foata normal form. 20/1886 useless extension candidates. Maximal degree in co-relation 3670. Up to 1614 conditions per place. [2025-02-08 08:33:22,278 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 85 selfloop transitions, 7 changer transitions 0/145 dead transitions. [2025-02-08 08:33:22,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 145 transitions, 711 flow [2025-02-08 08:33:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:33:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:33:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2025-02-08 08:33:22,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7657142857142857 [2025-02-08 08:33:22,280 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 433 flow. Second operand 5 states and 402 transitions. [2025-02-08 08:33:22,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 145 transitions, 711 flow [2025-02-08 08:33:22,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 145 transitions, 692 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-08 08:33:22,283 INFO L231 Difference]: Finished difference. Result has 118 places, 113 transitions, 434 flow [2025-02-08 08:33:22,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=118, PETRI_TRANSITIONS=113} [2025-02-08 08:33:22,285 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 22 predicate places. [2025-02-08 08:33:22,285 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 434 flow [2025-02-08 08:33:22,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:22,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:22,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:33:22,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:33:22,285 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:22,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:22,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2092813164, now seen corresponding path program 1 times [2025-02-08 08:33:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097458249] [2025-02-08 08:33:22,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:22,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:33:22,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:33:22,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:22,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:33:22,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:22,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097458249] [2025-02-08 08:33:22,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097458249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:33:22,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:33:22,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:33:22,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481519333] [2025-02-08 08:33:22,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:33:22,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:33:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:22,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:33:22,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:33:22,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-02-08 08:33:22,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:22,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:22,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-02-08 08:33:22,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:22,639 INFO L124 PetriNetUnfolderBase]: 1864/4124 cut-off events. [2025-02-08 08:33:22,639 INFO L125 PetriNetUnfolderBase]: For 1193/1243 co-relation queries the response was YES. [2025-02-08 08:33:22,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7724 conditions, 4124 events. 1864/4124 cut-off events. For 1193/1243 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 33165 event pairs, 1038 based on Foata normal form. 81/3078 useless extension candidates. Maximal degree in co-relation 6338. Up to 1851 conditions per place. [2025-02-08 08:33:22,658 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 78 selfloop transitions, 8 changer transitions 0/139 dead transitions. [2025-02-08 08:33:22,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 139 transitions, 676 flow [2025-02-08 08:33:22,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:33:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:33:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 392 transitions. [2025-02-08 08:33:22,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7466666666666667 [2025-02-08 08:33:22,659 INFO L175 Difference]: Start difference. First operand has 118 places, 113 transitions, 434 flow. Second operand 5 states and 392 transitions. [2025-02-08 08:33:22,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 139 transitions, 676 flow [2025-02-08 08:33:22,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 139 transitions, 662 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:33:22,663 INFO L231 Difference]: Finished difference. Result has 119 places, 113 transitions, 440 flow [2025-02-08 08:33:22,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=440, PETRI_PLACES=119, PETRI_TRANSITIONS=113} [2025-02-08 08:33:22,664 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 23 predicate places. [2025-02-08 08:33:22,664 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 440 flow [2025-02-08 08:33:22,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:22,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:22,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:33:22,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:33:22,665 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:22,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1658181008, now seen corresponding path program 1 times [2025-02-08 08:33:22,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:22,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156693026] [2025-02-08 08:33:22,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:22,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:33:22,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:33:22,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:22,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:33:22,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:22,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156693026] [2025-02-08 08:33:22,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156693026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:33:22,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:33:22,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:33:22,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016441498] [2025-02-08 08:33:22,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:33:22,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:33:22,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:22,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:33:22,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:33:22,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 105 [2025-02-08 08:33:22,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 113 transitions, 440 flow. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:22,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:33:22,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 105 [2025-02-08 08:33:22,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:33:23,044 INFO L124 PetriNetUnfolderBase]: 2598/5043 cut-off events. [2025-02-08 08:33:23,044 INFO L125 PetriNetUnfolderBase]: For 962/962 co-relation queries the response was YES. [2025-02-08 08:33:23,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9842 conditions, 5043 events. 2598/5043 cut-off events. For 962/962 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 37833 event pairs, 1476 based on Foata normal form. 0/4055 useless extension candidates. Maximal degree in co-relation 7593. Up to 3538 conditions per place. [2025-02-08 08:33:23,071 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 52 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2025-02-08 08:33:23,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 109 transitions, 556 flow [2025-02-08 08:33:23,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:33:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:33:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 324 transitions. [2025-02-08 08:33:23,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2025-02-08 08:33:23,074 INFO L175 Difference]: Start difference. First operand has 119 places, 113 transitions, 440 flow. Second operand 5 states and 324 transitions. [2025-02-08 08:33:23,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 109 transitions, 556 flow [2025-02-08 08:33:23,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 109 transitions, 549 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:33:23,116 INFO L231 Difference]: Finished difference. Result has 117 places, 109 transitions, 445 flow [2025-02-08 08:33:23,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=117, PETRI_TRANSITIONS=109} [2025-02-08 08:33:23,116 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 21 predicate places. [2025-02-08 08:33:23,116 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 445 flow [2025-02-08 08:33:23,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:33:23,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:33:23,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:33:23,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:33:23,117 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-02-08 08:33:23,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:33:23,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1658181009, now seen corresponding path program 1 times [2025-02-08 08:33:23,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:33:23,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620189902] [2025-02-08 08:33:23,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:23,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:33:23,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:33:23,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:33:23,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:23,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:33:23,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:33:23,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620189902] [2025-02-08 08:33:23,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620189902] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:33:23,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487992917] [2025-02-08 08:33:23,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:33:23,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:33:23,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:33:23,249 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:33:23,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:33:23,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:33:23,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:33:23,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:33:23,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:33:23,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:33:23,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:33:23,314 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-08 08:33:23,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:33:23,354 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-08 08:33:23,362 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:33:23,362 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-08 08:33:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:33:23,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:33:23,467 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 61 treesize of output 57 [2025-02-08 08:33:23,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:33:23,532 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 34 treesize of output 39 [2025-02-08 08:33:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:33:23,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487992917] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:33:23,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:33:23,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-08 08:33:23,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149937371] [2025-02-08 08:33:23,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:33:23,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:33:23,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:33:23,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:33:23,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:33:27,569 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-08 08:33:31,575 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-08 08:33:35,599 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-08 08:33:39,624 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-08 08:33:43,632 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-08 08:33:47,638 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-08 08:33:51,643 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-08 08:33:55,666 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-08 08:33:59,687 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-08 08:34:03,726 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-08 08:34:07,749 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-08 08:34:11,772 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-08 08:34:15,793 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-08 08:34:19,799 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-08 08:34:23,804 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-08 08:34:27,810 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-08 08:34:31,832 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-08 08:34:35,858 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-08 08:34:39,864 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-08 08:34:43,887 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-08 08:34:47,928 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-08 08:34:51,963 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]