./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-simple-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 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:11:40,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:11:40,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:11:40,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:11:40,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:11:40,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:11:40,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:11:40,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:11:40,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:11:40,401 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:11:40,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:11:40,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:11:40,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:11:40,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:11:40,402 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:11:40,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:11:40,403 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:11:40,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:11:40,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:11:40,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:11:40,403 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:11:40,403 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:11:40,404 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:11:40,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:11:40,404 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:11:40,404 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:11:40,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:11:40,404 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:11:40,404 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:11:40,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:11:40,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:11:40,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:11:40,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:11:40,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:11:40,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:11:40,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:11:40,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:11:40,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:11:40,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:11:40,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:11:40,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:11:40,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:11:40,406 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 -> 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 [2025-02-06 13:11:40,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:11:40,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:11:40,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:11:40,690 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:11:40,690 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:11:40,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-02-06 13:11:41,956 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b03f1b08e/8af97ecaeddc47b1b23cd27b58865910/FLAG6467c793f [2025-02-06 13:11:42,207 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:11:42,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-02-06 13:11:42,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b03f1b08e/8af97ecaeddc47b1b23cd27b58865910/FLAG6467c793f [2025-02-06 13:11:42,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b03f1b08e/8af97ecaeddc47b1b23cd27b58865910 [2025-02-06 13:11:42,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:11:42,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:11:42,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:11:42,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:11:42,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:11:42,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8743e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42, skipping insertion in model container [2025-02-06 13:11:42,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:11:42,418 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:11:42,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:11:42,427 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:11:42,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:11:42,451 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:11:42,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42 WrapperNode [2025-02-06 13:11:42,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:11:42,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:11:42,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:11:42,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:11:42,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,483 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 122 [2025-02-06 13:11:42,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:11:42,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:11:42,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:11:42,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:11:42,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,503 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-06 13:11:42,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:11:42,512 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:11:42,512 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:11:42,513 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:11:42,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (1/1) ... [2025-02-06 13:11:42,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:11:42,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:11:42,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:11:42,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:11:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:11:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:11:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:11:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:11:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:11:42,558 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:11:42,644 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:11:42,645 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:11:42,883 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:11:42,883 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:11:43,044 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:11:43,044 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:11:43,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:43 BoogieIcfgContainer [2025-02-06 13:11:43,045 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:11:43,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:11:43,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:11:43,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:11:43,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:11:42" (1/3) ... [2025-02-06 13:11:43,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503abf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:11:43, skipping insertion in model container [2025-02-06 13:11:43,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:42" (2/3) ... [2025-02-06 13:11:43,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503abf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:11:43, skipping insertion in model container [2025-02-06 13:11:43,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:43" (3/3) ... [2025-02-06 13:11:43,057 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2025-02-06 13:11:43,067 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:11:43,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-queue.wvr.c that has 3 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-02-06 13:11:43,069 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:11:43,121 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:11:43,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 88 flow [2025-02-06 13:11:43,181 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-02-06 13:11:43,182 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:11:43,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 5/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-06 13:11:43,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 88 flow [2025-02-06 13:11:43,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 34 transitions, 80 flow [2025-02-06 13:11:43,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:11:43,206 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;@63496df7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:11:43,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 13:11:43,210 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:11:43,210 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:11:43,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:11:43,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:43,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:11:43,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:43,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash 346121, now seen corresponding path program 1 times [2025-02-06 13:11:43,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:43,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434841002] [2025-02-06 13:11:43,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:43,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:11:43,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:11:43,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:43,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:11:43,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:43,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434841002] [2025-02-06 13:11:43,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434841002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:11:43,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:11:43,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:11:43,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434882559] [2025-02-06 13:11:43,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:11:43,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:11:43,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:43,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:11:43,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:11:43,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 13:11:43,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:43,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:43,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 13:11:43,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:43,675 INFO L124 PetriNetUnfolderBase]: 212/371 cut-off events. [2025-02-06 13:11:43,676 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-06 13:11:43,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 371 events. 212/371 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1444 event pairs, 176 based on Foata normal form. 1/264 useless extension candidates. Maximal degree in co-relation 705. Up to 364 conditions per place. [2025-02-06 13:11:43,683 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-02-06 13:11:43,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 120 flow [2025-02-06 13:11:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:11:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:11:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-02-06 13:11:43,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-02-06 13:11:43,700 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 80 flow. Second operand 3 states and 50 transitions. [2025-02-06 13:11:43,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 120 flow [2025-02-06 13:11:43,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:11:43,707 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2025-02-06 13:11:43,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-02-06 13:11:43,713 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-02-06 13:11:43,715 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2025-02-06 13:11:43,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:43,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:43,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:11:43,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:11:43,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:43,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:43,716 INFO L85 PathProgramCache]: Analyzing trace with hash 346122, now seen corresponding path program 1 times [2025-02-06 13:11:43,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:43,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356672035] [2025-02-06 13:11:43,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:43,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:11:43,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:11:43,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:43,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:11:44,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:44,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356672035] [2025-02-06 13:11:44,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356672035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:11:44,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:11:44,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:11:44,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231123716] [2025-02-06 13:11:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:11:44,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:11:44,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:44,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:11:44,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:11:44,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 13:11:44,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:44,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:44,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 13:11:44,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:44,179 INFO L124 PetriNetUnfolderBase]: 213/374 cut-off events. [2025-02-06 13:11:44,179 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 13:11:44,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 374 events. 213/374 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1459 event pairs, 176 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 737. Up to 369 conditions per place. [2025-02-06 13:11:44,182 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-02-06 13:11:44,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 132 flow [2025-02-06 13:11:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:11:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:11:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-02-06 13:11:44,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3918918918918919 [2025-02-06 13:11:44,187 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 58 transitions. [2025-02-06 13:11:44,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 132 flow [2025-02-06 13:11:44,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:11:44,190 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2025-02-06 13:11:44,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-02-06 13:11:44,192 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-02-06 13:11:44,192 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2025-02-06 13:11:44,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:44,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:44,192 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:11:44,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:11:44,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:44,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash 332633975, now seen corresponding path program 1 times [2025-02-06 13:11:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:44,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133707514] [2025-02-06 13:11:44,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:44,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:44,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:11:44,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:11:44,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:44,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:11:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133707514] [2025-02-06 13:11:44,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133707514] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:11:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576355653] [2025-02-06 13:11:44,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:44,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:11:44,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:11:44,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:11:44,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:11:44,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:11:44,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:11:44,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:44,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:44,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:11:44,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:11:44,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-06 13:11:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:11:44,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:11:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:11:44,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576355653] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:11:44,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:11:44,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-06 13:11:44,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638077743] [2025-02-06 13:11:44,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:11:44,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:11:44,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:44,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:11:44,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:11:44,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 13:11:44,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:44,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:44,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 13:11:44,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:45,239 INFO L124 PetriNetUnfolderBase]: 214/376 cut-off events. [2025-02-06 13:11:45,239 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 13:11:45,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 376 events. 214/376 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1459 event pairs, 176 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 744. Up to 366 conditions per place. [2025-02-06 13:11:45,242 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 21 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2025-02-06 13:11:45,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 159 flow [2025-02-06 13:11:45,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:11:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:11:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2025-02-06 13:11:45,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30067567567567566 [2025-02-06 13:11:45,244 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 8 states and 89 transitions. [2025-02-06 13:11:45,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 159 flow [2025-02-06 13:11:45,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:11:45,246 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 114 flow [2025-02-06 13:11:45,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-02-06 13:11:45,247 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2025-02-06 13:11:45,247 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 114 flow [2025-02-06 13:11:45,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:45,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:45,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:45,257 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-06 13:11:45,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:11:45,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:45,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:45,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1895453906, now seen corresponding path program 1 times [2025-02-06 13:11:45,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931583045] [2025-02-06 13:11:45,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:45,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:45,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:11:45,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:11:45,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:45,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:11:45,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:45,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931583045] [2025-02-06 13:11:45,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931583045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:11:45,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:11:45,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:11:45,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256298778] [2025-02-06 13:11:45,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:11:45,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:11:45,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:45,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:11:45,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:11:45,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:45,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:45,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:45,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:45,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:45,652 INFO L124 PetriNetUnfolderBase]: 281/515 cut-off events. [2025-02-06 13:11:45,652 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 13:11:45,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 515 events. 281/515 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2229 event pairs, 244 based on Foata normal form. 23/406 useless extension candidates. Maximal degree in co-relation 745. Up to 370 conditions per place. [2025-02-06 13:11:45,657 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 41 selfloop transitions, 3 changer transitions 2/49 dead transitions. [2025-02-06 13:11:45,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 240 flow [2025-02-06 13:11:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:11:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:11:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-02-06 13:11:45,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5472972972972973 [2025-02-06 13:11:45,658 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 114 flow. Second operand 4 states and 81 transitions. [2025-02-06 13:11:45,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 240 flow [2025-02-06 13:11:45,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 198 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-06 13:11:45,660 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 91 flow [2025-02-06 13:11:45,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-02-06 13:11:45,660 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-02-06 13:11:45,660 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 91 flow [2025-02-06 13:11:45,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:45,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:45,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:45,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:11:45,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:45,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:45,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1292445119, now seen corresponding path program 1 times [2025-02-06 13:11:45,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:45,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027651477] [2025-02-06 13:11:45,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:45,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:45,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:11:45,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:11:45,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:45,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:11:45,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:45,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027651477] [2025-02-06 13:11:45,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027651477] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:11:45,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242048151] [2025-02-06 13:11:45,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:45,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:11:45,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:11:45,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:11:45,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:11:45,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:11:45,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:11:45,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:45,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:45,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 13:11:45,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:11:45,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 13:11:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:11:46,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:11:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242048151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:11:46,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:11:46,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-02-06 13:11:46,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35265182] [2025-02-06 13:11:46,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:11:46,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:11:46,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:46,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:11:46,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:11:46,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:46,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-06 13:11:46,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:46,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:46,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:46,122 INFO L124 PetriNetUnfolderBase]: 233/434 cut-off events. [2025-02-06 13:11:46,122 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 13:11:46,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 434 events. 233/434 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1831 event pairs, 200 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 648. Up to 419 conditions per place. [2025-02-06 13:11:46,124 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 25 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-02-06 13:11:46,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 141 flow [2025-02-06 13:11:46,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:11:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:11:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-02-06 13:11:46,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38513513513513514 [2025-02-06 13:11:46,126 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 91 flow. Second operand 4 states and 57 transitions. [2025-02-06 13:11:46,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 141 flow [2025-02-06 13:11:46,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:11:46,127 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 86 flow [2025-02-06 13:11:46,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2025-02-06 13:11:46,128 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2025-02-06 13:11:46,128 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 86 flow [2025-02-06 13:11:46,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-06 13:11:46,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:46,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:46,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:11:46,333 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-06 13:11:46,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:46,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:46,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1292445118, now seen corresponding path program 1 times [2025-02-06 13:11:46,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:46,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810762892] [2025-02-06 13:11:46,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:46,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:46,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:11:46,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:11:46,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:46,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:11:46,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:46,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810762892] [2025-02-06 13:11:46,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810762892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:11:46,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:11:46,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:11:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865935891] [2025-02-06 13:11:46,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:11:46,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:11:46,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:46,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:11:46,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:11:46,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 13:11:46,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:46,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:46,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 13:11:46,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:46,455 INFO L124 PetriNetUnfolderBase]: 191/363 cut-off events. [2025-02-06 13:11:46,455 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 13:11:46,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 363 events. 191/363 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1467 event pairs, 162 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 458. Up to 348 conditions per place. [2025-02-06 13:11:46,456 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 23 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-02-06 13:11:46,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 132 flow [2025-02-06 13:11:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:11:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:11:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-02-06 13:11:46,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2025-02-06 13:11:46,457 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 86 flow. Second operand 4 states and 51 transitions. [2025-02-06 13:11:46,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 132 flow [2025-02-06 13:11:46,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:11:46,458 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 81 flow [2025-02-06 13:11:46,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-02-06 13:11:46,459 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-02-06 13:11:46,459 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 81 flow [2025-02-06 13:11:46,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:46,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:46,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:46,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:11:46,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:46,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1057095895, now seen corresponding path program 1 times [2025-02-06 13:11:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:46,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396493627] [2025-02-06 13:11:46,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:46,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:11:46,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:11:46,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:46,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:11:46,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:46,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396493627] [2025-02-06 13:11:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396493627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:11:46,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:11:46,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:11:46,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237400393] [2025-02-06 13:11:46,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:11:46,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:11:46,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:46,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:11:46,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:11:46,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:46,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:46,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:46,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:46,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:46,567 INFO L124 PetriNetUnfolderBase]: 272/497 cut-off events. [2025-02-06 13:11:46,567 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 13:11:46,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 497 events. 272/497 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2016 event pairs, 150 based on Foata normal form. 2/422 useless extension candidates. Maximal degree in co-relation 751. Up to 315 conditions per place. [2025-02-06 13:11:46,569 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 34 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2025-02-06 13:11:46,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 193 flow [2025-02-06 13:11:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:11:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:11:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-02-06 13:11:46,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5315315315315315 [2025-02-06 13:11:46,570 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 81 flow. Second operand 3 states and 59 transitions. [2025-02-06 13:11:46,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 193 flow [2025-02-06 13:11:46,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:11:46,571 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 84 flow [2025-02-06 13:11:46,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-02-06 13:11:46,572 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2025-02-06 13:11:46,572 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 84 flow [2025-02-06 13:11:46,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:46,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:46,572 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:46,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:11:46,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:46,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1820184053, now seen corresponding path program 1 times [2025-02-06 13:11:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:46,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855620889] [2025-02-06 13:11:46,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:46,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:11:46,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:11:46,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:46,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:11:46,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:46,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855620889] [2025-02-06 13:11:46,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855620889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:11:46,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:11:46,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:11:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122149533] [2025-02-06 13:11:46,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:11:46,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:11:46,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:46,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:11:46,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:11:46,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:46,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:46,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:46,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:46,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:46,708 INFO L124 PetriNetUnfolderBase]: 252/452 cut-off events. [2025-02-06 13:11:46,709 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-06 13:11:46,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 452 events. 252/452 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1663 event pairs, 113 based on Foata normal form. 11/391 useless extension candidates. Maximal degree in co-relation 983. Up to 306 conditions per place. [2025-02-06 13:11:46,711 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 33 selfloop transitions, 2 changer transitions 6/44 dead transitions. [2025-02-06 13:11:46,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 199 flow [2025-02-06 13:11:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:11:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:11:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-06 13:11:46,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2025-02-06 13:11:46,712 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 84 flow. Second operand 3 states and 60 transitions. [2025-02-06 13:11:46,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 199 flow [2025-02-06 13:11:46,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:11:46,713 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 96 flow [2025-02-06 13:11:46,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-02-06 13:11:46,714 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-02-06 13:11:46,714 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 96 flow [2025-02-06 13:11:46,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:46,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:46,715 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:46,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:11:46,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:46,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:46,715 INFO L85 PathProgramCache]: Analyzing trace with hash 936257017, now seen corresponding path program 1 times [2025-02-06 13:11:46,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:46,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378280961] [2025-02-06 13:11:46,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:46,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:46,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:11:46,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:11:46,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:46,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:11:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378280961] [2025-02-06 13:11:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378280961] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:11:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322039021] [2025-02-06 13:11:47,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:11:47,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:11:47,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:11:47,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:11:47,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:11:47,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:11:47,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:11:47,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:47,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:47,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 13:11:47,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:11:47,215 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-06 13:11:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:11:47,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:11:47,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-02-06 13:11:47,798 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 13:11:47,799 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 46 treesize of output 37 [2025-02-06 13:11:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:11:47,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322039021] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:11:47,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:11:47,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-06 13:11:47,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387850980] [2025-02-06 13:11:47,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:11:47,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 13:11:47,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:47,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 13:11:47,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-06 13:11:47,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:47,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 96 flow. Second operand has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:47,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:47,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:47,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:48,399 INFO L124 PetriNetUnfolderBase]: 581/1029 cut-off events. [2025-02-06 13:11:48,399 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2025-02-06 13:11:48,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 1029 events. 581/1029 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4645 event pairs, 251 based on Foata normal form. 2/871 useless extension candidates. Maximal degree in co-relation 1339. Up to 294 conditions per place. [2025-02-06 13:11:48,403 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 30 selfloop transitions, 6 changer transitions 48/87 dead transitions. [2025-02-06 13:11:48,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 87 transitions, 418 flow [2025-02-06 13:11:48,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:11:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:11:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2025-02-06 13:11:48,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2025-02-06 13:11:48,405 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 96 flow. Second operand 9 states and 156 transitions. [2025-02-06 13:11:48,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 87 transitions, 418 flow [2025-02-06 13:11:48,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 87 transitions, 411 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 13:11:48,407 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 110 flow [2025-02-06 13:11:48,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=110, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2025-02-06 13:11:48,408 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2025-02-06 13:11:48,408 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 110 flow [2025-02-06 13:11:48,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:48,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:48,409 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:48,417 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-06 13:11:48,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:11:48,613 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:48,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1297917046, now seen corresponding path program 2 times [2025-02-06 13:11:48,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:48,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782285665] [2025-02-06 13:11:48,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:11:48,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:48,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 13:11:48,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-02-06 13:11:48,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:11:48,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 13:11:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:48,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782285665] [2025-02-06 13:11:48,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782285665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:11:48,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:11:48,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:11:48,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929097988] [2025-02-06 13:11:48,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:11:48,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:11:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:48,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:11:48,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:11:48,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:48,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:48,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:48,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:48,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:48,853 INFO L124 PetriNetUnfolderBase]: 331/587 cut-off events. [2025-02-06 13:11:48,853 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2025-02-06 13:11:48,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 587 events. 331/587 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2155 event pairs, 68 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 1398. Up to 157 conditions per place. [2025-02-06 13:11:48,855 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 49 selfloop transitions, 4 changer transitions 12/68 dead transitions. [2025-02-06 13:11:48,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 68 transitions, 341 flow [2025-02-06 13:11:48,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:11:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:11:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-02-06 13:11:48,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5513513513513514 [2025-02-06 13:11:48,857 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 110 flow. Second operand 5 states and 102 transitions. [2025-02-06 13:11:48,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 68 transitions, 341 flow [2025-02-06 13:11:48,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 68 transitions, 315 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-02-06 13:11:48,859 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 110 flow [2025-02-06 13:11:48,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-02-06 13:11:48,860 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2025-02-06 13:11:48,860 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 110 flow [2025-02-06 13:11:48,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:48,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:48,860 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:48,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:11:48,860 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:48,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:48,861 INFO L85 PathProgramCache]: Analyzing trace with hash -317968211, now seen corresponding path program 3 times [2025-02-06 13:11:48,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:48,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526938427] [2025-02-06 13:11:48,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:11:48,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:48,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-02-06 13:11:48,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 31 statements. [2025-02-06 13:11:48,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:11:48,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 13:11:48,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:48,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526938427] [2025-02-06 13:11:48,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526938427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:11:48,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:11:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:11:48,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796295983] [2025-02-06 13:11:48,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:11:48,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:11:48,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:48,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:11:48,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:11:48,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:48,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:48,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:48,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:48,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:49,120 INFO L124 PetriNetUnfolderBase]: 719/1269 cut-off events. [2025-02-06 13:11:49,121 INFO L125 PetriNetUnfolderBase]: For 747/747 co-relation queries the response was YES. [2025-02-06 13:11:49,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3001 conditions, 1269 events. 719/1269 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5535 event pairs, 280 based on Foata normal form. 22/1093 useless extension candidates. Maximal degree in co-relation 2972. Up to 462 conditions per place. [2025-02-06 13:11:49,126 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 54 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-02-06 13:11:49,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 342 flow [2025-02-06 13:11:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:11:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:11:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-02-06 13:11:49,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5743243243243243 [2025-02-06 13:11:49,128 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 110 flow. Second operand 4 states and 85 transitions. [2025-02-06 13:11:49,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 342 flow [2025-02-06 13:11:49,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 64 transitions, 328 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 13:11:49,132 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 174 flow [2025-02-06 13:11:49,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-02-06 13:11:49,133 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2025-02-06 13:11:49,133 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 174 flow [2025-02-06 13:11:49,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:49,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:49,133 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:49,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:11:49,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:49,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash -273393397, now seen corresponding path program 4 times [2025-02-06 13:11:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:49,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766264779] [2025-02-06 13:11:49,134 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:11:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:49,145 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-02-06 13:11:49,159 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:11:49,160 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:11:49,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:49,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:11:49,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:49,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766264779] [2025-02-06 13:11:49,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766264779] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:11:49,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495466019] [2025-02-06 13:11:49,304 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:11:49,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:11:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:11:49,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:11:49,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:11:49,351 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-02-06 13:11:49,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:11:49,386 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:11:49,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:49,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 13:11:49,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:11:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:11:49,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:11:49,466 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 13:11:49,466 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 24 treesize of output 11 [2025-02-06 13:11:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:11:49,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495466019] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:11:49,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:11:49,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-02-06 13:11:49,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965046856] [2025-02-06 13:11:49,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:11:49,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:11:49,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:49,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:11:49,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:11:49,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:49,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:49,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:49,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:49,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:49,753 INFO L124 PetriNetUnfolderBase]: 959/1673 cut-off events. [2025-02-06 13:11:49,753 INFO L125 PetriNetUnfolderBase]: For 1715/1715 co-relation queries the response was YES. [2025-02-06 13:11:49,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4288 conditions, 1673 events. 959/1673 cut-off events. For 1715/1715 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7595 event pairs, 190 based on Foata normal form. 4/1415 useless extension candidates. Maximal degree in co-relation 4259. Up to 427 conditions per place. [2025-02-06 13:11:49,760 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 56 selfloop transitions, 12 changer transitions 18/89 dead transitions. [2025-02-06 13:11:49,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 89 transitions, 502 flow [2025-02-06 13:11:49,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:11:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:11:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2025-02-06 13:11:49,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5765765765765766 [2025-02-06 13:11:49,761 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 174 flow. Second operand 6 states and 128 transitions. [2025-02-06 13:11:49,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 89 transitions, 502 flow [2025-02-06 13:11:49,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 488 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-02-06 13:11:49,764 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 249 flow [2025-02-06 13:11:49,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-02-06 13:11:49,765 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2025-02-06 13:11:49,765 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 249 flow [2025-02-06 13:11:49,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:49,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:49,766 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:49,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 13:11:49,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 13:11:49,966 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:49,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash -880026115, now seen corresponding path program 5 times [2025-02-06 13:11:49,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:49,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408213174] [2025-02-06 13:11:49,967 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:11:49,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:49,975 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 3 equivalence classes. [2025-02-06 13:11:49,989 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:11:49,989 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 13:11:49,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:11:50,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:50,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408213174] [2025-02-06 13:11:50,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408213174] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:11:50,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934708917] [2025-02-06 13:11:50,423 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:11:50,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:11:50,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:11:50,425 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:11:50,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:11:50,476 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 3 equivalence classes. [2025-02-06 13:11:50,503 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:11:50,504 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 13:11:50,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:50,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 13:11:50,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:11:50,830 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 13:11:50,830 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 23 treesize of output 10 [2025-02-06 13:11:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:11:50,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:11:50,871 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-02-06 13:11:50,871 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 25 treesize of output 13 [2025-02-06 13:11:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:11:51,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934708917] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:11:51,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:11:51,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-02-06 13:11:51,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669009417] [2025-02-06 13:11:51,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:11:51,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 13:11:51,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:51,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 13:11:51,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-02-06 13:11:51,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:51,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 249 flow. Second operand has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:51,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:51,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:51,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:53,089 INFO L124 PetriNetUnfolderBase]: 3117/5391 cut-off events. [2025-02-06 13:11:53,089 INFO L125 PetriNetUnfolderBase]: For 8768/8768 co-relation queries the response was YES. [2025-02-06 13:11:53,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14530 conditions, 5391 events. 3117/5391 cut-off events. For 8768/8768 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 30327 event pairs, 560 based on Foata normal form. 6/4561 useless extension candidates. Maximal degree in co-relation 10037. Up to 1226 conditions per place. [2025-02-06 13:11:53,115 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 216 selfloop transitions, 48 changer transitions 45/312 dead transitions. [2025-02-06 13:11:53,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 312 transitions, 1980 flow [2025-02-06 13:11:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 13:11:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-02-06 13:11:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 493 transitions. [2025-02-06 13:11:53,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532972972972973 [2025-02-06 13:11:53,117 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 249 flow. Second operand 25 states and 493 transitions. [2025-02-06 13:11:53,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 312 transitions, 1980 flow [2025-02-06 13:11:53,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 312 transitions, 1812 flow, removed 56 selfloop flow, removed 4 redundant places. [2025-02-06 13:11:53,131 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 841 flow [2025-02-06 13:11:53,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=841, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2025-02-06 13:11:53,132 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 46 predicate places. [2025-02-06 13:11:53,133 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 841 flow [2025-02-06 13:11:53,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:53,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:53,133 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:53,141 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-06 13:11:53,333 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,SelfDestructingSolverStorable12 [2025-02-06 13:11:53,335 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:53,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash -441732044, now seen corresponding path program 6 times [2025-02-06 13:11:53,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:53,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84631869] [2025-02-06 13:11:53,337 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:11:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:53,345 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 4 equivalence classes. [2025-02-06 13:11:53,374 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-02-06 13:11:53,375 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 13:11:53,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:11:53,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:53,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84631869] [2025-02-06 13:11:53,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84631869] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:11:53,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913886006] [2025-02-06 13:11:53,529 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:11:53,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:11:53,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:11:53,532 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:11:53,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:11:53,584 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 4 equivalence classes. [2025-02-06 13:11:53,613 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-02-06 13:11:53,613 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 13:11:53,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:53,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 13:11:53,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:11:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:11:53,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:11:53,711 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-02-06 13:11:53,711 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 25 treesize of output 13 [2025-02-06 13:11:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:11:53,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913886006] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:11:53,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:11:53,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-06 13:11:53,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832368177] [2025-02-06 13:11:53,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:11:53,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:11:53,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:53,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:11:53,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:11:53,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:53,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 841 flow. Second operand has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:53,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:53,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:53,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:54,958 INFO L124 PetriNetUnfolderBase]: 7344/12606 cut-off events. [2025-02-06 13:11:54,958 INFO L125 PetriNetUnfolderBase]: For 22754/22754 co-relation queries the response was YES. [2025-02-06 13:11:54,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34376 conditions, 12606 events. 7344/12606 cut-off events. For 22754/22754 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 82027 event pairs, 1383 based on Foata normal form. 59/10711 useless extension candidates. Maximal degree in co-relation 32645. Up to 2300 conditions per place. [2025-02-06 13:11:55,007 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 149 selfloop transitions, 104 changer transitions 54/310 dead transitions. [2025-02-06 13:11:55,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 310 transitions, 2825 flow [2025-02-06 13:11:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:11:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 13:11:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 285 transitions. [2025-02-06 13:11:55,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925155925155925 [2025-02-06 13:11:55,010 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 841 flow. Second operand 13 states and 285 transitions. [2025-02-06 13:11:55,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 310 transitions, 2825 flow [2025-02-06 13:11:55,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 310 transitions, 2357 flow, removed 232 selfloop flow, removed 2 redundant places. [2025-02-06 13:11:55,054 INFO L231 Difference]: Finished difference. Result has 103 places, 167 transitions, 1881 flow [2025-02-06 13:11:55,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1881, PETRI_PLACES=103, PETRI_TRANSITIONS=167} [2025-02-06 13:11:55,055 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 67 predicate places. [2025-02-06 13:11:55,056 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 167 transitions, 1881 flow [2025-02-06 13:11:55,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:55,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:55,056 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:55,064 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-06 13:11:55,261 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,SelfDestructingSolverStorable13 [2025-02-06 13:11:55,261 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:55,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:55,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1525592604, now seen corresponding path program 7 times [2025-02-06 13:11:55,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:55,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130977341] [2025-02-06 13:11:55,262 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:11:55,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:55,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 13:11:55,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 13:11:55,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:55,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:11:55,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:55,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130977341] [2025-02-06 13:11:55,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130977341] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:11:55,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798107150] [2025-02-06 13:11:55,404 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:11:55,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:11:55,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:11:55,407 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:11:55,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:11:55,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 13:11:55,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 13:11:55,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:11:55,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:55,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 13:11:55,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:11:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:11:55,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:11:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:11:55,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798107150] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:11:55,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:11:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-06 13:11:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458727803] [2025-02-06 13:11:55,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:11:55,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 13:11:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:55,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 13:11:55,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:11:55,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:55,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 167 transitions, 1881 flow. Second operand has 18 states, 18 states have (on average 11.222222222222221) internal successors, (202), 18 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:55,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:55,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:55,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:11:56,277 INFO L124 PetriNetUnfolderBase]: 2973/5189 cut-off events. [2025-02-06 13:11:56,278 INFO L125 PetriNetUnfolderBase]: For 11864/11864 co-relation queries the response was YES. [2025-02-06 13:11:56,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14560 conditions, 5189 events. 2973/5189 cut-off events. For 11864/11864 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 30667 event pairs, 2359 based on Foata normal form. 52/4426 useless extension candidates. Maximal degree in co-relation 14498. Up to 4122 conditions per place. [2025-02-06 13:11:56,293 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 63 selfloop transitions, 6 changer transitions 48/120 dead transitions. [2025-02-06 13:11:56,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 120 transitions, 1197 flow [2025-02-06 13:11:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:11:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:11:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2025-02-06 13:11:56,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43543543543543545 [2025-02-06 13:11:56,294 INFO L175 Difference]: Start difference. First operand has 103 places, 167 transitions, 1881 flow. Second operand 9 states and 145 transitions. [2025-02-06 13:11:56,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 120 transitions, 1197 flow [2025-02-06 13:11:56,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 120 transitions, 988 flow, removed 92 selfloop flow, removed 10 redundant places. [2025-02-06 13:11:56,337 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 575 flow [2025-02-06 13:11:56,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2025-02-06 13:11:56,338 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 54 predicate places. [2025-02-06 13:11:56,338 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 72 transitions, 575 flow [2025-02-06 13:11:56,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.222222222222221) internal successors, (202), 18 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:56,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:11:56,338 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:11:56,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 13:11:56,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:11:56,539 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:11:56,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:11:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash -187907309, now seen corresponding path program 8 times [2025-02-06 13:11:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:11:56,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235006224] [2025-02-06 13:11:56,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:11:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:11:56,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 13:11:56,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 13:11:56,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:11:56,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:11:56,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:11:56,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235006224] [2025-02-06 13:11:56,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235006224] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:11:56,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62823847] [2025-02-06 13:11:56,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:11:56,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:11:56,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:11:56,915 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:11:56,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:11:56,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 13:11:57,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 13:11:57,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:11:57,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:11:57,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:11:57,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:11:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:11:57,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:11:57,733 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 13:11:57,733 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 24 treesize of output 11 [2025-02-06 13:11:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:11:58,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62823847] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:11:58,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:11:58,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2025-02-06 13:11:58,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203425804] [2025-02-06 13:11:58,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:11:58,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 13:11:58,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:11:58,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 13:11:58,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2025-02-06 13:11:58,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:11:58,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 72 transitions, 575 flow. Second operand has 29 states, 29 states have (on average 11.379310344827585) internal successors, (330), 29 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:11:58,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:11:58,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:11:58,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:00,140 INFO L124 PetriNetUnfolderBase]: 8912/15388 cut-off events. [2025-02-06 13:12:00,141 INFO L125 PetriNetUnfolderBase]: For 17639/17639 co-relation queries the response was YES. [2025-02-06 13:12:00,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39096 conditions, 15388 events. 8912/15388 cut-off events. For 17639/17639 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 107980 event pairs, 3264 based on Foata normal form. 80/13068 useless extension candidates. Maximal degree in co-relation 37675. Up to 3538 conditions per place. [2025-02-06 13:12:00,176 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 69 selfloop transitions, 15 changer transitions 259/346 dead transitions. [2025-02-06 13:12:00,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 346 transitions, 2883 flow [2025-02-06 13:12:00,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 13:12:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 13:12:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 359 transitions. [2025-02-06 13:12:00,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.462033462033462 [2025-02-06 13:12:00,178 INFO L175 Difference]: Start difference. First operand has 90 places, 72 transitions, 575 flow. Second operand 21 states and 359 transitions. [2025-02-06 13:12:00,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 346 transitions, 2883 flow [2025-02-06 13:12:00,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 346 transitions, 2815 flow, removed 22 selfloop flow, removed 7 redundant places. [2025-02-06 13:12:00,261 INFO L231 Difference]: Finished difference. Result has 104 places, 79 transitions, 752 flow [2025-02-06 13:12:00,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=752, PETRI_PLACES=104, PETRI_TRANSITIONS=79} [2025-02-06 13:12:00,264 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 68 predicate places. [2025-02-06 13:12:00,264 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 79 transitions, 752 flow [2025-02-06 13:12:00,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.379310344827585) internal successors, (330), 29 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:00,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:00,265 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:00,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 13:12:00,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 13:12:00,470 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:00,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash 398545465, now seen corresponding path program 9 times [2025-02-06 13:12:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:00,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807288057] [2025-02-06 13:12:00,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:12:00,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:00,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 6 equivalence classes. [2025-02-06 13:12:00,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 46 statements. [2025-02-06 13:12:00,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 13:12:00,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 13:12:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:00,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807288057] [2025-02-06 13:12:00,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807288057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:00,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51358544] [2025-02-06 13:12:00,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:12:00,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:00,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:00,698 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:12:00,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 13:12:00,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 6 equivalence classes. [2025-02-06 13:12:00,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 46 statements. [2025-02-06 13:12:00,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 13:12:00,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:00,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 13:12:00,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 13:12:01,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:01,275 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 13:12:01,276 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 24 treesize of output 11 [2025-02-06 13:12:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 13:12:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51358544] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:01,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-02-06 13:12:01,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974760659] [2025-02-06 13:12:01,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:01,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 13:12:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:01,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 13:12:01,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:12:01,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:01,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 79 transitions, 752 flow. Second operand has 18 states, 18 states have (on average 12.277777777777779) internal successors, (221), 18 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:01,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:01,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:01,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:02,094 INFO L124 PetriNetUnfolderBase]: 3838/6594 cut-off events. [2025-02-06 13:12:02,094 INFO L125 PetriNetUnfolderBase]: For 12748/12748 co-relation queries the response was YES. [2025-02-06 13:12:02,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17854 conditions, 6594 events. 3838/6594 cut-off events. For 12748/12748 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 38619 event pairs, 752 based on Foata normal form. 16/5589 useless extension candidates. Maximal degree in co-relation 17818. Up to 1725 conditions per place. [2025-02-06 13:12:02,112 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 0 selfloop transitions, 0 changer transitions 169/169 dead transitions. [2025-02-06 13:12:02,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 169 transitions, 1506 flow [2025-02-06 13:12:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:12:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:12:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2025-02-06 13:12:02,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543918918918919 [2025-02-06 13:12:02,113 INFO L175 Difference]: Start difference. First operand has 104 places, 79 transitions, 752 flow. Second operand 8 states and 161 transitions. [2025-02-06 13:12:02,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 169 transitions, 1506 flow [2025-02-06 13:12:02,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 169 transitions, 1151 flow, removed 112 selfloop flow, removed 23 redundant places. [2025-02-06 13:12:02,156 INFO L231 Difference]: Finished difference. Result has 77 places, 0 transitions, 0 flow [2025-02-06 13:12:02,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=77, PETRI_TRANSITIONS=0} [2025-02-06 13:12:02,157 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 41 predicate places. [2025-02-06 13:12:02,157 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 0 transitions, 0 flow [2025-02-06 13:12:02,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.277777777777779) internal successors, (221), 18 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:12:02,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2025-02-06 13:12:02,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-02-06 13:12:02,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-02-06 13:12:02,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-02-06 13:12:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2025-02-06 13:12:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-02-06 13:12:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 14 remaining) [2025-02-06 13:12:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-02-06 13:12:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2025-02-06 13:12:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2025-02-06 13:12:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-02-06 13:12:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-02-06 13:12:02,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-02-06 13:12:02,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-02-06 13:12:02,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 13:12:02,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:02,366 INFO L422 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:02,370 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 13:12:02,370 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:12:02,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:12:02 BasicIcfg [2025-02-06 13:12:02,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:12:02,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:12:02,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:12:02,374 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:12:02,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:43" (3/4) ... [2025-02-06 13:12:02,375 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:12:02,377 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 13:12:02,378 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 13:12:02,381 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2025-02-06 13:12:02,383 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2025-02-06 13:12:02,383 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 13:12:02,383 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 13:12:02,457 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:12:02,457 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:12:02,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:12:02,459 INFO L158 Benchmark]: Toolchain (without parser) took 20179.55ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 112.5MB in the beginning and 214.8MB in the end (delta: -102.2MB). Peak memory consumption was 508.4MB. Max. memory is 16.1GB. [2025-02-06 13:12:02,459 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:12:02,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.44ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 100.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:12:02,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.40ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:12:02,460 INFO L158 Benchmark]: Boogie Preprocessor took 27.82ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.7MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:12:02,461 INFO L158 Benchmark]: IcfgBuilder took 532.67ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 61.7MB in the end (delta: 36.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 13:12:02,461 INFO L158 Benchmark]: TraceAbstraction took 19325.58ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 61.2MB in the beginning and 221.9MB in the end (delta: -160.7MB). Peak memory consumption was 613.3MB. Max. memory is 16.1GB. [2025-02-06 13:12:02,461 INFO L158 Benchmark]: Witness Printer took 83.66ms. Allocated memory is still 755.0MB. Free memory was 221.9MB in the beginning and 214.8MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:12:02,463 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.44ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 100.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.40ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.82ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.7MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 532.67ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 61.7MB in the end (delta: 36.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19325.58ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 61.2MB in the beginning and 221.9MB in the end (delta: -160.7MB). Peak memory consumption was 613.3MB. Max. memory is 16.1GB. * Witness Printer took 83.66ms. Allocated memory is still 755.0MB. Free memory was 221.9MB in the beginning and 214.8MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 70]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.2s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1471 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1439 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3915 IncrementalHoareTripleChecker+Invalid, 4023 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 4 mSDtfsCounter, 3915 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 665 GetRequests, 462 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1881occurred in iteration=14, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 666 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 895 ConstructedInterpolants, 51 QuantifiedInterpolants, 8360 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1547 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 385/604 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 13:12:02,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE