./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-two-queue.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 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:43:54,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:43:54,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:43:54,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:43:54,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:43:54,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:43:54,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:43:54,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:43:54,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:43:54,578 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:43:54,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:43:54,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:43:54,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:43:54,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:43:54,579 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:43:54,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:43:54,580 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:43:54,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:43:54,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:43:54,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:43:54,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:43:54,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:43:54,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:43:54,581 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2025-02-08 08:43:54,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:43:54,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:43:54,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:43:54,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:43:54,952 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:43:54,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-02-08 08:43:56,076 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5adb00f6c/17de7961604d488aacaceafbbbda231d/FLAGb4c88cd7d [2025-02-08 08:43:56,281 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:43:56,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-02-08 08:43:56,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5adb00f6c/17de7961604d488aacaceafbbbda231d/FLAGb4c88cd7d [2025-02-08 08:43:56,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5adb00f6c/17de7961604d488aacaceafbbbda231d [2025-02-08 08:43:56,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:43:56,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:43:56,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:43:56,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:43:56,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:43:56,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1338f8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56, skipping insertion in model container [2025-02-08 08:43:56,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:43:56,445 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:43:56,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:43:56,460 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:43:56,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:43:56,493 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:43:56,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56 WrapperNode [2025-02-08 08:43:56,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:43:56,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:43:56,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:43:56,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:43:56,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,526 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 188 [2025-02-08 08:43:56,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:43:56,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:43:56,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:43:56,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:43:56,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,550 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-08 08:43:56,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:43:56,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:43:56,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:43:56,566 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:43:56,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (1/1) ... [2025-02-08 08:43:56,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:43:56,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:43:56,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:43:56,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:43:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:43:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:43:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:43:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:43:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:43:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:43:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:43:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:43:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:43:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:43:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:43:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:43:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:43:56,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:43:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:43:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:43:56,621 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:43:56,706 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:43:56,707 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:43:56,980 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:43:56,981 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:43:57,240 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:43:57,241 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:43:57,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:43:57 BoogieIcfgContainer [2025-02-08 08:43:57,241 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:43:57,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:43:57,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:43:57,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:43:57,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:43:56" (1/3) ... [2025-02-08 08:43:57,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e166402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:43:57, skipping insertion in model container [2025-02-08 08:43:57,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:56" (2/3) ... [2025-02-08 08:43:57,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e166402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:43:57, skipping insertion in model container [2025-02-08 08:43:57,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:43:57" (3/3) ... [2025-02-08 08:43:57,250 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2025-02-08 08:43:57,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:43:57,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-two-queue.wvr.c that has 3 procedures, 41 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-02-08 08:43:57,265 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:43:57,319 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:43:57,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 102 flow [2025-02-08 08:43:57,374 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2025-02-08 08:43:57,377 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:43:57,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 42 events. 4/42 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 91 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-02-08 08:43:57,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 44 transitions, 102 flow [2025-02-08 08:43:57,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 41 transitions, 94 flow [2025-02-08 08:43:57,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:43:57,398 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;@480820fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:43:57,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-08 08:43:57,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:43:57,403 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:43:57,403 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:43:57,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:57,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:43:57,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:43:57,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 540297, now seen corresponding path program 1 times [2025-02-08 08:43:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:57,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582078430] [2025-02-08 08:43:57,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:57,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:57,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:43:57,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:43:57,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:43:57,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:43:57,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:57,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582078430] [2025-02-08 08:43:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582078430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:57,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:57,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:43:57,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759840607] [2025-02-08 08:43:57,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:57,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:43:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:57,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:43:57,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:43:57,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 08:43:57,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:43:57,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:57,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 08:43:57,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:57,823 INFO L124 PetriNetUnfolderBase]: 359/589 cut-off events. [2025-02-08 08:43:57,824 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 08:43:57,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 589 events. 359/589 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2759 event pairs, 219 based on Foata normal form. 1/352 useless extension candidates. Maximal degree in co-relation 1090. Up to 544 conditions per place. [2025-02-08 08:43:57,833 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 28 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-02-08 08:43:57,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 146 flow [2025-02-08 08:43:57,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:43:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:43:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-02-08 08:43:57,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-02-08 08:43:57,846 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 94 flow. Second operand 3 states and 63 transitions. [2025-02-08 08:43:57,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 146 flow [2025-02-08 08:43:57,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:43:57,853 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 82 flow [2025-02-08 08:43:57,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-02-08 08:43:57,857 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2025-02-08 08:43:57,859 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 82 flow [2025-02-08 08:43:57,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:43:57,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:57,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:43:57,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:43:57,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:43:57,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:57,860 INFO L85 PathProgramCache]: Analyzing trace with hash 540298, now seen corresponding path program 1 times [2025-02-08 08:43:57,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:57,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319640548] [2025-02-08 08:43:57,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:57,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:57,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:43:57,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:43:57,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:43:57,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:43:58,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:58,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319640548] [2025-02-08 08:43:58,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319640548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:58,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:58,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:43:58,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445265666] [2025-02-08 08:43:58,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:58,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:43:58,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:58,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:43:58,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:43:58,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 08:43:58,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:43:58,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:58,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 08:43:58,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:58,262 INFO L124 PetriNetUnfolderBase]: 360/592 cut-off events. [2025-02-08 08:43:58,263 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:43:58,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 592 events. 360/592 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2803 event pairs, 219 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 1132. Up to 553 conditions per place. [2025-02-08 08:43:58,266 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 31 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-02-08 08:43:58,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 158 flow [2025-02-08 08:43:58,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:43:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:43:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-02-08 08:43:58,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-02-08 08:43:58,267 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 82 flow. Second operand 4 states and 76 transitions. [2025-02-08 08:43:58,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 158 flow [2025-02-08 08:43:58,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:43:58,269 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 105 flow [2025-02-08 08:43:58,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2025-02-08 08:43:58,270 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2025-02-08 08:43:58,270 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 105 flow [2025-02-08 08:43:58,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:43:58,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:58,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:43:58,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:43:58,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:43:58,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 16750369, now seen corresponding path program 1 times [2025-02-08 08:43:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316898634] [2025-02-08 08:43:58,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:58,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:43:58,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:43:58,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:43:58,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:43:58,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:58,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316898634] [2025-02-08 08:43:58,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316898634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:58,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:58,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:43:58,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90872097] [2025-02-08 08:43:58,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:58,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:43:58,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:58,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:43:58,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:43:58,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 08:43:58,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:43:58,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:58,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 08:43:58,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:58,619 INFO L124 PetriNetUnfolderBase]: 361/595 cut-off events. [2025-02-08 08:43:58,620 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:43:58,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 595 events. 361/595 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2811 event pairs, 219 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 1153. Up to 552 conditions per place. [2025-02-08 08:43:58,623 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 31 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2025-02-08 08:43:58,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 187 flow [2025-02-08 08:43:58,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:43:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:43:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-02-08 08:43:58,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40454545454545454 [2025-02-08 08:43:58,624 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 105 flow. Second operand 5 states and 89 transitions. [2025-02-08 08:43:58,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 187 flow [2025-02-08 08:43:58,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:43:58,626 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 139 flow [2025-02-08 08:43:58,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-02-08 08:43:58,627 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2025-02-08 08:43:58,627 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 139 flow [2025-02-08 08:43:58,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:43:58,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:58,627 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:43:58,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:43:58,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:43:58,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:58,628 INFO L85 PathProgramCache]: Analyzing trace with hash 519243892, now seen corresponding path program 1 times [2025-02-08 08:43:58,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:58,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27105464] [2025-02-08 08:43:58,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:58,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:58,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:43:58,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:43:58,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:43:58,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:43:58,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27105464] [2025-02-08 08:43:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27105464] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:43:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462363803] [2025-02-08 08:43:58,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:58,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:43:58,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:43:58,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:43:58,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:43:58,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:43:58,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:43:58,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:43:58,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:58,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:43:58,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:43:58,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-08 08:43:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:43:59,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:43:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:43:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462363803] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:43:59,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:43:59,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:43:59,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094180780] [2025-02-08 08:43:59,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:43:59,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:43:59,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:59,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:43:59,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:43:59,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 08:43:59,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 139 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:43:59,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:59,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 08:43:59,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:59,564 INFO L124 PetriNetUnfolderBase]: 361/594 cut-off events. [2025-02-08 08:43:59,564 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:43:59,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 594 events. 361/594 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2820 event pairs, 219 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1163. Up to 552 conditions per place. [2025-02-08 08:43:59,568 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 30 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2025-02-08 08:43:59,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 209 flow [2025-02-08 08:43:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:43:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:43:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2025-02-08 08:43:59,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35984848484848486 [2025-02-08 08:43:59,572 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 139 flow. Second operand 6 states and 95 transitions. [2025-02-08 08:43:59,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 209 flow [2025-02-08 08:43:59,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:43:59,575 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 148 flow [2025-02-08 08:43:59,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-02-08 08:43:59,576 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-02-08 08:43:59,577 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 148 flow [2025-02-08 08:43:59,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:43:59,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:59,577 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:43:59,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:43:59,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:43:59,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:43:59,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1082747138, now seen corresponding path program 1 times [2025-02-08 08:43:59,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:59,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063414210] [2025-02-08 08:43:59,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:59,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:59,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:43:59,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:43:59,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:43:59,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:43:59,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:59,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063414210] [2025-02-08 08:43:59,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063414210] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:43:59,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839188363] [2025-02-08 08:43:59,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:59,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:43:59,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:43:59,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:43:59,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:44:00,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:44:00,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:44:00,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:00,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:00,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:44:00,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:44:00,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:44:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:44:00,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:44:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:44:00,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839188363] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:44:00,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:44:00,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 08:44:00,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777772710] [2025-02-08 08:44:00,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:44:00,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:44:00,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:00,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:44:00,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:44:00,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 08:44:00,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 148 flow. Second operand has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:00,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:00,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 08:44:00,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:00,671 INFO L124 PetriNetUnfolderBase]: 363/599 cut-off events. [2025-02-08 08:44:00,671 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 08:44:00,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 599 events. 363/599 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2846 event pairs, 219 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1171. Up to 545 conditions per place. [2025-02-08 08:44:00,674 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 24 selfloop transitions, 18 changer transitions 0/47 dead transitions. [2025-02-08 08:44:00,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 261 flow [2025-02-08 08:44:00,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:44:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:44:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2025-02-08 08:44:00,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3383838383838384 [2025-02-08 08:44:00,675 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 148 flow. Second operand 9 states and 134 transitions. [2025-02-08 08:44:00,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 261 flow [2025-02-08 08:44:00,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 214 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-02-08 08:44:00,677 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 166 flow [2025-02-08 08:44:00,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=166, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2025-02-08 08:44:00,677 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-02-08 08:44:00,678 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 166 flow [2025-02-08 08:44:00,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:00,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:00,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:00,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:44:00,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:44:00,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:00,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash 796676042, now seen corresponding path program 1 times [2025-02-08 08:44:00,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:00,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308775324] [2025-02-08 08:44:00,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:00,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:44:00,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:44:00,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:00,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:44:00,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:00,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308775324] [2025-02-08 08:44:00,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308775324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:44:00,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:44:00,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:44:00,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112337391] [2025-02-08 08:44:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:44:00,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:44:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:00,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:44:00,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:44:00,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 08:44:00,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:00,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:00,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 08:44:00,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:01,027 INFO L124 PetriNetUnfolderBase]: 285/482 cut-off events. [2025-02-08 08:44:01,027 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:44:01,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 482 events. 285/482 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2176 event pairs, 171 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 910. Up to 431 conditions per place. [2025-02-08 08:44:01,029 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 36 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-02-08 08:44:01,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 242 flow [2025-02-08 08:44:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:44:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:44:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-02-08 08:44:01,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2025-02-08 08:44:01,030 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 166 flow. Second operand 4 states and 70 transitions. [2025-02-08 08:44:01,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 242 flow [2025-02-08 08:44:01,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 209 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-02-08 08:44:01,033 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 137 flow [2025-02-08 08:44:01,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2025-02-08 08:44:01,033 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2025-02-08 08:44:01,033 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 137 flow [2025-02-08 08:44:01,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:01,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:01,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:01,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:44:01,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:01,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:01,034 INFO L85 PathProgramCache]: Analyzing trace with hash 796676043, now seen corresponding path program 1 times [2025-02-08 08:44:01,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:01,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529447059] [2025-02-08 08:44:01,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:01,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:01,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:44:01,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:44:01,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:01,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:44:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529447059] [2025-02-08 08:44:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529447059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:44:01,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:44:01,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:44:01,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935440793] [2025-02-08 08:44:01,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:44:01,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:44:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:01,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:44:01,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:44:01,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-02-08 08:44:01,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:01,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:01,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-02-08 08:44:01,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:01,198 INFO L124 PetriNetUnfolderBase]: 307/543 cut-off events. [2025-02-08 08:44:01,199 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:44:01,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 543 events. 307/543 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2562 event pairs, 194 based on Foata normal form. 16/389 useless extension candidates. Maximal degree in co-relation 900. Up to 443 conditions per place. [2025-02-08 08:44:01,203 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 46 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2025-02-08 08:44:01,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 269 flow [2025-02-08 08:44:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:44:01,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:44:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-02-08 08:44:01,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5397727272727273 [2025-02-08 08:44:01,205 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 137 flow. Second operand 4 states and 95 transitions. [2025-02-08 08:44:01,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 269 flow [2025-02-08 08:44:01,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:44:01,230 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 151 flow [2025-02-08 08:44:01,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-02-08 08:44:01,231 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2025-02-08 08:44:01,231 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 151 flow [2025-02-08 08:44:01,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:01,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:01,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:01,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:44:01,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:01,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:01,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1063329590, now seen corresponding path program 1 times [2025-02-08 08:44:01,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251166143] [2025-02-08 08:44:01,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:01,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:44:01,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:44:01,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:01,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:44:01,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:01,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251166143] [2025-02-08 08:44:01,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251166143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:44:01,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:44:01,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:44:01,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102632172] [2025-02-08 08:44:01,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:44:01,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:44:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:01,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:44:01,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:44:01,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-02-08 08:44:01,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:01,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:01,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-02-08 08:44:01,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:01,407 INFO L124 PetriNetUnfolderBase]: 336/642 cut-off events. [2025-02-08 08:44:01,407 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-08 08:44:01,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 642 events. 336/642 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3362 event pairs, 222 based on Foata normal form. 12/472 useless extension candidates. Maximal degree in co-relation 1022. Up to 499 conditions per place. [2025-02-08 08:44:01,410 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 54 selfloop transitions, 5 changer transitions 1/65 dead transitions. [2025-02-08 08:44:01,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 345 flow [2025-02-08 08:44:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:44:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:44:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-02-08 08:44:01,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5181818181818182 [2025-02-08 08:44:01,411 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 151 flow. Second operand 5 states and 114 transitions. [2025-02-08 08:44:01,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 345 flow [2025-02-08 08:44:01,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:44:01,413 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 191 flow [2025-02-08 08:44:01,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-02-08 08:44:01,414 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2025-02-08 08:44:01,414 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 191 flow [2025-02-08 08:44:01,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:01,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:01,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:01,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:44:01,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:01,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:01,415 INFO L85 PathProgramCache]: Analyzing trace with hash -912955698, now seen corresponding path program 1 times [2025-02-08 08:44:01,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:01,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793693054] [2025-02-08 08:44:01,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:01,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:01,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:44:01,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:44:01,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:01,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:44:01,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:01,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793693054] [2025-02-08 08:44:01,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793693054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:44:01,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:44:01,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:44:01,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886841029] [2025-02-08 08:44:01,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:44:01,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:44:01,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:01,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:44:01,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:44:01,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-02-08 08:44:01,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:01,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:01,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-02-08 08:44:01,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:01,653 INFO L124 PetriNetUnfolderBase]: 262/525 cut-off events. [2025-02-08 08:44:01,653 INFO L125 PetriNetUnfolderBase]: For 97/145 co-relation queries the response was YES. [2025-02-08 08:44:01,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 525 events. 262/525 cut-off events. For 97/145 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2677 event pairs, 174 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 1053. Up to 448 conditions per place. [2025-02-08 08:44:01,656 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 33 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2025-02-08 08:44:01,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 263 flow [2025-02-08 08:44:01,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:44:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:44:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-02-08 08:44:01,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-02-08 08:44:01,657 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 191 flow. Second operand 4 states and 76 transitions. [2025-02-08 08:44:01,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 263 flow [2025-02-08 08:44:01,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:44:01,658 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 192 flow [2025-02-08 08:44:01,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-02-08 08:44:01,659 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2025-02-08 08:44:01,659 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 192 flow [2025-02-08 08:44:01,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:01,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:01,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:01,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:44:01,659 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:01,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:01,660 INFO L85 PathProgramCache]: Analyzing trace with hash 633557408, now seen corresponding path program 1 times [2025-02-08 08:44:01,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:01,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489111660] [2025-02-08 08:44:01,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:01,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:01,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:44:01,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:44:01,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:01,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:44:01,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489111660] [2025-02-08 08:44:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489111660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:44:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309006446] [2025-02-08 08:44:01,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:01,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:44:01,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:44:01,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:44:01,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:44:01,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:44:01,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:44:01,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:01,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:01,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:44:01,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:44:01,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:44:01,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:44:01,975 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 18 treesize of output 13 [2025-02-08 08:44:01,987 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:44:01,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:44:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:44:02,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:44:02,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309006446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:44:02,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:44:02,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-02-08 08:44:02,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563982555] [2025-02-08 08:44:02,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:44:02,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:44:02,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:02,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:44:02,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:44:02,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 08:44:02,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:02,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:02,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 08:44:02,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:02,128 INFO L124 PetriNetUnfolderBase]: 198/423 cut-off events. [2025-02-08 08:44:02,128 INFO L125 PetriNetUnfolderBase]: For 87/111 co-relation queries the response was YES. [2025-02-08 08:44:02,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 423 events. 198/423 cut-off events. For 87/111 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2084 event pairs, 132 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 648. Up to 365 conditions per place. [2025-02-08 08:44:02,130 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 34 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2025-02-08 08:44:02,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 260 flow [2025-02-08 08:44:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:44:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:44:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-02-08 08:44:02,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-02-08 08:44:02,131 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 192 flow. Second operand 4 states and 66 transitions. [2025-02-08 08:44:02,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 260 flow [2025-02-08 08:44:02,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:44:02,132 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 182 flow [2025-02-08 08:44:02,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2025-02-08 08:44:02,133 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-02-08 08:44:02,133 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 182 flow [2025-02-08 08:44:02,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:02,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:02,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:02,143 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-02-08 08:44:02,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:44:02,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:02,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash 633557407, now seen corresponding path program 1 times [2025-02-08 08:44:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:02,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213268222] [2025-02-08 08:44:02,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:02,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:02,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:44:02,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:44:02,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:02,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:44:02,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:02,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213268222] [2025-02-08 08:44:02,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213268222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:44:02,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:44:02,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:44:02,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045159045] [2025-02-08 08:44:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:44:02,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:44:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:02,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:44:02,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:44:02,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 08:44:02,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:02,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:02,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 08:44:02,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:02,451 INFO L124 PetriNetUnfolderBase]: 144/335 cut-off events. [2025-02-08 08:44:02,452 INFO L125 PetriNetUnfolderBase]: For 75/83 co-relation queries the response was YES. [2025-02-08 08:44:02,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 335 events. 144/335 cut-off events. For 75/83 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1601 event pairs, 96 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 544. Up to 266 conditions per place. [2025-02-08 08:44:02,453 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 28 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2025-02-08 08:44:02,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 246 flow [2025-02-08 08:44:02,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:44:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:44:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-02-08 08:44:02,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2025-02-08 08:44:02,454 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 182 flow. Second operand 5 states and 74 transitions. [2025-02-08 08:44:02,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 246 flow [2025-02-08 08:44:02,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:44:02,456 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 185 flow [2025-02-08 08:44:02,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=185, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-02-08 08:44:02,456 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-02-08 08:44:02,456 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 185 flow [2025-02-08 08:44:02,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:02,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:02,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:02,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:44:02,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:02,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:02,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1669966763, now seen corresponding path program 1 times [2025-02-08 08:44:02,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:02,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395016400] [2025-02-08 08:44:02,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:02,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:02,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:44:02,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:44:02,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:02,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:44:02,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:02,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395016400] [2025-02-08 08:44:02,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395016400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:44:02,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:44:02,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:44:02,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301049938] [2025-02-08 08:44:02,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:44:02,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:44:02,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:02,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:44:02,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:44:02,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-02-08 08:44:02,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:02,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:02,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-02-08 08:44:02,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:02,555 INFO L124 PetriNetUnfolderBase]: 180/397 cut-off events. [2025-02-08 08:44:02,555 INFO L125 PetriNetUnfolderBase]: For 93/101 co-relation queries the response was YES. [2025-02-08 08:44:02,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 397 events. 180/397 cut-off events. For 93/101 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1935 event pairs, 61 based on Foata normal form. 4/381 useless extension candidates. Maximal degree in co-relation 708. Up to 181 conditions per place. [2025-02-08 08:44:02,557 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 39 selfloop transitions, 3 changer transitions 5/52 dead transitions. [2025-02-08 08:44:02,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 312 flow [2025-02-08 08:44:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:44:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:44:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-02-08 08:44:02,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-02-08 08:44:02,558 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 185 flow. Second operand 3 states and 70 transitions. [2025-02-08 08:44:02,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 312 flow [2025-02-08 08:44:02,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 300 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:44:02,559 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 155 flow [2025-02-08 08:44:02,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-02-08 08:44:02,560 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-02-08 08:44:02,560 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 155 flow [2025-02-08 08:44:02,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:02,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:02,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:02,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:44:02,560 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:02,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1967294551, now seen corresponding path program 1 times [2025-02-08 08:44:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:02,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126808035] [2025-02-08 08:44:02,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:02,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:44:02,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:44:02,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:02,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:44:02,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126808035] [2025-02-08 08:44:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126808035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:44:02,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:44:02,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:44:02,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577926700] [2025-02-08 08:44:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:44:02,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:44:02,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:02,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:44:02,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:44:02,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-02-08 08:44:02,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:02,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:02,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-02-08 08:44:02,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:02,645 INFO L124 PetriNetUnfolderBase]: 107/218 cut-off events. [2025-02-08 08:44:02,646 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-02-08 08:44:02,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 218 events. 107/218 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 749 event pairs, 22 based on Foata normal form. 6/212 useless extension candidates. Maximal degree in co-relation 521. Up to 143 conditions per place. [2025-02-08 08:44:02,647 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 37 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2025-02-08 08:44:02,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 257 flow [2025-02-08 08:44:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:44:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:44:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-02-08 08:44:02,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:44:02,648 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 155 flow. Second operand 3 states and 66 transitions. [2025-02-08 08:44:02,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 257 flow [2025-02-08 08:44:02,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 252 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:44:02,649 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 164 flow [2025-02-08 08:44:02,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2025-02-08 08:44:02,649 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2025-02-08 08:44:02,650 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 164 flow [2025-02-08 08:44:02,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:02,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:02,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:02,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:44:02,650 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:02,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash -833629337, now seen corresponding path program 1 times [2025-02-08 08:44:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:02,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867265721] [2025-02-08 08:44:02,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:02,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:02,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:44:02,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:44:02,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:02,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:44:02,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:02,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867265721] [2025-02-08 08:44:02,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867265721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:44:02,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:44:02,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:44:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345662984] [2025-02-08 08:44:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:44:02,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:44:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:02,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:44:02,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:44:02,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-02-08 08:44:02,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:02,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:02,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-02-08 08:44:02,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:02,747 INFO L124 PetriNetUnfolderBase]: 82/178 cut-off events. [2025-02-08 08:44:02,747 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-02-08 08:44:02,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 178 events. 82/178 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 502 event pairs, 27 based on Foata normal form. 5/173 useless extension candidates. Maximal degree in co-relation 439. Up to 112 conditions per place. [2025-02-08 08:44:02,748 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 38 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2025-02-08 08:44:02,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 280 flow [2025-02-08 08:44:02,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:44:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:44:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-02-08 08:44:02,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-02-08 08:44:02,749 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 164 flow. Second operand 3 states and 68 transitions. [2025-02-08 08:44:02,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 280 flow [2025-02-08 08:44:02,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 273 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 08:44:02,750 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 174 flow [2025-02-08 08:44:02,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-02-08 08:44:02,751 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-02-08 08:44:02,751 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 174 flow [2025-02-08 08:44:02,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:02,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:02,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:02,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:44:02,751 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:02,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:02,752 INFO L85 PathProgramCache]: Analyzing trace with hash -317011860, now seen corresponding path program 1 times [2025-02-08 08:44:02,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:02,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929242409] [2025-02-08 08:44:02,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:02,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:02,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:44:02,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:44:02,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:02,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:44:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:03,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929242409] [2025-02-08 08:44:03,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929242409] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:44:03,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412202441] [2025-02-08 08:44:03,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:44:03,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:44:03,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:44:03,889 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:44:03,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:44:03,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:44:03,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:44:03,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:44:03,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:03,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 08:44:03,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:44:03,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:44:04,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-02-08 08:44:04,060 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:44:04,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:44:04,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:44:04,594 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-08 08:44:04,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 20 [2025-02-08 08:44:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:44:04,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:44:05,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:44:05,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 109 treesize of output 73 [2025-02-08 08:44:06,025 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2025-02-08 08:44:06,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 183 [2025-02-08 08:44:06,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:44:06,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 133 [2025-02-08 08:44:08,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:44:08,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 109 treesize of output 73 [2025-02-08 08:44:08,452 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2025-02-08 08:44:08,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 182 [2025-02-08 08:44:08,461 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 08:44:08,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:44:08,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 125 [2025-02-08 08:44:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:44:09,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412202441] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:44:09,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:44:09,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2025-02-08 08:44:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579871315] [2025-02-08 08:44:09,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:44:09,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 08:44:09,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:09,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 08:44:09,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1561, Unknown=2, NotChecked=0, Total=1722 [2025-02-08 08:44:10,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2025-02-08 08:44:10,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 174 flow. Second operand has 42 states, 42 states have (on average 6.642857142857143) internal successors, (279), 42 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:10,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:10,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2025-02-08 08:44:10,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:18,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 08:44:20,602 INFO L124 PetriNetUnfolderBase]: 636/1178 cut-off events. [2025-02-08 08:44:20,602 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2025-02-08 08:44:20,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 1178 events. 636/1178 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5708 event pairs, 45 based on Foata normal form. 3/1020 useless extension candidates. Maximal degree in co-relation 2905. Up to 218 conditions per place. [2025-02-08 08:44:20,608 INFO L140 encePairwiseOnDemand]: 26/44 looper letters, 139 selfloop transitions, 123 changer transitions 35/300 dead transitions. [2025-02-08 08:44:20,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 300 transitions, 1676 flow [2025-02-08 08:44:20,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-08 08:44:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-02-08 08:44:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 569 transitions. [2025-02-08 08:44:20,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23947811447811448 [2025-02-08 08:44:20,612 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 174 flow. Second operand 54 states and 569 transitions. [2025-02-08 08:44:20,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 300 transitions, 1676 flow [2025-02-08 08:44:20,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 300 transitions, 1651 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-02-08 08:44:20,617 INFO L231 Difference]: Finished difference. Result has 134 places, 159 transitions, 1230 flow [2025-02-08 08:44:20,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1230, PETRI_PLACES=134, PETRI_TRANSITIONS=159} [2025-02-08 08:44:20,618 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 90 predicate places. [2025-02-08 08:44:20,618 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 159 transitions, 1230 flow [2025-02-08 08:44:20,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.642857142857143) internal successors, (279), 42 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:20,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:20,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:20,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:44:20,823 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,SelfDestructingSolverStorable14 [2025-02-08 08:44:20,823 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:20,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:20,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1237277930, now seen corresponding path program 2 times [2025-02-08 08:44:20,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:20,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141468583] [2025-02-08 08:44:20,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:44:20,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:20,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 08:44:20,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:44:20,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:44:20,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:44:21,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:21,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141468583] [2025-02-08 08:44:21,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141468583] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:44:21,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162375159] [2025-02-08 08:44:21,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:44:21,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:44:21,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:44:21,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:44:21,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:44:21,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 08:44:21,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:44:21,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:44:21,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:21,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 08:44:21,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:44:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:44:22,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:44:22,500 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2025-02-08 08:44:22,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 105 [2025-02-08 08:44:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:44:23,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162375159] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:44:23,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:44:23,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2025-02-08 08:44:23,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707353137] [2025-02-08 08:44:23,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:44:23,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-08 08:44:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:23,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-08 08:44:23,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 08:44:23,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 08:44:23,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 159 transitions, 1230 flow. Second operand has 39 states, 39 states have (on average 11.76923076923077) internal successors, (459), 39 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:23,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:23,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 08:44:23,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:25,624 INFO L124 PetriNetUnfolderBase]: 956/1752 cut-off events. [2025-02-08 08:44:25,625 INFO L125 PetriNetUnfolderBase]: For 16196/16196 co-relation queries the response was YES. [2025-02-08 08:44:25,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9160 conditions, 1752 events. 956/1752 cut-off events. For 16196/16196 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9515 event pairs, 65 based on Foata normal form. 25/1773 useless extension candidates. Maximal degree in co-relation 8922. Up to 433 conditions per place. [2025-02-08 08:44:25,637 INFO L140 encePairwiseOnDemand]: 28/44 looper letters, 216 selfloop transitions, 177 changer transitions 21/417 dead transitions. [2025-02-08 08:44:25,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 417 transitions, 4038 flow [2025-02-08 08:44:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-08 08:44:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-02-08 08:44:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 724 transitions. [2025-02-08 08:44:25,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35009671179883944 [2025-02-08 08:44:25,639 INFO L175 Difference]: Start difference. First operand has 134 places, 159 transitions, 1230 flow. Second operand 47 states and 724 transitions. [2025-02-08 08:44:25,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 417 transitions, 4038 flow [2025-02-08 08:44:25,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 417 transitions, 3756 flow, removed 140 selfloop flow, removed 2 redundant places. [2025-02-08 08:44:25,676 INFO L231 Difference]: Finished difference. Result has 185 places, 271 transitions, 2535 flow [2025-02-08 08:44:25,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=2535, PETRI_PLACES=185, PETRI_TRANSITIONS=271} [2025-02-08 08:44:25,677 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 141 predicate places. [2025-02-08 08:44:25,677 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 271 transitions, 2535 flow [2025-02-08 08:44:25,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 11.76923076923077) internal successors, (459), 39 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:25,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:25,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:25,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:44:25,877 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,SelfDestructingSolverStorable15 [2025-02-08 08:44:25,878 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:25,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash 814477418, now seen corresponding path program 3 times [2025-02-08 08:44:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031745812] [2025-02-08 08:44:25,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:44:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:25,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-02-08 08:44:25,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-02-08 08:44:25,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:44:25,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:44:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031745812] [2025-02-08 08:44:26,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031745812] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:44:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742193836] [2025-02-08 08:44:26,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:44:26,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:44:26,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:44:26,690 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:44:26,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:44:26,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-02-08 08:44:26,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-02-08 08:44:26,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:44:26,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:26,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 08:44:26,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:44:26,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:44:26,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-02-08 08:44:26,876 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:44:26,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:44:26,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:44:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:44:27,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:44:28,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:44:28,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 86 treesize of output 62 [2025-02-08 08:44:28,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:44:28,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 103 treesize of output 87 [2025-02-08 08:44:28,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:44:28,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 127 [2025-02-08 08:44:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:44:28,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742193836] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:44:28,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:44:28,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 38 [2025-02-08 08:44:28,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878602701] [2025-02-08 08:44:28,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:44:28,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-08 08:44:28,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:28,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-08 08:44:28,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1318, Unknown=3, NotChecked=0, Total=1482 [2025-02-08 08:44:28,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2025-02-08 08:44:28,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 271 transitions, 2535 flow. Second operand has 39 states, 39 states have (on average 6.794871794871795) internal successors, (265), 39 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:28,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:28,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2025-02-08 08:44:28,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:33,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 08:44:37,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 08:44:48,213 INFO L124 PetriNetUnfolderBase]: 1808/3296 cut-off events. [2025-02-08 08:44:48,213 INFO L125 PetriNetUnfolderBase]: For 48765/48765 co-relation queries the response was YES. [2025-02-08 08:44:48,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20981 conditions, 3296 events. 1808/3296 cut-off events. For 48765/48765 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 20653 event pairs, 103 based on Foata normal form. 37/3329 useless extension candidates. Maximal degree in co-relation 20658. Up to 1469 conditions per place. [2025-02-08 08:44:48,241 INFO L140 encePairwiseOnDemand]: 26/44 looper letters, 398 selfloop transitions, 350 changer transitions 57/808 dead transitions. [2025-02-08 08:44:48,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 808 transitions, 9694 flow [2025-02-08 08:44:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-02-08 08:44:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2025-02-08 08:44:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 901 transitions. [2025-02-08 08:44:48,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21555023923444977 [2025-02-08 08:44:48,245 INFO L175 Difference]: Start difference. First operand has 185 places, 271 transitions, 2535 flow. Second operand 95 states and 901 transitions. [2025-02-08 08:44:48,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 808 transitions, 9694 flow [2025-02-08 08:44:48,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 808 transitions, 8951 flow, removed 331 selfloop flow, removed 14 redundant places. [2025-02-08 08:44:48,384 INFO L231 Difference]: Finished difference. Result has 302 places, 574 transitions, 6772 flow [2025-02-08 08:44:48,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2234, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=6772, PETRI_PLACES=302, PETRI_TRANSITIONS=574} [2025-02-08 08:44:48,385 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 258 predicate places. [2025-02-08 08:44:48,385 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 574 transitions, 6772 flow [2025-02-08 08:44:48,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.794871794871795) internal successors, (265), 39 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:48,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:48,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:48,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:44:48,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 08:44:48,586 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:44:48,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:48,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2145724616, now seen corresponding path program 4 times [2025-02-08 08:44:48,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:48,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833469515] [2025-02-08 08:44:48,586 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:44:48,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:48,592 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-08 08:44:48,616 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:44:48,617 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:44:48,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:44:50,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:50,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833469515] [2025-02-08 08:44:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833469515] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:44:50,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950267651] [2025-02-08 08:44:50,112 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:44:50,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:44:50,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:44:50,115 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:44:50,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:44:50,166 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-08 08:44:50,184 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:44:50,184 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:44:50,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:50,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 08:44:50,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:44:50,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-02-08 08:44:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:44:50,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:44:51,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:44:51,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 297 [2025-02-08 08:44:51,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:44:51,975 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 22 treesize of output 18 [2025-02-08 08:44:51,990 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 08:44:51,990 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 22 treesize of output 1 [2025-02-08 08:44:52,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:44:52,001 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 08:44:52,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:44:52,010 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 08:44:52,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:44:52,053 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-02-08 08:44:52,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:44:52,063 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-02-08 08:44:52,076 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 08:44:52,077 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 35 treesize of output 1 [2025-02-08 08:44:52,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:44:52,086 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-02-08 08:44:52,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:44:52,245 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 131 treesize of output 103 [2025-02-08 08:44:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:44:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950267651] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:44:52,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:44:52,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2025-02-08 08:44:52,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239393107] [2025-02-08 08:44:52,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:44:52,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-08 08:44:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:52,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-08 08:44:52,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 08:44:52,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-02-08 08:44:52,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 574 transitions, 6772 flow. Second operand has 39 states, 39 states have (on average 9.76923076923077) internal successors, (381), 39 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:52,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:52,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-02-08 08:44:52,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:01,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 08:45:06,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 08:45:10,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 08:45:14,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 08:45:18,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 08:45:22,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 08:45:27,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]