./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-le-max.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-min-le-max.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 dbd0a32f8466e9a1ac86b6dfec2b7453fe6f40d8d953742d93d3d05c5ad7b7af --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:40:47,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:40:47,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:40:47,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:40:47,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:40:47,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:40:47,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:40:47,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:40:47,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:40:47,716 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:40:47,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:40:47,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:40:47,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:40:47,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:40:47,716 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:40:47,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:40:47,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:40:47,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:47,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:40:47,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:40:47,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:40:47,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:40:47,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:40:47,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:40:47,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:40:47,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:40:47,718 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 -> dbd0a32f8466e9a1ac86b6dfec2b7453fe6f40d8d953742d93d3d05c5ad7b7af [2025-02-08 08:40:47,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:40:47,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:40:47,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:40:47,964 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:40:47,964 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:40:47,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-le-max.wvr.c [2025-02-08 08:40:49,145 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0855f8689/4cf08794f0774597aafe439ce43f18c5/FLAG262202b98 [2025-02-08 08:40:49,344 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:40:49,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-le-max.wvr.c [2025-02-08 08:40:49,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0855f8689/4cf08794f0774597aafe439ce43f18c5/FLAG262202b98 [2025-02-08 08:40:49,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0855f8689/4cf08794f0774597aafe439ce43f18c5 [2025-02-08 08:40:49,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:40:49,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:40:49,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:49,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:40:49,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:40:49,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593a7904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49, skipping insertion in model container [2025-02-08 08:40:49,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:40:49,599 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:40:49,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:49,613 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:40:49,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:49,648 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:40:49,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49 WrapperNode [2025-02-08 08:40:49,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:49,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:49,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:40:49,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:40:49,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,682 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2025-02-08 08:40:49,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:49,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:40:49,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:40:49,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:40:49,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,708 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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-08 08:40:49,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:40:49,721 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:40:49,721 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:40:49,721 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:40:49,722 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (1/1) ... [2025-02-08 08:40:49,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:49,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:49,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:40:49,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:40:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:40:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:40:49,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:40:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:40:49,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:40:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:40:49,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:40:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:40:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:40:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:40:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:40:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:40:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:40:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:40:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:40:49,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:40:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:40:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:40:49,772 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:40:49,847 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:40:49,849 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:40:50,136 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:40:50,136 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:40:50,325 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:40:50,325 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:40:50,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:50 BoogieIcfgContainer [2025-02-08 08:40:50,325 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:40:50,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:40:50,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:40:50,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:40:50,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:40:49" (1/3) ... [2025-02-08 08:40:50,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e04e6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:50, skipping insertion in model container [2025-02-08 08:40:50,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:49" (2/3) ... [2025-02-08 08:40:50,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e04e6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:50, skipping insertion in model container [2025-02-08 08:40:50,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:50" (3/3) ... [2025-02-08 08:40:50,336 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-le-max.wvr.c [2025-02-08 08:40:50,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:40:50,349 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-le-max.wvr.c that has 4 procedures, 48 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-02-08 08:40:50,349 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:40:50,407 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:40:50,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 121 flow [2025-02-08 08:40:50,465 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2025-02-08 08:40:50,467 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:40:50,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 3/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 101 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-02-08 08:40:50,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 121 flow [2025-02-08 08:40:50,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 110 flow [2025-02-08 08:40:50,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:40:50,499 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;@7f7baf7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:40:50,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-08 08:40:50,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:40:50,504 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:40:50,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:40:50,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:50,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:50,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:50,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash 368560, now seen corresponding path program 1 times [2025-02-08 08:40:50,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:50,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019638744] [2025-02-08 08:40:50,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:50,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:50,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:50,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:50,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:50,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:50,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:50,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019638744] [2025-02-08 08:40:50,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019638744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:50,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:50,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:40:50,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425703699] [2025-02-08 08:40:50,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:50,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:50,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:50,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:50,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:50,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-08 08:40:50,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:50,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:50,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-08 08:40:50,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:50,982 INFO L124 PetriNetUnfolderBase]: 658/1036 cut-off events. [2025-02-08 08:40:50,982 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 08:40:50,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2135 conditions, 1036 events. 658/1036 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5037 event pairs, 556 based on Foata normal form. 1/789 useless extension candidates. Maximal degree in co-relation 1976. Up to 984 conditions per place. [2025-02-08 08:40:50,993 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 28 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-02-08 08:40:50,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 39 transitions, 156 flow [2025-02-08 08:40:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-02-08 08:40:51,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:40:51,005 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 110 flow. Second operand 3 states and 75 transitions. [2025-02-08 08:40:51,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 39 transitions, 156 flow [2025-02-08 08:40:51,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 144 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:40:51,012 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 88 flow [2025-02-08 08:40:51,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-02-08 08:40:51,017 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2025-02-08 08:40:51,019 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 88 flow [2025-02-08 08:40:51,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:51,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:51,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:51,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:40:51,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:51,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:51,021 INFO L85 PathProgramCache]: Analyzing trace with hash 368561, now seen corresponding path program 1 times [2025-02-08 08:40:51,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:51,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956589313] [2025-02-08 08:40:51,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:51,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:51,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:51,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:51,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:51,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:51,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:51,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956589313] [2025-02-08 08:40:51,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956589313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:51,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:51,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:51,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405652030] [2025-02-08 08:40:51,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:51,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:51,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:51,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:51,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-08 08:40:51,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:51,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:51,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-08 08:40:51,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:51,553 INFO L124 PetriNetUnfolderBase]: 659/1039 cut-off events. [2025-02-08 08:40:51,554 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 08:40:51,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 1039 events. 659/1039 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5052 event pairs, 556 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 2056. Up to 989 conditions per place. [2025-02-08 08:40:51,563 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 30 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-02-08 08:40:51,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 164 flow [2025-02-08 08:40:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-02-08 08:40:51,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435 [2025-02-08 08:40:51,565 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 88 flow. Second operand 4 states and 87 transitions. [2025-02-08 08:40:51,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 164 flow [2025-02-08 08:40:51,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:51,568 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 111 flow [2025-02-08 08:40:51,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-02-08 08:40:51,570 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2025-02-08 08:40:51,570 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 111 flow [2025-02-08 08:40:51,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:51,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:51,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:51,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:40:51,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:51,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:51,571 INFO L85 PathProgramCache]: Analyzing trace with hash 368607, now seen corresponding path program 1 times [2025-02-08 08:40:51,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:51,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882452174] [2025-02-08 08:40:51,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:51,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:51,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:51,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:51,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:51,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:51,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882452174] [2025-02-08 08:40:51,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882452174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:51,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:51,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:51,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756815968] [2025-02-08 08:40:51,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:51,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:51,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:51,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:51,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 08:40:51,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:51,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:51,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 08:40:51,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:51,766 INFO L124 PetriNetUnfolderBase]: 465/738 cut-off events. [2025-02-08 08:40:51,767 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:40:51,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 738 events. 465/738 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3220 event pairs, 378 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 1463. Up to 697 conditions per place. [2025-02-08 08:40:51,770 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 28 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2025-02-08 08:40:51,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 165 flow [2025-02-08 08:40:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-02-08 08:40:51,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-02-08 08:40:51,771 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 111 flow. Second operand 4 states and 76 transitions. [2025-02-08 08:40:51,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 165 flow [2025-02-08 08:40:51,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:51,772 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 106 flow [2025-02-08 08:40:51,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-02-08 08:40:51,773 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-02-08 08:40:51,773 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 106 flow [2025-02-08 08:40:51,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:51,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:51,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:51,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:40:51,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:51,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:51,774 INFO L85 PathProgramCache]: Analyzing trace with hash 368608, now seen corresponding path program 1 times [2025-02-08 08:40:51,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:51,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469152484] [2025-02-08 08:40:51,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:51,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:51,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:51,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:51,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:51,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:51,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469152484] [2025-02-08 08:40:51,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469152484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:51,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:51,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:51,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890818541] [2025-02-08 08:40:51,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:51,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:51,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:51,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:51,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-02-08 08:40:51,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 106 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-08 08:40:51,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:51,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-02-08 08:40:51,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:51,949 INFO L124 PetriNetUnfolderBase]: 464/737 cut-off events. [2025-02-08 08:40:51,949 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 08:40:51,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 737 events. 464/737 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3219 event pairs, 378 based on Foata normal form. 1/622 useless extension candidates. Maximal degree in co-relation 1463. Up to 700 conditions per place. [2025-02-08 08:40:51,953 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 28 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-02-08 08:40:51,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 160 flow [2025-02-08 08:40:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-08 08:40:51,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2025-02-08 08:40:51,955 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 106 flow. Second operand 3 states and 73 transitions. [2025-02-08 08:40:51,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 160 flow [2025-02-08 08:40:51,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 157 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:51,956 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 101 flow [2025-02-08 08:40:51,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-02-08 08:40:51,957 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-02-08 08:40:51,957 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 101 flow [2025-02-08 08:40:51,957 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-08 08:40:51,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:51,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:40:51,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:40:51,958 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:51,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash 354199198, now seen corresponding path program 1 times [2025-02-08 08:40:51,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:51,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988163089] [2025-02-08 08:40:51,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:51,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:51,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:51,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:51,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:51,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:52,055 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-08 08:40:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988163089] [2025-02-08 08:40:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988163089] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:52,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112837580] [2025-02-08 08:40:52,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:52,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:52,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:52,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:52,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:40:52,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:52,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:52,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:52,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:52,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:40:52,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:52,203 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-08 08:40:52,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:52,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-08 08:40:52,250 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-08 08:40:52,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112837580] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:52,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:52,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 08:40:52,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371428927] [2025-02-08 08:40:52,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:52,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:40:52,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:52,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:40:52,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:40:52,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-08 08:40:52,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 101 flow. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:52,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:52,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-08 08:40:52,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:52,458 INFO L124 PetriNetUnfolderBase]: 464/735 cut-off events. [2025-02-08 08:40:52,458 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:40:52,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 735 events. 464/735 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3197 event pairs, 378 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 1466. Up to 696 conditions per place. [2025-02-08 08:40:52,463 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 27 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-02-08 08:40:52,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 157 flow [2025-02-08 08:40:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-02-08 08:40:52,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.368 [2025-02-08 08:40:52,465 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 101 flow. Second operand 5 states and 92 transitions. [2025-02-08 08:40:52,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 157 flow [2025-02-08 08:40:52,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 35 transitions, 153 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:52,466 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 99 flow [2025-02-08 08:40:52,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-02-08 08:40:52,467 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-02-08 08:40:52,467 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 99 flow [2025-02-08 08:40:52,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:52,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:52,467 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:40:52,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:52,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:52,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:52,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:52,669 INFO L85 PathProgramCache]: Analyzing trace with hash 354199151, now seen corresponding path program 1 times [2025-02-08 08:40:52,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:52,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44674770] [2025-02-08 08:40:52,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:52,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:52,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:52,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:52,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:52,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:52,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:52,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44674770] [2025-02-08 08:40:52,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44674770] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:52,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988257135] [2025-02-08 08:40:52,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:52,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:52,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:52,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:52,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:40:52,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:52,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:52,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:52,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:52,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:40:52,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:52,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:40:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:53,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:53,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988257135] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:53,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:53,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:40:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242469420] [2025-02-08 08:40:53,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:53,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:40:53,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:53,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:40:53,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:40:53,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-08 08:40:53,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 99 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:53,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:53,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-08 08:40:53,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:53,393 INFO L124 PetriNetUnfolderBase]: 464/734 cut-off events. [2025-02-08 08:40:53,393 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:40:53,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 734 events. 464/734 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3190 event pairs, 378 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 1462. Up to 697 conditions per place. [2025-02-08 08:40:53,396 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 24 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2025-02-08 08:40:53,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 155 flow [2025-02-08 08:40:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-02-08 08:40:53,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-02-08 08:40:53,398 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 99 flow. Second operand 6 states and 109 transitions. [2025-02-08 08:40:53,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 155 flow [2025-02-08 08:40:53,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:53,399 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 104 flow [2025-02-08 08:40:53,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2025-02-08 08:40:53,400 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2025-02-08 08:40:53,400 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 104 flow [2025-02-08 08:40:53,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:53,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:53,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:53,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:40:53,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:53,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:53,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash 581582863, now seen corresponding path program 1 times [2025-02-08 08:40:53,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:53,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142546678] [2025-02-08 08:40:53,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:53,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:53,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:53,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:53,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:53,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:53,722 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-08 08:40:53,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142546678] [2025-02-08 08:40:53,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142546678] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189741685] [2025-02-08 08:40:53,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:53,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:53,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:53,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:53,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:40:53,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:53,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:53,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:53,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:53,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:40:53,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:53,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:40:53,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189741685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:53,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:40:53,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-02-08 08:40:53,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155998211] [2025-02-08 08:40:53,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:53,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:53,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:53,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:53,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:40:53,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-08 08:40:53,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:53,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:53,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-08 08:40:53,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:53,938 INFO L124 PetriNetUnfolderBase]: 680/1056 cut-off events. [2025-02-08 08:40:53,939 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:40:53,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 1056 events. 680/1056 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4830 event pairs, 286 based on Foata normal form. 0/924 useless extension candidates. Maximal degree in co-relation 2098. Up to 737 conditions per place. [2025-02-08 08:40:53,943 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 41 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2025-02-08 08:40:53,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 226 flow [2025-02-08 08:40:53,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-08 08:40:53,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46 [2025-02-08 08:40:53,944 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 104 flow. Second operand 4 states and 92 transitions. [2025-02-08 08:40:53,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 226 flow [2025-02-08 08:40:53,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 198 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-02-08 08:40:53,945 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 97 flow [2025-02-08 08:40:53,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-02-08 08:40:53,946 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2025-02-08 08:40:53,946 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 97 flow [2025-02-08 08:40:53,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:53,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:53,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:53,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:40:54,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:54,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:54,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash 544942934, now seen corresponding path program 1 times [2025-02-08 08:40:54,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:54,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607380369] [2025-02-08 08:40:54,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:54,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:54,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:40:54,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:40:54,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:54,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:54,263 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-08 08:40:54,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607380369] [2025-02-08 08:40:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607380369] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937154961] [2025-02-08 08:40:54,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:54,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:54,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:54,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:54,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:40:54,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:40:54,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:40:54,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:54,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:54,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:40:54,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:54,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:40:54,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937154961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:54,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:40:54,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-02-08 08:40:54,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702407626] [2025-02-08 08:40:54,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:54,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:54,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:54,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:54,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:40:54,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-08 08:40:54,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:54,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:54,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-08 08:40:54,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:54,513 INFO L124 PetriNetUnfolderBase]: 1003/1554 cut-off events. [2025-02-08 08:40:54,513 INFO L125 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2025-02-08 08:40:54,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3524 conditions, 1554 events. 1003/1554 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7609 event pairs, 536 based on Foata normal form. 0/1464 useless extension candidates. Maximal degree in co-relation 3506. Up to 1054 conditions per place. [2025-02-08 08:40:54,521 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 44 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2025-02-08 08:40:54,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 242 flow [2025-02-08 08:40:54,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-08 08:40:54,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.455 [2025-02-08 08:40:54,523 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 97 flow. Second operand 4 states and 91 transitions. [2025-02-08 08:40:54,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 242 flow [2025-02-08 08:40:54,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:54,525 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 113 flow [2025-02-08 08:40:54,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-02-08 08:40:54,525 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-02-08 08:40:54,525 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 113 flow [2025-02-08 08:40:54,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:54,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:54,525 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:54,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:40:54,731 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,SelfDestructingSolverStorable7 [2025-02-08 08:40:54,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash 37456131, now seen corresponding path program 1 times [2025-02-08 08:40:54,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:54,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895628928] [2025-02-08 08:40:54,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:54,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:40:54,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:40:54,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:54,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:54,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:54,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895628928] [2025-02-08 08:40:54,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895628928] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:54,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224385609] [2025-02-08 08:40:54,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:54,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:54,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:54,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:54,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:40:54,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:40:54,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:40:54,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:54,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:54,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:40:54,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:54,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:55,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224385609] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:55,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:55,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-08 08:40:55,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677053416] [2025-02-08 08:40:55,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:55,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:40:55,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:55,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:40:55,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:40:55,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-08 08:40:55,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 113 flow. Second operand has 14 states, 14 states have (on average 15.142857142857142) internal successors, (212), 14 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:55,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:55,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-08 08:40:55,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:55,382 INFO L124 PetriNetUnfolderBase]: 2076/3105 cut-off events. [2025-02-08 08:40:55,382 INFO L125 PetriNetUnfolderBase]: For 1222/1222 co-relation queries the response was YES. [2025-02-08 08:40:55,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7836 conditions, 3105 events. 2076/3105 cut-off events. For 1222/1222 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15622 event pairs, 1197 based on Foata normal form. 58/3151 useless extension candidates. Maximal degree in co-relation 4714. Up to 1814 conditions per place. [2025-02-08 08:40:55,398 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 83 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2025-02-08 08:40:55,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 96 transitions, 482 flow [2025-02-08 08:40:55,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:40:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:40:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2025-02-08 08:40:55,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-02-08 08:40:55,400 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 113 flow. Second operand 8 states and 188 transitions. [2025-02-08 08:40:55,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 96 transitions, 482 flow [2025-02-08 08:40:55,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 96 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:55,404 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 182 flow [2025-02-08 08:40:55,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2025-02-08 08:40:55,406 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2025-02-08 08:40:55,406 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 182 flow [2025-02-08 08:40:55,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.142857142857142) internal successors, (212), 14 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:55,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:55,407 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:55,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:40:55,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:55,612 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:55,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash -580966587, now seen corresponding path program 1 times [2025-02-08 08:40:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:55,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854169827] [2025-02-08 08:40:55,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:55,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:40:55,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:40:55,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:55,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:55,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:55,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854169827] [2025-02-08 08:40:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854169827] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:55,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594341176] [2025-02-08 08:40:55,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:55,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:55,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:40:55,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:40:55,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:40:55,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:55,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:55,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:40:55,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:55,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:55,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594341176] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:55,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:55,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-08 08:40:55,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393928932] [2025-02-08 08:40:55,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:55,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:40:55,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:55,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:40:55,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:40:55,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-08 08:40:55,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 182 flow. Second operand has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:55,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:55,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-08 08:40:55,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:56,249 INFO L124 PetriNetUnfolderBase]: 1820/2689 cut-off events. [2025-02-08 08:40:56,250 INFO L125 PetriNetUnfolderBase]: For 2436/2504 co-relation queries the response was YES. [2025-02-08 08:40:56,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7352 conditions, 2689 events. 1820/2689 cut-off events. For 2436/2504 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12708 event pairs, 1132 based on Foata normal form. 43/2721 useless extension candidates. Maximal degree in co-relation 4837. Up to 1822 conditions per place. [2025-02-08 08:40:56,264 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 75 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2025-02-08 08:40:56,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 504 flow [2025-02-08 08:40:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:40:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:40:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-02-08 08:40:56,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4575 [2025-02-08 08:40:56,266 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 182 flow. Second operand 8 states and 183 transitions. [2025-02-08 08:40:56,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 504 flow [2025-02-08 08:40:56,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 496 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:56,272 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 233 flow [2025-02-08 08:40:56,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2025-02-08 08:40:56,273 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2025-02-08 08:40:56,274 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 233 flow [2025-02-08 08:40:56,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:56,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:56,275 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:56,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:56,479 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,SelfDestructingSolverStorable9 [2025-02-08 08:40:56,479 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:56,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash -998262207, now seen corresponding path program 2 times [2025-02-08 08:40:56,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:56,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250396845] [2025-02-08 08:40:56,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:56,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:56,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-08 08:40:56,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:40:56,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:56,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:56,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:56,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250396845] [2025-02-08 08:40:56,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250396845] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:56,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005964427] [2025-02-08 08:40:56,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:56,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:56,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:56,617 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:56,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:40:56,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-08 08:40:56,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:40:56,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:56,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:56,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:40:56,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:56,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:56,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-02-08 08:40:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:57,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005964427] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:57,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:57,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-02-08 08:40:57,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274937156] [2025-02-08 08:40:57,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:57,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 08:40:57,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:57,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 08:40:57,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-02-08 08:40:57,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 08:40:57,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 233 flow. Second operand has 19 states, 19 states have (on average 13.052631578947368) internal successors, (248), 19 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:57,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:57,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 08:40:57,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:57,725 INFO L124 PetriNetUnfolderBase]: 1682/2509 cut-off events. [2025-02-08 08:40:57,725 INFO L125 PetriNetUnfolderBase]: For 2933/2965 co-relation queries the response was YES. [2025-02-08 08:40:57,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7568 conditions, 2509 events. 1682/2509 cut-off events. For 2933/2965 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12178 event pairs, 263 based on Foata normal form. 58/2555 useless extension candidates. Maximal degree in co-relation 4705. Up to 753 conditions per place. [2025-02-08 08:40:57,737 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 101 selfloop transitions, 14 changer transitions 0/118 dead transitions. [2025-02-08 08:40:57,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 118 transitions, 761 flow [2025-02-08 08:40:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:40:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:40:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2025-02-08 08:40:57,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4225 [2025-02-08 08:40:57,740 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 233 flow. Second operand 8 states and 169 transitions. [2025-02-08 08:40:57,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 118 transitions, 761 flow [2025-02-08 08:40:57,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 118 transitions, 742 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 08:40:57,744 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 248 flow [2025-02-08 08:40:57,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2025-02-08 08:40:57,745 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2025-02-08 08:40:57,745 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 248 flow [2025-02-08 08:40:57,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.052631578947368) internal successors, (248), 19 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:57,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:57,746 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:57,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:57,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:57,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:57,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash 526123267, now seen corresponding path program 2 times [2025-02-08 08:40:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823969866] [2025-02-08 08:40:57,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:57,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 08:40:57,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:40:57,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:57,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:58,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:58,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823969866] [2025-02-08 08:40:58,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823969866] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:58,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086760555] [2025-02-08 08:40:58,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:40:58,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:58,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:58,090 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-08 08:40:58,090 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-08 08:40:58,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 08:40:58,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:40:58,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:40:58,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:58,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 08:40:58,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:58,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:58,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-08 08:40:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:40:58,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086760555] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:58,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:58,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-02-08 08:40:58,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279418534] [2025-02-08 08:40:58,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:58,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 08:40:58,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:58,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 08:40:58,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-02-08 08:40:58,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 08:40:58,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 248 flow. Second operand has 20 states, 20 states have (on average 13.5) internal successors, (270), 20 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:58,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:58,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 08:40:58,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:59,577 INFO L124 PetriNetUnfolderBase]: 1938/2832 cut-off events. [2025-02-08 08:40:59,577 INFO L125 PetriNetUnfolderBase]: For 4698/4778 co-relation queries the response was YES. [2025-02-08 08:40:59,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9083 conditions, 2832 events. 1938/2832 cut-off events. For 4698/4778 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13143 event pairs, 292 based on Foata normal form. 102/2921 useless extension candidates. Maximal degree in co-relation 6066. Up to 498 conditions per place. [2025-02-08 08:40:59,589 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 130 selfloop transitions, 18 changer transitions 0/152 dead transitions. [2025-02-08 08:40:59,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 152 transitions, 982 flow [2025-02-08 08:40:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:40:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 08:40:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 290 transitions. [2025-02-08 08:40:59,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2025-02-08 08:40:59,590 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 248 flow. Second operand 14 states and 290 transitions. [2025-02-08 08:40:59,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 152 transitions, 982 flow [2025-02-08 08:40:59,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 152 transitions, 830 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-02-08 08:40:59,596 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 268 flow [2025-02-08 08:40:59,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=268, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2025-02-08 08:40:59,596 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2025-02-08 08:40:59,596 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 268 flow [2025-02-08 08:40:59,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 13.5) internal successors, (270), 20 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:59,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:59,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:59,603 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-08 08:40:59,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:59,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:40:59,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 481030183, now seen corresponding path program 1 times [2025-02-08 08:40:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:59,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95903474] [2025-02-08 08:40:59,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:59,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:59,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:40:59,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:40:59,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:59,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:40:59,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:59,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95903474] [2025-02-08 08:40:59,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95903474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:59,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:59,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:40:59,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929405742] [2025-02-08 08:40:59,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:59,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:59,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:59,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:59,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:59,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-02-08 08:40:59,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:59,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:59,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-02-08 08:40:59,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:41:00,067 INFO L124 PetriNetUnfolderBase]: 1395/2274 cut-off events. [2025-02-08 08:41:00,067 INFO L125 PetriNetUnfolderBase]: For 3820/3898 co-relation queries the response was YES. [2025-02-08 08:41:00,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6998 conditions, 2274 events. 1395/2274 cut-off events. For 3820/3898 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 12076 event pairs, 714 based on Foata normal form. 108/2366 useless extension candidates. Maximal degree in co-relation 4567. Up to 1357 conditions per place. [2025-02-08 08:41:00,082 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 57 selfloop transitions, 6 changer transitions 0/70 dead transitions. [2025-02-08 08:41:00,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 499 flow [2025-02-08 08:41:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:41:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:41:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-02-08 08:41:00,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-02-08 08:41:00,084 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 268 flow. Second operand 4 states and 96 transitions. [2025-02-08 08:41:00,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 499 flow [2025-02-08 08:41:00,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 398 flow, removed 19 selfloop flow, removed 11 redundant places. [2025-02-08 08:41:00,093 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 211 flow [2025-02-08 08:41:00,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2025-02-08 08:41:00,094 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2025-02-08 08:41:00,094 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 211 flow [2025-02-08 08:41:00,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:41:00,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:41:00,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:41:00,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:41:00,095 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:41:00,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:41:00,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1936152879, now seen corresponding path program 1 times [2025-02-08 08:41:00,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:41:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745239621] [2025-02-08 08:41:00,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:41:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:41:00,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:41:00,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:41:00,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:41:00,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:41:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:41:00,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:41:00,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745239621] [2025-02-08 08:41:00,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745239621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:41:00,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:41:00,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:41:00,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280095600] [2025-02-08 08:41:00,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:41:00,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:41:00,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:41:00,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:41:00,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:41:00,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-02-08 08:41:00,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:41:00,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:41:00,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-02-08 08:41:00,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:41:00,288 INFO L124 PetriNetUnfolderBase]: 1301/2110 cut-off events. [2025-02-08 08:41:00,289 INFO L125 PetriNetUnfolderBase]: For 2313/2388 co-relation queries the response was YES. [2025-02-08 08:41:00,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5731 conditions, 2110 events. 1301/2110 cut-off events. For 2313/2388 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10803 event pairs, 705 based on Foata normal form. 94/2183 useless extension candidates. Maximal degree in co-relation 3859. Up to 1395 conditions per place. [2025-02-08 08:41:00,296 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 50 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-02-08 08:41:00,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 375 flow [2025-02-08 08:41:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:41:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:41:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-02-08 08:41:00,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-02-08 08:41:00,297 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 211 flow. Second operand 4 states and 95 transitions. [2025-02-08 08:41:00,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 375 flow [2025-02-08 08:41:00,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 355 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:41:00,300 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 202 flow [2025-02-08 08:41:00,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2025-02-08 08:41:00,302 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2025-02-08 08:41:00,302 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 202 flow [2025-02-08 08:41:00,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:41:00,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:41:00,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:41:00,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:41:00,302 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 08:41:00,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:41:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash 365161952, now seen corresponding path program 1 times [2025-02-08 08:41:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:41:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086644327] [2025-02-08 08:41:00,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:41:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:41:00,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:41:00,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:41:00,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:41:00,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:41:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:41:00,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:41:00,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086644327] [2025-02-08 08:41:00,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086644327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:41:00,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:41:00,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:41:00,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362002953] [2025-02-08 08:41:00,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:41:00,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:41:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:41:00,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:41:00,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:41:00,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-02-08 08:41:00,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:41:00,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:41:00,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-02-08 08:41:00,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:41:00,691 INFO L124 PetriNetUnfolderBase]: 1301/2050 cut-off events. [2025-02-08 08:41:00,691 INFO L125 PetriNetUnfolderBase]: For 2034/2116 co-relation queries the response was YES. [2025-02-08 08:41:00,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5530 conditions, 2050 events. 1301/2050 cut-off events. For 2034/2116 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9721 event pairs, 135 based on Foata normal form. 2/2043 useless extension candidates. Maximal degree in co-relation 3712. Up to 782 conditions per place. [2025-02-08 08:41:00,695 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 0 selfloop transitions, 0 changer transitions 111/111 dead transitions. [2025-02-08 08:41:00,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 111 transitions, 678 flow [2025-02-08 08:41:00,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:41:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:41:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2025-02-08 08:41:00,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.414 [2025-02-08 08:41:00,698 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 202 flow. Second operand 10 states and 207 transitions. [2025-02-08 08:41:00,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 111 transitions, 678 flow [2025-02-08 08:41:00,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 111 transitions, 642 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:41:00,701 INFO L231 Difference]: Finished difference. Result has 68 places, 0 transitions, 0 flow [2025-02-08 08:41:00,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=68, PETRI_TRANSITIONS=0} [2025-02-08 08:41:00,702 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2025-02-08 08:41:00,702 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 0 transitions, 0 flow [2025-02-08 08:41:00,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (12 of 27 remaining) [2025-02-08 08:41:00,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (11 of 27 remaining) [2025-02-08 08:41:00,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 27 remaining) [2025-02-08 08:41:00,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-02-08 08:41:00,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 27 remaining) [2025-02-08 08:41:00,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2025-02-08 08:41:00,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2025-02-08 08:41:00,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2025-02-08 08:41:00,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2025-02-08 08:41:00,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2025-02-08 08:41:00,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2025-02-08 08:41:00,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2025-02-08 08:41:00,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 27 remaining) [2025-02-08 08:41:00,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:41:00,706 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:41:00,709 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:41:00,710 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:41:00,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:41:00 BasicIcfg [2025-02-08 08:41:00,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:41:00,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:41:00,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:41:00,714 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:41:00,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:50" (3/4) ... [2025-02-08 08:41:00,716 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:41:00,717 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:41:00,717 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:41:00,718 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 08:41:00,720 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2025-02-08 08:41:00,721 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2025-02-08 08:41:00,721 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 08:41:00,721 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:41:00,781 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:41:00,781 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:41:00,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:41:00,782 INFO L158 Benchmark]: Toolchain (without parser) took 11416.10ms. Allocated memory was 578.8MB in the beginning and 218.1MB in the end (delta: -360.7MB). Free memory was 549.1MB in the beginning and 106.6MB in the end (delta: 442.5MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2025-02-08 08:41:00,782 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:41:00,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.50ms. Allocated memory was 578.8MB in the beginning and 142.6MB in the end (delta: -436.2MB). Free memory was 548.7MB in the beginning and 100.9MB in the end (delta: 447.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:41:00,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.36ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:41:00,782 INFO L158 Benchmark]: Boogie Preprocessor took 36.81ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 97.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:41:00,783 INFO L158 Benchmark]: IcfgBuilder took 604.48ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 58.1MB in the end (delta: 39.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 08:41:00,783 INFO L158 Benchmark]: TraceAbstraction took 10386.31ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 57.7MB in the beginning and 112.7MB in the end (delta: -55.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2025-02-08 08:41:00,783 INFO L158 Benchmark]: Witness Printer took 67.50ms. Allocated memory is still 218.1MB. Free memory was 112.7MB in the beginning and 106.6MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:41:00,784 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.37ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.50ms. Allocated memory was 578.8MB in the beginning and 142.6MB in the end (delta: -436.2MB). Free memory was 548.7MB in the beginning and 100.9MB in the end (delta: 447.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.36ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.81ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 97.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 604.48ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 58.1MB in the end (delta: 39.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10386.31ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 57.7MB in the beginning and 112.7MB in the end (delta: -55.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Witness Printer took 67.50ms. Allocated memory is still 218.1MB. Free memory was 112.7MB in the beginning and 106.6MB in the end (delta: 6.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: -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: -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: 78]: 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 7 procedures, 73 locations, 27 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: 10.3s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1097 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 973 mSDsluCounter, 432 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 390 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5229 IncrementalHoareTripleChecker+Invalid, 5258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 42 mSDtfsCounter, 5229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=12, InterpolantAutomatonStates: 89, 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.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 2810 SizeOfPredicates, 24 NumberOfNonLiveVariables, 889 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 29 InterpolantComputations, 9 PerfectInterpolantSequences, 129/182 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 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:41:00,799 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