./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:01:37,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:01:37,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:01:37,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:01:37,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:01:37,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:01:37,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:01:37,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:01:37,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:01:37,257 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:01:37,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:01:37,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:01:37,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:01:37,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:01:37,257 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:01:37,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:01:37,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:01:37,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:01:37,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:01:37,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:01:37,258 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:01:37,258 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:01:37,258 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:01:37,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:01:37,258 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:01:37,258 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:01:37,259 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:01:37,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:01:37,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:01:37,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:01:37,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:01:37,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:01:37,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:01:37,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:01:37,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:01:37,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:01:37,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:01:37,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:01:37,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:01:37,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:01:37,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:01:37,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:01:37,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:01:37,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:01:37,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:01:37,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:01:37,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:01:37,260 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2025-01-10 01:01:37,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:01:37,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:01:37,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:01:37,501 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:01:37,501 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:01:37,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-01-10 01:01:38,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c974a1ac/8dfe841304c24b50aa5b3cc4cd1e8b64/FLAGc80966ff5 [2025-01-10 01:01:39,054 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:01:39,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-01-10 01:01:39,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c974a1ac/8dfe841304c24b50aa5b3cc4cd1e8b64/FLAGc80966ff5 [2025-01-10 01:01:39,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c974a1ac/8dfe841304c24b50aa5b3cc4cd1e8b64 [2025-01-10 01:01:39,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:01:39,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:01:39,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:01:39,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:01:39,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:01:39,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b6642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39, skipping insertion in model container [2025-01-10 01:01:39,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:01:39,473 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:01:39,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:01:39,486 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:01:39,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:01:39,520 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:01:39,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39 WrapperNode [2025-01-10 01:01:39,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:01:39,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:01:39,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:01:39,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:01:39,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,562 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 254 [2025-01-10 01:01:39,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:01:39,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:01:39,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:01:39,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:01:39,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,595 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-01-10 01:01:39,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:01:39,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:01:39,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:01:39,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:01:39,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (1/1) ... [2025-01-10 01:01:39,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:01:39,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:39,633 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-01-10 01:01:39,638 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-01-10 01:01:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:01:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:01:39,653 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:01:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:01:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:01:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:01:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:01:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:01:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:01:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:01:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:01:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:01:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:01:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:01:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:01:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:01:39,655 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:01:39,726 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:01:39,727 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:01:40,120 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:01:40,120 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:01:40,370 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:01:40,371 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:01:40,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:01:40 BoogieIcfgContainer [2025-01-10 01:01:40,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:01:40,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:01:40,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:01:40,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:01:40,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:01:39" (1/3) ... [2025-01-10 01:01:40,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d734cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:01:40, skipping insertion in model container [2025-01-10 01:01:40,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:39" (2/3) ... [2025-01-10 01:01:40,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d734cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:01:40, skipping insertion in model container [2025-01-10 01:01:40,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:01:40" (3/3) ... [2025-01-10 01:01:40,380 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-01-10 01:01:40,389 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:01:40,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 79 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-01-10 01:01:40,390 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:01:40,460 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:01:40,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 195 flow [2025-01-10 01:01:40,524 INFO L124 PetriNetUnfolderBase]: 9/84 cut-off events. [2025-01-10 01:01:40,527 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:01:40,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 9/84 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 273 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2025-01-10 01:01:40,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 195 flow [2025-01-10 01:01:40,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 184 flow [2025-01-10 01:01:40,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:01:40,550 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;@f92ff7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:01:40,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-01-10 01:01:40,553 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:01:40,553 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:01:40,553 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:01:40,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:40,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:01:40,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:40,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash 821260, now seen corresponding path program 1 times [2025-01-10 01:01:40,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:40,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733544431] [2025-01-10 01:01:40,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:40,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:40,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:01:40,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:01:40,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:40,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:40,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:40,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733544431] [2025-01-10 01:01:40,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733544431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:40,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:40,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:01:40,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245725529] [2025-01-10 01:01:40,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:40,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:01:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:40,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:01:40,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:01:40,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-01-10 01:01:40,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:40,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:40,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-01-10 01:01:40,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:41,008 INFO L124 PetriNetUnfolderBase]: 902/1555 cut-off events. [2025-01-10 01:01:41,009 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-01-10 01:01:41,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2871 conditions, 1555 events. 902/1555 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8553 event pairs, 543 based on Foata normal form. 1/1077 useless extension candidates. Maximal degree in co-relation 2611. Up to 1218 conditions per place. [2025-01-10 01:01:41,029 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 33 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-01-10 01:01:41,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 244 flow [2025-01-10 01:01:41,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:01:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:01:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-01-10 01:01:41,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2025-01-10 01:01:41,059 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 184 flow. Second operand 3 states and 180 transitions. [2025-01-10 01:01:41,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 244 flow [2025-01-10 01:01:41,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 232 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:01:41,065 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 166 flow [2025-01-10 01:01:41,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2025-01-10 01:01:41,069 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2025-01-10 01:01:41,069 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 166 flow [2025-01-10 01:01:41,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:41,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:41,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:01:41,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:01:41,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:41,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:41,070 INFO L85 PathProgramCache]: Analyzing trace with hash 821261, now seen corresponding path program 1 times [2025-01-10 01:01:41,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:41,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708157096] [2025-01-10 01:01:41,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:41,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:41,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:01:41,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:01:41,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:41,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:41,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:41,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708157096] [2025-01-10 01:01:41,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708157096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:41,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:41,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:01:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351538648] [2025-01-10 01:01:41,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:41,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:01:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:41,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:01:41,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:01:41,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-01-10 01:01:41,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:41,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:41,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-01-10 01:01:41,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:41,626 INFO L124 PetriNetUnfolderBase]: 903/1558 cut-off events. [2025-01-10 01:01:41,626 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 01:01:41,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 1558 events. 903/1558 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8551 event pairs, 543 based on Foata normal form. 0/1076 useless extension candidates. Maximal degree in co-relation 2785. Up to 1231 conditions per place. [2025-01-10 01:01:41,636 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 37 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-01-10 01:01:41,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 81 transitions, 254 flow [2025-01-10 01:01:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:01:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:01:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2025-01-10 01:01:41,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2025-01-10 01:01:41,638 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 166 flow. Second operand 4 states and 230 transitions. [2025-01-10 01:01:41,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 81 transitions, 254 flow [2025-01-10 01:01:41,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:01:41,640 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 189 flow [2025-01-10 01:01:41,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2025-01-10 01:01:41,641 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -6 predicate places. [2025-01-10 01:01:41,641 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 189 flow [2025-01-10 01:01:41,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:41,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:41,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:01:41,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:01:41,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:41,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:41,642 INFO L85 PathProgramCache]: Analyzing trace with hash 25461661, now seen corresponding path program 1 times [2025-01-10 01:01:41,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:41,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134781089] [2025-01-10 01:01:41,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:41,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:41,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:01:41,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:01:41,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:41,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:41,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:41,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134781089] [2025-01-10 01:01:41,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134781089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:41,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:41,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:01:41,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516939801] [2025-01-10 01:01:41,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:41,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:01:41,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:41,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:01:41,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:01:41,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-01-10 01:01:41,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:41,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:41,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-01-10 01:01:41,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:42,137 INFO L124 PetriNetUnfolderBase]: 904/1561 cut-off events. [2025-01-10 01:01:42,137 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 01:01:42,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2839 conditions, 1561 events. 904/1561 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8500 event pairs, 543 based on Foata normal form. 0/1078 useless extension candidates. Maximal degree in co-relation 2814. Up to 1230 conditions per place. [2025-01-10 01:01:42,146 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 37 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-01-10 01:01:42,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 283 flow [2025-01-10 01:01:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:01:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:01:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2025-01-10 01:01:42,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2025-01-10 01:01:42,148 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 189 flow. Second operand 5 states and 280 transitions. [2025-01-10 01:01:42,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 283 flow [2025-01-10 01:01:42,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:01:42,150 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 223 flow [2025-01-10 01:01:42,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2025-01-10 01:01:42,151 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2025-01-10 01:01:42,151 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 223 flow [2025-01-10 01:01:42,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:42,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:42,151 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:01:42,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:01:42,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:42,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 789258335, now seen corresponding path program 1 times [2025-01-10 01:01:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:42,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776024483] [2025-01-10 01:01:42,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:42,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:01:42,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:01:42,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:42,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:42,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:42,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776024483] [2025-01-10 01:01:42,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776024483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:42,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965579846] [2025-01-10 01:01:42,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:42,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:42,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:42,389 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-01-10 01:01:42,391 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-01-10 01:01:42,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:01:42,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:01:42,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:42,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:42,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:01:42,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:42,515 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-01-10 01:01:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:42,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:42,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965579846] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:42,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:42,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:01:42,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059619345] [2025-01-10 01:01:42,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:42,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:01:42,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:42,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:01:42,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:01:43,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-01-10 01:01:43,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 223 flow. Second operand has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:43,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:43,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-01-10 01:01:43,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:43,408 INFO L124 PetriNetUnfolderBase]: 904/1560 cut-off events. [2025-01-10 01:01:43,408 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-10 01:01:43,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 1560 events. 904/1560 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8520 event pairs, 543 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 2824. Up to 1230 conditions per place. [2025-01-10 01:01:43,419 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 36 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2025-01-10 01:01:43,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 305 flow [2025-01-10 01:01:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:01:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:01:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 323 transitions. [2025-01-10 01:01:43,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6187739463601533 [2025-01-10 01:01:43,421 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 223 flow. Second operand 6 states and 323 transitions. [2025-01-10 01:01:43,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 305 flow [2025-01-10 01:01:43,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 83 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:01:43,424 INFO L231 Difference]: Finished difference. Result has 86 places, 83 transitions, 232 flow [2025-01-10 01:01:43,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=86, PETRI_TRANSITIONS=83} [2025-01-10 01:01:43,425 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 2 predicate places. [2025-01-10 01:01:43,426 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 232 flow [2025-01-10 01:01:43,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:43,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:43,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:01:43,436 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-01-10 01:01:43,631 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-01-10 01:01:43,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:43,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash 789313125, now seen corresponding path program 1 times [2025-01-10 01:01:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:43,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257290297] [2025-01-10 01:01:43,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:43,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:01:43,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:01:43,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:43,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257290297] [2025-01-10 01:01:43,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257290297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:43,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:43,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:01:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602120665] [2025-01-10 01:01:43,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:43,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:01:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:43,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:01:43,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:01:43,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-01-10 01:01:43,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:43,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:43,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-01-10 01:01:43,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:44,110 INFO L124 PetriNetUnfolderBase]: 905/1563 cut-off events. [2025-01-10 01:01:44,111 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-10 01:01:44,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 1563 events. 905/1563 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8584 event pairs, 543 based on Foata normal form. 0/1082 useless extension candidates. Maximal degree in co-relation 2832. Up to 1232 conditions per place. [2025-01-10 01:01:44,119 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 37 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2025-01-10 01:01:44,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 86 transitions, 330 flow [2025-01-10 01:01:44,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:01:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:01:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2025-01-10 01:01:44,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6413793103448275 [2025-01-10 01:01:44,120 INFO L175 Difference]: Start difference. First operand has 86 places, 83 transitions, 232 flow. Second operand 5 states and 279 transitions. [2025-01-10 01:01:44,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 86 transitions, 330 flow [2025-01-10 01:01:44,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 86 transitions, 296 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-01-10 01:01:44,122 INFO L231 Difference]: Finished difference. Result has 84 places, 86 transitions, 241 flow [2025-01-10 01:01:44,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=84, PETRI_TRANSITIONS=86} [2025-01-10 01:01:44,123 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 0 predicate places. [2025-01-10 01:01:44,123 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 86 transitions, 241 flow [2025-01-10 01:01:44,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:44,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:44,123 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:01:44,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:01:44,124 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:44,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1301119720, now seen corresponding path program 1 times [2025-01-10 01:01:44,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:44,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819264911] [2025-01-10 01:01:44,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:44,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:44,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:01:44,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:01:44,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:44,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:44,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:44,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819264911] [2025-01-10 01:01:44,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819264911] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:44,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900789445] [2025-01-10 01:01:44,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:44,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:44,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:44,267 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-01-10 01:01:44,269 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-01-10 01:01:44,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:01:44,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:01:44,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:44,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:44,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:01:44,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:44,338 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-01-10 01:01:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:44,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900789445] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:44,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:44,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:01:44,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336842473] [2025-01-10 01:01:44,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:44,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:01:44,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:44,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:01:44,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:01:45,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-01-10 01:01:45,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 86 transitions, 241 flow. Second operand has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:45,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:45,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-01-10 01:01:45,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:45,616 INFO L124 PetriNetUnfolderBase]: 907/1568 cut-off events. [2025-01-10 01:01:45,616 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-10 01:01:45,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 1568 events. 907/1568 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8592 event pairs, 543 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 2828. Up to 1226 conditions per place. [2025-01-10 01:01:45,626 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 33 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2025-01-10 01:01:45,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 362 flow [2025-01-10 01:01:45,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:01:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:01:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 473 transitions. [2025-01-10 01:01:45,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6040868454661558 [2025-01-10 01:01:45,628 INFO L175 Difference]: Start difference. First operand has 84 places, 86 transitions, 241 flow. Second operand 9 states and 473 transitions. [2025-01-10 01:01:45,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 362 flow [2025-01-10 01:01:45,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 91 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:01:45,630 INFO L231 Difference]: Finished difference. Result has 89 places, 91 transitions, 288 flow [2025-01-10 01:01:45,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=89, PETRI_TRANSITIONS=91} [2025-01-10 01:01:45,631 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2025-01-10 01:01:45,631 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 91 transitions, 288 flow [2025-01-10 01:01:45,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:45,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:45,631 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:01:45,644 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-01-10 01:01:45,834 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-01-10 01:01:45,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:45,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1679271740, now seen corresponding path program 1 times [2025-01-10 01:01:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129702388] [2025-01-10 01:01:45,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:45,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:01:45,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:01:45,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:45,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:46,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:46,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129702388] [2025-01-10 01:01:46,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129702388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:46,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511265271] [2025-01-10 01:01:46,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:46,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:46,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:46,044 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-01-10 01:01:46,046 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-01-10 01:01:46,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:01:46,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:01:46,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:46,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:46,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:01:46,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:46,124 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-01-10 01:01:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:46,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:46,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511265271] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:46,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:46,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:01:46,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009442088] [2025-01-10 01:01:46,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:46,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:01:46,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:46,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:01:46,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:01:46,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-01-10 01:01:46,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 288 flow. Second operand has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:46,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:46,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-01-10 01:01:46,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:47,199 INFO L124 PetriNetUnfolderBase]: 907/1567 cut-off events. [2025-01-10 01:01:47,199 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 01:01:47,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2891 conditions, 1567 events. 907/1567 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8607 event pairs, 543 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 2836. Up to 1227 conditions per place. [2025-01-10 01:01:47,206 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 31 selfloop transitions, 19 changer transitions 0/90 dead transitions. [2025-01-10 01:01:47,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 384 flow [2025-01-10 01:01:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:01:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:01:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 371 transitions. [2025-01-10 01:01:47,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2025-01-10 01:01:47,208 INFO L175 Difference]: Start difference. First operand has 89 places, 91 transitions, 288 flow. Second operand 7 states and 371 transitions. [2025-01-10 01:01:47,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 384 flow [2025-01-10 01:01:47,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 351 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 01:01:47,209 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 289 flow [2025-01-10 01:01:47,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2025-01-10 01:01:47,210 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2025-01-10 01:01:47,210 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 289 flow [2025-01-10 01:01:47,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:47,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:47,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:47,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:01:47,411 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-01-10 01:01:47,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:47,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:47,413 INFO L85 PathProgramCache]: Analyzing trace with hash -512764894, now seen corresponding path program 1 times [2025-01-10 01:01:47,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:47,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328613640] [2025-01-10 01:01:47,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:47,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:47,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:01:47,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:01:47,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:47,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:47,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:47,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328613640] [2025-01-10 01:01:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328613640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:47,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:47,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:01:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966820749] [2025-01-10 01:01:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:47,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:01:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:47,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:01:47,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:01:47,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-01-10 01:01:47,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:47,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:47,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-01-10 01:01:47,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:47,725 INFO L124 PetriNetUnfolderBase]: 1541/2775 cut-off events. [2025-01-10 01:01:47,726 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:01:47,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 2775 events. 1541/2775 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 17737 event pairs, 702 based on Foata normal form. 62/2094 useless extension candidates. Maximal degree in co-relation 3386. Up to 1424 conditions per place. [2025-01-10 01:01:47,739 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 99 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2025-01-10 01:01:47,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 142 transitions, 663 flow [2025-01-10 01:01:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:01:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:01:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 328 transitions. [2025-01-10 01:01:47,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7540229885057471 [2025-01-10 01:01:47,745 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 289 flow. Second operand 5 states and 328 transitions. [2025-01-10 01:01:47,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 142 transitions, 663 flow [2025-01-10 01:01:47,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 142 transitions, 599 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 01:01:47,751 INFO L231 Difference]: Finished difference. Result has 89 places, 91 transitions, 267 flow [2025-01-10 01:01:47,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=89, PETRI_TRANSITIONS=91} [2025-01-10 01:01:47,752 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2025-01-10 01:01:47,752 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 91 transitions, 267 flow [2025-01-10 01:01:47,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:47,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:47,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:47,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:01:47,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:47,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1089301493, now seen corresponding path program 1 times [2025-01-10 01:01:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:47,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860883804] [2025-01-10 01:01:47,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:47,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:47,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:01:47,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:01:47,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:47,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:01:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860883804] [2025-01-10 01:01:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860883804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:47,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:47,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:01:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780869693] [2025-01-10 01:01:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:47,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:01:47,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:47,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:01:47,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:01:47,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-01-10 01:01:47,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:47,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:47,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-01-10 01:01:47,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:48,184 INFO L124 PetriNetUnfolderBase]: 2316/4532 cut-off events. [2025-01-10 01:01:48,184 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2025-01-10 01:01:48,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8298 conditions, 4532 events. 2316/4532 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 33803 event pairs, 1198 based on Foata normal form. 106/3333 useless extension candidates. Maximal degree in co-relation 5221. Up to 2237 conditions per place. [2025-01-10 01:01:48,206 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 88 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2025-01-10 01:01:48,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 135 transitions, 577 flow [2025-01-10 01:01:48,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:01:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:01:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 376 transitions. [2025-01-10 01:01:48,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7203065134099617 [2025-01-10 01:01:48,208 INFO L175 Difference]: Start difference. First operand has 89 places, 91 transitions, 267 flow. Second operand 6 states and 376 transitions. [2025-01-10 01:01:48,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 135 transitions, 577 flow [2025-01-10 01:01:48,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 135 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:01:48,210 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 302 flow [2025-01-10 01:01:48,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2025-01-10 01:01:48,211 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 11 predicate places. [2025-01-10 01:01:48,211 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 302 flow [2025-01-10 01:01:48,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:48,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:48,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:48,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:01:48,212 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:48,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1304272656, now seen corresponding path program 1 times [2025-01-10 01:01:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:48,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89210453] [2025-01-10 01:01:48,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:48,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:01:48,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:01:48,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:48,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:48,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:48,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89210453] [2025-01-10 01:01:48,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89210453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:48,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:48,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:01:48,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591136171] [2025-01-10 01:01:48,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:48,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:01:48,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:48,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:01:48,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:01:48,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-01-10 01:01:48,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:48,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:48,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-01-10 01:01:48,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:48,572 INFO L124 PetriNetUnfolderBase]: 2002/3829 cut-off events. [2025-01-10 01:01:48,572 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2025-01-10 01:01:48,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 3829 events. 2002/3829 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 27173 event pairs, 1129 based on Foata normal form. 38/2822 useless extension candidates. Maximal degree in co-relation 3651. Up to 2117 conditions per place. [2025-01-10 01:01:48,589 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 81 selfloop transitions, 9 changer transitions 0/129 dead transitions. [2025-01-10 01:01:48,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 129 transitions, 577 flow [2025-01-10 01:01:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:01:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:01:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 371 transitions. [2025-01-10 01:01:48,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.710727969348659 [2025-01-10 01:01:48,591 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 302 flow. Second operand 6 states and 371 transitions. [2025-01-10 01:01:48,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 129 transitions, 577 flow [2025-01-10 01:01:48,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 129 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:01:48,594 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 338 flow [2025-01-10 01:01:48,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2025-01-10 01:01:48,595 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 17 predicate places. [2025-01-10 01:01:48,596 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 338 flow [2025-01-10 01:01:48,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:48,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:48,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:01:48,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1618649205, now seen corresponding path program 1 times [2025-01-10 01:01:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90452667] [2025-01-10 01:01:48,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:48,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:01:48,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:01:48,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:48,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:01:48,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:48,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90452667] [2025-01-10 01:01:48,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90452667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:48,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:48,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:01:48,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890235269] [2025-01-10 01:01:48,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:48,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:01:48,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:48,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:01:48,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:01:48,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 87 [2025-01-10 01:01:48,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-01-10 01:01:48,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:48,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 87 [2025-01-10 01:01:48,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:49,110 INFO L124 PetriNetUnfolderBase]: 2741/5753 cut-off events. [2025-01-10 01:01:49,111 INFO L125 PetriNetUnfolderBase]: For 1919/1919 co-relation queries the response was YES. [2025-01-10 01:01:49,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10997 conditions, 5753 events. 2741/5753 cut-off events. For 1919/1919 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 47363 event pairs, 1932 based on Foata normal form. 0/4203 useless extension candidates. Maximal degree in co-relation 5731. Up to 3876 conditions per place. [2025-01-10 01:01:49,135 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 53 selfloop transitions, 7 changer transitions 0/92 dead transitions. [2025-01-10 01:01:49,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 92 transitions, 450 flow [2025-01-10 01:01:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:01:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:01:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2025-01-10 01:01:49,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5471264367816092 [2025-01-10 01:01:49,136 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 338 flow. Second operand 5 states and 238 transitions. [2025-01-10 01:01:49,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 92 transitions, 450 flow [2025-01-10 01:01:49,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 438 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:01:49,139 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 332 flow [2025-01-10 01:01:49,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2025-01-10 01:01:49,140 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 14 predicate places. [2025-01-10 01:01:49,140 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 332 flow [2025-01-10 01:01:49,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-01-10 01:01:49,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:49,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:49,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:01:49,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:49,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1618649204, now seen corresponding path program 1 times [2025-01-10 01:01:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577193498] [2025-01-10 01:01:49,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:49,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:01:49,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:01:49,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:49,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:49,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577193498] [2025-01-10 01:01:49,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577193498] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707912885] [2025-01-10 01:01:49,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:49,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:49,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:49,348 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-01-10 01:01:49,355 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-01-10 01:01:49,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:01:49,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:01:49,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:49,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:49,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:01:49,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:49,421 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-01-10 01:01:49,431 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-01-10 01:01:49,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:01:49,487 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-01-10 01:01:49,519 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:01:49,519 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-01-10 01:01:49,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:01:49,554 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-01-10 01:01:49,560 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:01:49,560 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-01-10 01:01:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:49,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:49,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707912885] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:49,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:01:49,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 14 [2025-01-10 01:01:49,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55859998] [2025-01-10 01:01:49,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:49,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:01:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:49,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:01:49,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:01:50,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 87 [2025-01-10 01:01:50,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 332 flow. Second operand has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 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-01-10 01:01:50,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:50,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 87 [2025-01-10 01:01:50,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:51,408 INFO L124 PetriNetUnfolderBase]: 3539/6919 cut-off events. [2025-01-10 01:01:51,408 INFO L125 PetriNetUnfolderBase]: For 2042/2042 co-relation queries the response was YES. [2025-01-10 01:01:51,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13399 conditions, 6919 events. 3539/6919 cut-off events. For 2042/2042 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 54829 event pairs, 1708 based on Foata normal form. 0/5337 useless extension candidates. Maximal degree in co-relation 7942. Up to 2435 conditions per place. [2025-01-10 01:01:51,431 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 102 selfloop transitions, 24 changer transitions 0/156 dead transitions. [2025-01-10 01:01:51,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 156 transitions, 795 flow [2025-01-10 01:01:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:01:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:01:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 462 transitions. [2025-01-10 01:01:51,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6637931034482759 [2025-01-10 01:01:51,433 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 332 flow. Second operand 8 states and 462 transitions. [2025-01-10 01:01:51,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 156 transitions, 795 flow [2025-01-10 01:01:51,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 156 transitions, 781 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:01:51,436 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 435 flow [2025-01-10 01:01:51,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=435, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2025-01-10 01:01:51,437 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 19 predicate places. [2025-01-10 01:01:51,437 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 435 flow [2025-01-10 01:01:51,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 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-01-10 01:01:51,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:51,437 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:51,443 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-01-10 01:01:51,641 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-01-10 01:01:51,641 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:51,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1246341573, now seen corresponding path program 1 times [2025-01-10 01:01:51,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:51,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655331817] [2025-01-10 01:01:51,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:51,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:51,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:01:51,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:01:51,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:51,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:51,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655331817] [2025-01-10 01:01:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655331817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:51,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:51,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:01:51,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688673814] [2025-01-10 01:01:51,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:51,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:01:51,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:51,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:01:51,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:01:51,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-01-10 01:01:51,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:51,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:51,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-01-10 01:01:51,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:52,027 INFO L124 PetriNetUnfolderBase]: 2041/4488 cut-off events. [2025-01-10 01:01:52,027 INFO L125 PetriNetUnfolderBase]: For 2403/2450 co-relation queries the response was YES. [2025-01-10 01:01:52,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8823 conditions, 4488 events. 2041/4488 cut-off events. For 2403/2450 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 36771 event pairs, 1265 based on Foata normal form. 58/3441 useless extension candidates. Maximal degree in co-relation 5548. Up to 2349 conditions per place. [2025-01-10 01:01:52,045 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 101 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2025-01-10 01:01:52,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 140 transitions, 781 flow [2025-01-10 01:01:52,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:01:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:01:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 320 transitions. [2025-01-10 01:01:52,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.735632183908046 [2025-01-10 01:01:52,046 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 435 flow. Second operand 5 states and 320 transitions. [2025-01-10 01:01:52,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 140 transitions, 781 flow [2025-01-10 01:01:52,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 140 transitions, 764 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:01:52,049 INFO L231 Difference]: Finished difference. Result has 106 places, 101 transitions, 437 flow [2025-01-10 01:01:52,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=437, PETRI_PLACES=106, PETRI_TRANSITIONS=101} [2025-01-10 01:01:52,050 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 22 predicate places. [2025-01-10 01:01:52,050 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 101 transitions, 437 flow [2025-01-10 01:01:52,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:52,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:52,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:52,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:01:52,051 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:52,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash 643505456, now seen corresponding path program 1 times [2025-01-10 01:01:52,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:52,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972665355] [2025-01-10 01:01:52,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:52,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:52,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:01:52,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:01:52,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:52,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972665355] [2025-01-10 01:01:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972665355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:01:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406687194] [2025-01-10 01:01:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:52,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:01:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:52,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:01:52,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:01:52,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-01-10 01:01:52,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 101 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:52,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:52,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-01-10 01:01:52,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:52,512 INFO L124 PetriNetUnfolderBase]: 3037/6589 cut-off events. [2025-01-10 01:01:52,512 INFO L125 PetriNetUnfolderBase]: For 3574/3634 co-relation queries the response was YES. [2025-01-10 01:01:52,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13399 conditions, 6589 events. 3037/6589 cut-off events. For 3574/3634 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 56744 event pairs, 1655 based on Foata normal form. 121/5335 useless extension candidates. Maximal degree in co-relation 10010. Up to 2829 conditions per place. [2025-01-10 01:01:52,586 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 96 selfloop transitions, 15 changer transitions 0/146 dead transitions. [2025-01-10 01:01:52,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 146 transitions, 829 flow [2025-01-10 01:01:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:01:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:01:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2025-01-10 01:01:52,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379310344827587 [2025-01-10 01:01:52,588 INFO L175 Difference]: Start difference. First operand has 106 places, 101 transitions, 437 flow. Second operand 5 states and 321 transitions. [2025-01-10 01:01:52,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 146 transitions, 829 flow [2025-01-10 01:01:52,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 146 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:01:52,592 INFO L231 Difference]: Finished difference. Result has 110 places, 103 transitions, 486 flow [2025-01-10 01:01:52,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=486, PETRI_PLACES=110, PETRI_TRANSITIONS=103} [2025-01-10 01:01:52,593 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 26 predicate places. [2025-01-10 01:01:52,593 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 103 transitions, 486 flow [2025-01-10 01:01:52,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:52,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:52,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:52,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:01:52,594 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:52,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:52,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1361483020, now seen corresponding path program 1 times [2025-01-10 01:01:52,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:52,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025758178] [2025-01-10 01:01:52,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:52,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:52,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:01:52,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:01:52,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:52,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:52,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025758178] [2025-01-10 01:01:52,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025758178] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:52,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739242325] [2025-01-10 01:01:52,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:52,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:52,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:52,744 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-01-10 01:01:52,746 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-01-10 01:01:52,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:01:52,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:01:52,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:52,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:52,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:01:52,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:52,817 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-01-10 01:01:52,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:01:52,848 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-01-10 01:01:52,853 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:01:52,854 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-01-10 01:01:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:52,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:52,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-01-10 01:01:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:52,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739242325] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:52,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:52,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:01:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270314963] [2025-01-10 01:01:52,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:52,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:01:52,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:52,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:01:52,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:01:53,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 87 [2025-01-10 01:01:53,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 103 transitions, 486 flow. Second operand has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:53,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:53,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 87 [2025-01-10 01:01:53,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:54,497 INFO L124 PetriNetUnfolderBase]: 4345/8525 cut-off events. [2025-01-10 01:01:54,497 INFO L125 PetriNetUnfolderBase]: For 5355/5355 co-relation queries the response was YES. [2025-01-10 01:01:54,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18442 conditions, 8525 events. 4345/8525 cut-off events. For 5355/5355 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 69222 event pairs, 1366 based on Foata normal form. 0/7260 useless extension candidates. Maximal degree in co-relation 12759. Up to 2192 conditions per place. [2025-01-10 01:01:54,527 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 112 selfloop transitions, 27 changer transitions 0/172 dead transitions. [2025-01-10 01:01:54,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 172 transitions, 969 flow [2025-01-10 01:01:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:01:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:01:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 514 transitions. [2025-01-10 01:01:54,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6564495530012772 [2025-01-10 01:01:54,532 INFO L175 Difference]: Start difference. First operand has 110 places, 103 transitions, 486 flow. Second operand 9 states and 514 transitions. [2025-01-10 01:01:54,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 172 transitions, 969 flow [2025-01-10 01:01:54,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 172 transitions, 960 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:01:54,539 INFO L231 Difference]: Finished difference. Result has 118 places, 106 transitions, 564 flow [2025-01-10 01:01:54,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=564, PETRI_PLACES=118, PETRI_TRANSITIONS=106} [2025-01-10 01:01:54,540 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 34 predicate places. [2025-01-10 01:01:54,540 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 106 transitions, 564 flow [2025-01-10 01:01:54,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:54,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:54,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:54,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:01:54,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:01:54,741 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:54,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:54,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1361483019, now seen corresponding path program 1 times [2025-01-10 01:01:54,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:54,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053500547] [2025-01-10 01:01:54,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:54,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:54,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:01:54,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:01:54,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:54,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:01:54,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:54,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053500547] [2025-01-10 01:01:54,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053500547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:54,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:54,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:01:54,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801424288] [2025-01-10 01:01:54,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:54,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:01:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:54,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:01:54,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:01:54,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 87 [2025-01-10 01:01:54,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 106 transitions, 564 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:54,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:54,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 87 [2025-01-10 01:01:54,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:55,495 INFO L124 PetriNetUnfolderBase]: 5166/9778 cut-off events. [2025-01-10 01:01:55,496 INFO L125 PetriNetUnfolderBase]: For 8502/8502 co-relation queries the response was YES. [2025-01-10 01:01:55,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22362 conditions, 9778 events. 5166/9778 cut-off events. For 8502/8502 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 78106 event pairs, 3904 based on Foata normal form. 205/8686 useless extension candidates. Maximal degree in co-relation 16119. Up to 7450 conditions per place. [2025-01-10 01:01:55,551 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 60 selfloop transitions, 14 changer transitions 0/102 dead transitions. [2025-01-10 01:01:55,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 102 transitions, 704 flow [2025-01-10 01:01:55,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:01:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:01:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2025-01-10 01:01:55,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5563218390804597 [2025-01-10 01:01:55,555 INFO L175 Difference]: Start difference. First operand has 118 places, 106 transitions, 564 flow. Second operand 5 states and 242 transitions. [2025-01-10 01:01:55,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 102 transitions, 704 flow [2025-01-10 01:01:55,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 102 transitions, 653 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 01:01:55,563 INFO L231 Difference]: Finished difference. Result has 113 places, 102 transitions, 533 flow [2025-01-10 01:01:55,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=533, PETRI_PLACES=113, PETRI_TRANSITIONS=102} [2025-01-10 01:01:55,564 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 29 predicate places. [2025-01-10 01:01:55,564 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 102 transitions, 533 flow [2025-01-10 01:01:55,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:55,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:55,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:55,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:01:55,564 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:55,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1596521001, now seen corresponding path program 1 times [2025-01-10 01:01:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:55,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674186187] [2025-01-10 01:01:55,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:55,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:55,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:01:55,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:01:55,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:55,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:01:55,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:55,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674186187] [2025-01-10 01:01:55,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674186187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:55,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:55,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:01:55,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959392792] [2025-01-10 01:01:55,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:55,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:01:55,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:55,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:01:55,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:01:55,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-01-10 01:01:55,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 102 transitions, 533 flow. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:55,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:55,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-01-10 01:01:55,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:56,130 INFO L124 PetriNetUnfolderBase]: 3445/7076 cut-off events. [2025-01-10 01:01:56,130 INFO L125 PetriNetUnfolderBase]: For 6570/6726 co-relation queries the response was YES. [2025-01-10 01:01:56,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15665 conditions, 7076 events. 3445/7076 cut-off events. For 6570/6726 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 57358 event pairs, 2103 based on Foata normal form. 94/5867 useless extension candidates. Maximal degree in co-relation 10287. Up to 3667 conditions per place. [2025-01-10 01:01:56,153 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 94 selfloop transitions, 15 changer transitions 0/140 dead transitions. [2025-01-10 01:01:56,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 140 transitions, 933 flow [2025-01-10 01:01:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:01:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:01:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2025-01-10 01:01:56,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7218390804597701 [2025-01-10 01:01:56,155 INFO L175 Difference]: Start difference. First operand has 113 places, 102 transitions, 533 flow. Second operand 5 states and 314 transitions. [2025-01-10 01:01:56,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 140 transitions, 933 flow [2025-01-10 01:01:56,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 140 transitions, 913 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:01:56,161 INFO L231 Difference]: Finished difference. Result has 116 places, 104 transitions, 567 flow [2025-01-10 01:01:56,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=567, PETRI_PLACES=116, PETRI_TRANSITIONS=104} [2025-01-10 01:01:56,161 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 32 predicate places. [2025-01-10 01:01:56,161 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 104 transitions, 567 flow [2025-01-10 01:01:56,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:56,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:56,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:56,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:01:56,162 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:56,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:56,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1688142990, now seen corresponding path program 1 times [2025-01-10 01:01:56,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:56,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846618046] [2025-01-10 01:01:56,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:56,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:56,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:01:56,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:01:56,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:56,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846618046] [2025-01-10 01:01:56,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846618046] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648546545] [2025-01-10 01:01:56,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:56,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:56,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:56,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:56,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:01:56,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:01:56,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:01:56,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:56,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:56,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:01:56,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:56,336 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-01-10 01:01:56,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:01:56,366 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-01-10 01:01:56,371 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:01:56,372 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-01-10 01:01:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:56,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:56,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-01-10 01:01:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:56,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648546545] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:56,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:56,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:01:56,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811088461] [2025-01-10 01:01:56,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:56,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:01:56,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:56,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:01:56,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:01:57,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 87 [2025-01-10 01:01:57,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 104 transitions, 567 flow. Second operand has 13 states, 13 states have (on average 45.38461538461539) internal successors, (590), 13 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:57,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:57,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 87 [2025-01-10 01:01:57,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:58,165 INFO L124 PetriNetUnfolderBase]: 6971/13264 cut-off events. [2025-01-10 01:01:58,165 INFO L125 PetriNetUnfolderBase]: For 12939/13443 co-relation queries the response was YES. [2025-01-10 01:01:58,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29568 conditions, 13264 events. 6971/13264 cut-off events. For 12939/13443 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 111127 event pairs, 1847 based on Foata normal form. 0/10969 useless extension candidates. Maximal degree in co-relation 21980. Up to 3826 conditions per place. [2025-01-10 01:01:58,229 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 120 selfloop transitions, 27 changer transitions 0/175 dead transitions. [2025-01-10 01:01:58,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 175 transitions, 1135 flow [2025-01-10 01:01:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:01:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:01:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 503 transitions. [2025-01-10 01:01:58,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424010217113666 [2025-01-10 01:01:58,230 INFO L175 Difference]: Start difference. First operand has 116 places, 104 transitions, 567 flow. Second operand 9 states and 503 transitions. [2025-01-10 01:01:58,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 175 transitions, 1135 flow [2025-01-10 01:01:58,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 175 transitions, 1113 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:01:58,242 INFO L231 Difference]: Finished difference. Result has 123 places, 105 transitions, 617 flow [2025-01-10 01:01:58,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=617, PETRI_PLACES=123, PETRI_TRANSITIONS=105} [2025-01-10 01:01:58,243 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 39 predicate places. [2025-01-10 01:01:58,243 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 105 transitions, 617 flow [2025-01-10 01:01:58,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.38461538461539) internal successors, (590), 13 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:58,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:58,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:58,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:01:58,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:01:58,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:58,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash -792824329, now seen corresponding path program 1 times [2025-01-10 01:01:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:58,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122319491] [2025-01-10 01:01:58,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:58,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:01:58,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:01:58,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:58,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:58,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122319491] [2025-01-10 01:01:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122319491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:58,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:58,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:01:58,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984707009] [2025-01-10 01:01:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:58,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:01:58,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:58,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:01:58,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:01:58,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 87 [2025-01-10 01:01:58,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 105 transitions, 617 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:58,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:58,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 87 [2025-01-10 01:01:58,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:59,267 INFO L124 PetriNetUnfolderBase]: 6718/12947 cut-off events. [2025-01-10 01:01:59,267 INFO L125 PetriNetUnfolderBase]: For 15093/15543 co-relation queries the response was YES. [2025-01-10 01:01:59,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30226 conditions, 12947 events. 6718/12947 cut-off events. For 15093/15543 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 108467 event pairs, 5344 based on Foata normal form. 0/11996 useless extension candidates. Maximal degree in co-relation 22809. Up to 9717 conditions per place. [2025-01-10 01:01:59,308 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 66 selfloop transitions, 9 changer transitions 0/101 dead transitions. [2025-01-10 01:01:59,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 101 transitions, 759 flow [2025-01-10 01:01:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:01:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:01:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-01-10 01:01:59,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5890804597701149 [2025-01-10 01:01:59,310 INFO L175 Difference]: Start difference. First operand has 123 places, 105 transitions, 617 flow. Second operand 4 states and 205 transitions. [2025-01-10 01:01:59,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 101 transitions, 759 flow [2025-01-10 01:01:59,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 101 transitions, 709 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-10 01:01:59,318 INFO L231 Difference]: Finished difference. Result has 116 places, 101 transitions, 577 flow [2025-01-10 01:01:59,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=577, PETRI_PLACES=116, PETRI_TRANSITIONS=101} [2025-01-10 01:01:59,319 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 32 predicate places. [2025-01-10 01:01:59,319 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 101 transitions, 577 flow [2025-01-10 01:01:59,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:59,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:59,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:59,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:01:59,319 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:01:59,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:59,320 INFO L85 PathProgramCache]: Analyzing trace with hash -792824328, now seen corresponding path program 1 times [2025-01-10 01:01:59,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:59,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029778414] [2025-01-10 01:01:59,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:59,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:59,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:01:59,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:01:59,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:59,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:59,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029778414] [2025-01-10 01:01:59,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029778414] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:59,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695836012] [2025-01-10 01:01:59,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:59,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:59,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:59,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:59,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:01:59,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:01:59,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:01:59,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:59,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:59,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:01:59,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:59,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:59,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-01-10 01:01:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:01:59,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695836012] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:59,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:59,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:01:59,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722998602] [2025-01-10 01:01:59,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:59,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:01:59,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:59,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:01:59,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:01:59,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-01-10 01:01:59,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 101 transitions, 577 flow. Second operand has 11 states, 11 states have (on average 49.18181818181818) internal successors, (541), 11 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:59,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:59,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-01-10 01:01:59,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:00,962 INFO L124 PetriNetUnfolderBase]: 6291/11212 cut-off events. [2025-01-10 01:02:00,962 INFO L125 PetriNetUnfolderBase]: For 13263/13674 co-relation queries the response was YES. [2025-01-10 01:02:00,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27167 conditions, 11212 events. 6291/11212 cut-off events. For 13263/13674 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 84965 event pairs, 2100 based on Foata normal form. 0/10265 useless extension candidates. Maximal degree in co-relation 20040. Up to 3122 conditions per place. [2025-01-10 01:02:01,016 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 116 selfloop transitions, 27 changer transitions 0/168 dead transitions. [2025-01-10 01:02:01,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 168 transitions, 1136 flow [2025-01-10 01:02:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:02:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:02:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 437 transitions. [2025-01-10 01:02:01,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7175697865353038 [2025-01-10 01:02:01,018 INFO L175 Difference]: Start difference. First operand has 116 places, 101 transitions, 577 flow. Second operand 7 states and 437 transitions. [2025-01-10 01:02:01,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 168 transitions, 1136 flow [2025-01-10 01:02:01,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 168 transitions, 1126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:02:01,030 INFO L231 Difference]: Finished difference. Result has 121 places, 101 transitions, 637 flow [2025-01-10 01:02:01,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=637, PETRI_PLACES=121, PETRI_TRANSITIONS=101} [2025-01-10 01:02:01,030 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 37 predicate places. [2025-01-10 01:02:01,030 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 101 transitions, 637 flow [2025-01-10 01:02:01,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.18181818181818) internal successors, (541), 11 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:02:01,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:01,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:01,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:02:01,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:01,231 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:02:01,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash 812694378, now seen corresponding path program 1 times [2025-01-10 01:02:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711337571] [2025-01-10 01:02:01,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:01,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:02:01,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:02:01,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:01,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:02:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711337571] [2025-01-10 01:02:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711337571] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:02:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897501750] [2025-01-10 01:02:01,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:01,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:01,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:01,519 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:02:01,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:02:01,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:02:01,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:02:01,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:01,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:01,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:02:01,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:01,597 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-01-10 01:02:01,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:02:01,635 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-01-10 01:02:01,648 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:02:01,649 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-01-10 01:02:01,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:02:01,669 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-01-10 01:02:01,674 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:02:01,674 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-01-10 01:02:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:02:01,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:02:01,850 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 100 treesize of output 96 [2025-01-10 01:02:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:02:02,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897501750] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:02:02,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:02:02,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2025-01-10 01:02:02,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365173875] [2025-01-10 01:02:02,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:02:02,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:02:02,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:02,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:02:02,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:02:03,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 87 [2025-01-10 01:02:03,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 101 transitions, 637 flow. Second operand has 17 states, 17 states have (on average 39.1764705882353) internal successors, (666), 17 states have internal predecessors, (666), 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-01-10 01:02:03,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:03,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 87 [2025-01-10 01:02:03,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:05,295 INFO L124 PetriNetUnfolderBase]: 14507/25066 cut-off events. [2025-01-10 01:02:05,295 INFO L125 PetriNetUnfolderBase]: For 34834/35950 co-relation queries the response was YES. [2025-01-10 01:02:05,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60939 conditions, 25066 events. 14507/25066 cut-off events. For 34834/35950 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 205715 event pairs, 4266 based on Foata normal form. 0/22951 useless extension candidates. Maximal degree in co-relation 52224. Up to 7146 conditions per place. [2025-01-10 01:02:05,452 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 135 selfloop transitions, 27 changer transitions 0/183 dead transitions. [2025-01-10 01:02:05,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 183 transitions, 1349 flow [2025-01-10 01:02:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:02:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:02:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 457 transitions. [2025-01-10 01:02:05,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5836526181353767 [2025-01-10 01:02:05,456 INFO L175 Difference]: Start difference. First operand has 121 places, 101 transitions, 637 flow. Second operand 9 states and 457 transitions. [2025-01-10 01:02:05,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 183 transitions, 1349 flow [2025-01-10 01:02:05,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 183 transitions, 1278 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-10 01:02:05,479 INFO L231 Difference]: Finished difference. Result has 125 places, 102 transitions, 657 flow [2025-01-10 01:02:05,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=657, PETRI_PLACES=125, PETRI_TRANSITIONS=102} [2025-01-10 01:02:05,479 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 41 predicate places. [2025-01-10 01:02:05,479 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 102 transitions, 657 flow [2025-01-10 01:02:05,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 39.1764705882353) internal successors, (666), 17 states have internal predecessors, (666), 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-01-10 01:02:05,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:05,480 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:05,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:02:05,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:05,684 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:02:05,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1729704462, now seen corresponding path program 1 times [2025-01-10 01:02:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:05,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877045331] [2025-01-10 01:02:05,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:05,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:05,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:02:05,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:02:05,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:05,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:02:05,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:05,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877045331] [2025-01-10 01:02:05,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877045331] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:02:05,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533981619] [2025-01-10 01:02:05,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:05,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:05,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:05,745 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:02:05,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:02:05,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:02:05,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:02:05,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:05,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:05,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:02:05,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:02:05,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:02:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:02:05,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533981619] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:02:05,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:02:05,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-01-10 01:02:05,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255982117] [2025-01-10 01:02:05,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:02:05,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:02:05,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:05,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:02:05,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:02:06,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-01-10 01:02:06,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 102 transitions, 657 flow. Second operand has 16 states, 16 states have (on average 51.125) internal successors, (818), 16 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:02:06,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:06,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-01-10 01:02:06,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:09,985 INFO L124 PetriNetUnfolderBase]: 25793/46555 cut-off events. [2025-01-10 01:02:09,986 INFO L125 PetriNetUnfolderBase]: For 71608/74374 co-relation queries the response was YES. [2025-01-10 01:02:10,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118249 conditions, 46555 events. 25793/46555 cut-off events. For 71608/74374 co-relation queries the response was YES. Maximal size of possible extension queue 1824. Compared 447137 event pairs, 9090 based on Foata normal form. 744/45399 useless extension candidates. Maximal degree in co-relation 47879. Up to 11119 conditions per place. [2025-01-10 01:02:10,372 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 289 selfloop transitions, 63 changer transitions 0/379 dead transitions. [2025-01-10 01:02:10,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 379 transitions, 2898 flow [2025-01-10 01:02:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-10 01:02:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-01-10 01:02:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1690 transitions. [2025-01-10 01:02:10,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6698374950455807 [2025-01-10 01:02:10,377 INFO L175 Difference]: Start difference. First operand has 125 places, 102 transitions, 657 flow. Second operand 29 states and 1690 transitions. [2025-01-10 01:02:10,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 379 transitions, 2898 flow [2025-01-10 01:02:10,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 379 transitions, 2777 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-01-10 01:02:10,475 INFO L231 Difference]: Finished difference. Result has 156 places, 147 transitions, 1163 flow [2025-01-10 01:02:10,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1163, PETRI_PLACES=156, PETRI_TRANSITIONS=147} [2025-01-10 01:02:10,475 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 72 predicate places. [2025-01-10 01:02:10,475 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 147 transitions, 1163 flow [2025-01-10 01:02:10,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.125) internal successors, (818), 16 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:02:10,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:10,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:10,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:02:10,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:10,677 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:02:10,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:10,678 INFO L85 PathProgramCache]: Analyzing trace with hash -576277230, now seen corresponding path program 1 times [2025-01-10 01:02:10,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:10,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269616528] [2025-01-10 01:02:10,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:10,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:10,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:02:10,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:02:10,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:10,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:02:10,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:10,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269616528] [2025-01-10 01:02:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269616528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:02:10,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739360162] [2025-01-10 01:02:10,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:10,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:10,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:10,984 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:02:10,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:02:11,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:02:11,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:02:11,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:11,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:11,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:02:11,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:02:11,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:02:11,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-01-10 01:02:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:02:11,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739360162] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:02:11,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:02:11,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:02:11,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033904978] [2025-01-10 01:02:11,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:02:11,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:02:11,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:11,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:02:11,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:02:11,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-01-10 01:02:11,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 147 transitions, 1163 flow. Second operand has 11 states, 11 states have (on average 49.54545454545455) internal successors, (545), 11 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:02:11,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:11,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-01-10 01:02:11,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:15,738 INFO L124 PetriNetUnfolderBase]: 28057/48610 cut-off events. [2025-01-10 01:02:15,738 INFO L125 PetriNetUnfolderBase]: For 101977/106965 co-relation queries the response was YES. [2025-01-10 01:02:15,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127217 conditions, 48610 events. 28057/48610 cut-off events. For 101977/106965 co-relation queries the response was YES. Maximal size of possible extension queue 1948. Compared 449982 event pairs, 9189 based on Foata normal form. 0/47023 useless extension candidates. Maximal degree in co-relation 123782. Up to 12975 conditions per place. [2025-01-10 01:02:16,133 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 169 selfloop transitions, 41 changer transitions 0/235 dead transitions. [2025-01-10 01:02:16,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 235 transitions, 2170 flow [2025-01-10 01:02:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:02:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:02:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 433 transitions. [2025-01-10 01:02:16,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7110016420361248 [2025-01-10 01:02:16,138 INFO L175 Difference]: Start difference. First operand has 156 places, 147 transitions, 1163 flow. Second operand 7 states and 433 transitions. [2025-01-10 01:02:16,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 235 transitions, 2170 flow [2025-01-10 01:02:16,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 235 transitions, 2149 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:02:16,233 INFO L231 Difference]: Finished difference. Result has 160 places, 147 transitions, 1243 flow [2025-01-10 01:02:16,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1243, PETRI_PLACES=160, PETRI_TRANSITIONS=147} [2025-01-10 01:02:16,235 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 76 predicate places. [2025-01-10 01:02:16,235 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 147 transitions, 1243 flow [2025-01-10 01:02:16,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.54545454545455) internal successors, (545), 11 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:02:16,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:16,236 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:16,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:02:16,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 01:02:16,436 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:02:16,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1003586728, now seen corresponding path program 1 times [2025-01-10 01:02:16,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:16,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444424540] [2025-01-10 01:02:16,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:16,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:02:16,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:02:16,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:16,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:02:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444424540] [2025-01-10 01:02:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444424540] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:02:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844194179] [2025-01-10 01:02:16,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:16,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:16,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:16,518 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:02:16,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:02:16,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:02:16,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:02:16,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:16,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:16,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:02:16,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:02:16,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:02:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:02:16,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844194179] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:02:16,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:02:16,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-10 01:02:16,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479786578] [2025-01-10 01:02:16,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:02:16,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:02:16,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:16,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:02:16,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:02:17,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-01-10 01:02:17,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 147 transitions, 1243 flow. Second operand has 16 states, 16 states have (on average 51.3125) internal successors, (821), 16 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:02:17,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:17,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-01-10 01:02:17,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:23,116 INFO L124 PetriNetUnfolderBase]: 38744/69385 cut-off events. [2025-01-10 01:02:23,116 INFO L125 PetriNetUnfolderBase]: For 175904/183960 co-relation queries the response was YES. [2025-01-10 01:02:23,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190172 conditions, 69385 events. 38744/69385 cut-off events. For 175904/183960 co-relation queries the response was YES. Maximal size of possible extension queue 2773. Compared 697733 event pairs, 13550 based on Foata normal form. 1201/68458 useless extension candidates. Maximal degree in co-relation 181906. Up to 18363 conditions per place. [2025-01-10 01:02:23,763 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 287 selfloop transitions, 81 changer transitions 0/395 dead transitions. [2025-01-10 01:02:23,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 395 transitions, 3530 flow [2025-01-10 01:02:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 01:02:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-10 01:02:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1366 transitions. [2025-01-10 01:02:23,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6826586706646677 [2025-01-10 01:02:23,769 INFO L175 Difference]: Start difference. First operand has 160 places, 147 transitions, 1243 flow. Second operand 23 states and 1366 transitions. [2025-01-10 01:02:23,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 395 transitions, 3530 flow [2025-01-10 01:02:23,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 395 transitions, 3392 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-01-10 01:02:23,972 INFO L231 Difference]: Finished difference. Result has 183 places, 167 transitions, 1590 flow [2025-01-10 01:02:23,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1590, PETRI_PLACES=183, PETRI_TRANSITIONS=167} [2025-01-10 01:02:23,972 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 99 predicate places. [2025-01-10 01:02:23,972 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 167 transitions, 1590 flow [2025-01-10 01:02:23,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.3125) internal successors, (821), 16 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:02:23,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:23,973 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:23,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:02:24,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:02:24,173 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:02:24,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash -889850928, now seen corresponding path program 1 times [2025-01-10 01:02:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:24,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610060587] [2025-01-10 01:02:24,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:24,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:02:24,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:02:24,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:24,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:02:24,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:24,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610060587] [2025-01-10 01:02:24,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610060587] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:02:24,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900873588] [2025-01-10 01:02:24,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:24,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:24,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:24,243 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:02:24,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:02:24,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:02:24,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:02:24,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:24,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:24,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:02:24,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:02:24,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:02:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:02:24,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900873588] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:02:24,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:02:24,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-01-10 01:02:24,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464397245] [2025-01-10 01:02:24,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:02:24,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:02:24,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:24,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:02:24,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:02:24,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-01-10 01:02:24,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 167 transitions, 1590 flow. Second operand has 16 states, 16 states have (on average 51.625) internal successors, (826), 16 states have internal predecessors, (826), 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-01-10 01:02:24,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:24,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-01-10 01:02:24,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:29,821 INFO L124 PetriNetUnfolderBase]: 30931/55981 cut-off events. [2025-01-10 01:02:29,821 INFO L125 PetriNetUnfolderBase]: For 169758/177257 co-relation queries the response was YES. [2025-01-10 01:02:30,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158642 conditions, 55981 events. 30931/55981 cut-off events. For 169758/177257 co-relation queries the response was YES. Maximal size of possible extension queue 2301. Compared 551986 event pairs, 12738 based on Foata normal form. 863/55338 useless extension candidates. Maximal degree in co-relation 150784. Up to 16043 conditions per place. [2025-01-10 01:02:30,230 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 298 selfloop transitions, 83 changer transitions 0/408 dead transitions. [2025-01-10 01:02:30,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 408 transitions, 4014 flow [2025-01-10 01:02:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:02:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 01:02:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1257 transitions. [2025-01-10 01:02:30,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6880131362889984 [2025-01-10 01:02:30,233 INFO L175 Difference]: Start difference. First operand has 183 places, 167 transitions, 1590 flow. Second operand 21 states and 1257 transitions. [2025-01-10 01:02:30,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 408 transitions, 4014 flow [2025-01-10 01:02:30,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 408 transitions, 3947 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 01:02:30,422 INFO L231 Difference]: Finished difference. Result has 201 places, 179 transitions, 1862 flow [2025-01-10 01:02:30,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1862, PETRI_PLACES=201, PETRI_TRANSITIONS=179} [2025-01-10 01:02:30,422 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 117 predicate places. [2025-01-10 01:02:30,423 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 179 transitions, 1862 flow [2025-01-10 01:02:30,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.625) internal successors, (826), 16 states have internal predecessors, (826), 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-01-10 01:02:30,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:30,423 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:30,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:02:30,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:30,624 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:02:30,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:30,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1647607707, now seen corresponding path program 2 times [2025-01-10 01:02:30,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:30,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844386923] [2025-01-10 01:02:30,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:02:30,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:30,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:02:30,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:02:30,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:02:30,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:02:31,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:31,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844386923] [2025-01-10 01:02:31,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844386923] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:02:31,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444019228] [2025-01-10 01:02:31,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:02:31,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:31,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:31,169 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:02:31,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:02:31,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:02:31,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:02:31,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:02:31,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:31,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 01:02:31,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:31,259 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-01-10 01:02:31,339 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:02:31,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-10 01:02:31,361 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 01:02:31,362 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 17 treesize of output 21 [2025-01-10 01:02:31,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:02:31,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-01-10 01:02:31,440 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-10 01:02:31,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 01:02:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:02:31,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:02:31,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2025-01-10 01:02:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:02:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444019228] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:02:32,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:02:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2025-01-10 01:02:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483908832] [2025-01-10 01:02:32,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:02:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:02:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:32,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:02:32,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:02:37,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 87 [2025-01-10 01:02:37,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 179 transitions, 1862 flow. Second operand has 26 states, 26 states have (on average 37.03846153846154) internal successors, (963), 26 states have internal predecessors, (963), 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-01-10 01:02:37,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:37,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 87 [2025-01-10 01:02:37,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand