./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i --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/goblint-regression/09-regions_09-arraylist-deref.i -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 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:29:18,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:29:18,651 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:29:18,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:29:18,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:29:18,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:29:18,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:29:18,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:29:18,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:29:18,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:29:18,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:29:18,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:29:18,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:29:18,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:29:18,680 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:29:18,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:29:18,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:29:18,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:29:18,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:29:18,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:29:18,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:29:18,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:29:18,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:29:18,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:29:18,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:29:18,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:29:18,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:29:18,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:29:18,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:29:18,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:29:18,683 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 -> 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 [2025-02-08 08:29:18,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:29:18,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:29:18,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:29:18,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:29:18,912 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:29:18,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2025-02-08 08:29:20,059 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f842fdf96/529c1932b58a4a5e9429dc17acf0367f/FLAGd5da09e75 [2025-02-08 08:29:20,398 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:29:20,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2025-02-08 08:29:20,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f842fdf96/529c1932b58a4a5e9429dc17acf0367f/FLAGd5da09e75 [2025-02-08 08:29:20,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f842fdf96/529c1932b58a4a5e9429dc17acf0367f [2025-02-08 08:29:20,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:29:20,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:29:20,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:29:20,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:29:20,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:29:20,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:29:20" (1/1) ... [2025-02-08 08:29:20,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c332aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:20, skipping insertion in model container [2025-02-08 08:29:20,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:29:20" (1/1) ... [2025-02-08 08:29:20,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:29:21,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:29:21,054 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:29:21,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:29:21,146 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:29:21,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21 WrapperNode [2025-02-08 08:29:21,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:29:21,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:29:21,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:29:21,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:29:21,153 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:29:21" (1/1) ... [2025-02-08 08:29:21,170 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:29:21" (1/1) ... [2025-02-08 08:29:21,186 INFO L138 Inliner]: procedures = 372, calls = 43, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 124 [2025-02-08 08:29:21,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:29:21,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:29:21,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:29:21,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:29:21,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21" (1/1) ... [2025-02-08 08:29:21,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21" (1/1) ... [2025-02-08 08:29:21,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21" (1/1) ... [2025-02-08 08:29:21,213 INFO L175 MemorySlicer]: Split 33 memory accesses to 3 slices as follows [5, 14, 14]. 42 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [5, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-02-08 08:29:21,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21" (1/1) ... [2025-02-08 08:29:21,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21" (1/1) ... [2025-02-08 08:29:21,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21" (1/1) ... [2025-02-08 08:29:21,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21" (1/1) ... [2025-02-08 08:29:21,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21" (1/1) ... [2025-02-08 08:29:21,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21" (1/1) ... [2025-02-08 08:29:21,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:29:21,228 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:29:21,228 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:29:21,228 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:29:21,228 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21" (1/1) ... [2025-02-08 08:29:21,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:29:21,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:29:21,260 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:29:21,262 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:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:29:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:29:21,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:29:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:29:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 08:29:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 08:29:21,280 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 08:29:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:29:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:29:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:29:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:29:21,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:29:21,281 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:29:21,400 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:29:21,401 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:29:21,694 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:29:21,694 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:29:21,822 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:29:21,822 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:29:21,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:29:21 BoogieIcfgContainer [2025-02-08 08:29:21,822 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:29:21,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:29:21,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:29:21,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:29:21,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:29:20" (1/3) ... [2025-02-08 08:29:21,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747ca857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:29:21, skipping insertion in model container [2025-02-08 08:29:21,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:21" (2/3) ... [2025-02-08 08:29:21,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747ca857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:29:21, skipping insertion in model container [2025-02-08 08:29:21,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:29:21" (3/3) ... [2025-02-08 08:29:21,830 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist-deref.i [2025-02-08 08:29:21,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:29:21,843 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_09-arraylist-deref.i that has 2 procedures, 70 locations, 1 initial locations, 0 loop locations, and 37 error locations. [2025-02-08 08:29:21,843 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:29:21,894 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:29:21,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 69 transitions, 142 flow [2025-02-08 08:29:21,953 INFO L124 PetriNetUnfolderBase]: 0/68 cut-off events. [2025-02-08 08:29:21,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:21,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 68 events. 0/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 163 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-02-08 08:29:21,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 69 transitions, 142 flow [2025-02-08 08:29:21,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 68 transitions, 139 flow [2025-02-08 08:29:21,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:29:21,970 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;@1fc719ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:29:21,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-08 08:29:21,972 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:29:21,972 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-08 08:29:21,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:21,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:21,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:29:21,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:21,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:21,977 INFO L85 PathProgramCache]: Analyzing trace with hash 12846, now seen corresponding path program 1 times [2025-02-08 08:29:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906541679] [2025-02-08 08:29:21,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:21,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:22,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:29:22,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:29:22,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:22,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:22,190 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:29:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:22,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906541679] [2025-02-08 08:29:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906541679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:22,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:22,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:29:22,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091702826] [2025-02-08 08:29:22,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:22,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:29:22,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:22,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:29:22,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:29:22,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 69 [2025-02-08 08:29:22,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:29:22,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:22,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 69 [2025-02-08 08:29:22,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:22,400 INFO L124 PetriNetUnfolderBase]: 63/260 cut-off events. [2025-02-08 08:29:22,401 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:22,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 260 events. 63/260 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1206 event pairs, 63 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 377. Up to 149 conditions per place. [2025-02-08 08:29:22,404 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 22 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2025-02-08 08:29:22,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 183 flow [2025-02-08 08:29:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:29:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:29:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-02-08 08:29:22,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7101449275362319 [2025-02-08 08:29:22,414 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 139 flow. Second operand 3 states and 147 transitions. [2025-02-08 08:29:22,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 183 flow [2025-02-08 08:29:22,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:29:22,421 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 138 flow [2025-02-08 08:29:22,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2025-02-08 08:29:22,426 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2025-02-08 08:29:22,428 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 138 flow [2025-02-08 08:29:22,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:29:22,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:22,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:29:22,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:29:22,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:22,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash 12847, now seen corresponding path program 1 times [2025-02-08 08:29:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:22,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886733051] [2025-02-08 08:29:22,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:22,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:29:22,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:29:22,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:22,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:22,538 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:29:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886733051] [2025-02-08 08:29:22,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886733051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:22,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:22,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:29:22,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091603941] [2025-02-08 08:29:22,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:22,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:29:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:22,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:29:22,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:29:22,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 69 [2025-02-08 08:29:22,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:22,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:22,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 69 [2025-02-08 08:29:22,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:22,677 INFO L124 PetriNetUnfolderBase]: 63/256 cut-off events. [2025-02-08 08:29:22,678 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:29:22,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 256 events. 63/256 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1198 event pairs, 63 based on Foata normal form. 4/205 useless extension candidates. Maximal degree in co-relation 396. Up to 149 conditions per place. [2025-02-08 08:29:22,681 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 20 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-02-08 08:29:22,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 178 flow [2025-02-08 08:29:22,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:29:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:29:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-02-08 08:29:22,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7294685990338164 [2025-02-08 08:29:22,683 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 138 flow. Second operand 3 states and 151 transitions. [2025-02-08 08:29:22,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 178 flow [2025-02-08 08:29:22,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:29:22,684 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 130 flow [2025-02-08 08:29:22,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2025-02-08 08:29:22,684 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2025-02-08 08:29:22,684 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 130 flow [2025-02-08 08:29:22,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:22,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:22,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:29:22,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:29:22,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:22,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash 12355791, now seen corresponding path program 1 times [2025-02-08 08:29:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:22,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306285449] [2025-02-08 08:29:22,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:22,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:29:22,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:29:22,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:22,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:22,831 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:29:22,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:22,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306285449] [2025-02-08 08:29:22,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306285449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:22,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:22,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:29:22,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271910668] [2025-02-08 08:29:22,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:22,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:29:22,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:22,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:29:22,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:29:22,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 69 [2025-02-08 08:29:22,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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:29:22,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:22,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 69 [2025-02-08 08:29:22,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:23,049 INFO L124 PetriNetUnfolderBase]: 72/274 cut-off events. [2025-02-08 08:29:23,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:23,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 274 events. 72/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1280 event pairs, 72 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 434. Up to 169 conditions per place. [2025-02-08 08:29:23,051 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 25 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-02-08 08:29:23,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 176 flow [2025-02-08 08:29:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:29:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:29:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2025-02-08 08:29:23,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6630434782608695 [2025-02-08 08:29:23,054 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 130 flow. Second operand 4 states and 183 transitions. [2025-02-08 08:29:23,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 176 flow [2025-02-08 08:29:23,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:29:23,055 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 118 flow [2025-02-08 08:29:23,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-02-08 08:29:23,056 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-02-08 08:29:23,056 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 118 flow [2025-02-08 08:29:23,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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:29:23,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:23,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:29:23,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:29:23,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:23,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:23,058 INFO L85 PathProgramCache]: Analyzing trace with hash 12355792, now seen corresponding path program 1 times [2025-02-08 08:29:23,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:23,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18744547] [2025-02-08 08:29:23,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:23,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:23,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:29:23,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:29:23,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:23,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:23,222 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:29:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:23,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18744547] [2025-02-08 08:29:23,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18744547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:23,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:23,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:29:23,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604932709] [2025-02-08 08:29:23,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:23,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:29:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:23,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:29:23,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:29:23,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2025-02-08 08:29:23,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:23,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:23,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2025-02-08 08:29:23,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:23,398 INFO L124 PetriNetUnfolderBase]: 69/291 cut-off events. [2025-02-08 08:29:23,399 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:29:23,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 291 events. 69/291 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1520 event pairs, 24 based on Foata normal form. 3/231 useless extension candidates. Maximal degree in co-relation 451. Up to 124 conditions per place. [2025-02-08 08:29:23,402 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 31 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2025-02-08 08:29:23,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 204 flow [2025-02-08 08:29:23,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:29:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:29:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2025-02-08 08:29:23,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7463768115942029 [2025-02-08 08:29:23,405 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 118 flow. Second operand 4 states and 206 transitions. [2025-02-08 08:29:23,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 204 flow [2025-02-08 08:29:23,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:29:23,410 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 132 flow [2025-02-08 08:29:23,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-02-08 08:29:23,411 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-02-08 08:29:23,411 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 132 flow [2025-02-08 08:29:23,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:23,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:23,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:23,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:29:23,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:23,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:23,412 INFO L85 PathProgramCache]: Analyzing trace with hash -881912507, now seen corresponding path program 1 times [2025-02-08 08:29:23,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:23,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770881101] [2025-02-08 08:29:23,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:23,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:23,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:29:23,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:29:23,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:23,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:23,756 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:29:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:23,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770881101] [2025-02-08 08:29:23,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770881101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:23,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:23,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:29:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987134439] [2025-02-08 08:29:23,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:23,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:29:23,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:23,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:29:23,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:29:24,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2025-02-08 08:29:24,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:24,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:24,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2025-02-08 08:29:24,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:24,255 INFO L124 PetriNetUnfolderBase]: 63/241 cut-off events. [2025-02-08 08:29:24,256 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 08:29:24,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 241 events. 63/241 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1111 event pairs, 54 based on Foata normal form. 1/201 useless extension candidates. Maximal degree in co-relation 418. Up to 126 conditions per place. [2025-02-08 08:29:24,257 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 25 selfloop transitions, 8 changer transitions 3/62 dead transitions. [2025-02-08 08:29:24,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 216 flow [2025-02-08 08:29:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:29:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:29:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2025-02-08 08:29:24,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5548654244306418 [2025-02-08 08:29:24,259 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 132 flow. Second operand 7 states and 268 transitions. [2025-02-08 08:29:24,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 216 flow [2025-02-08 08:29:24,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:29:24,260 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 139 flow [2025-02-08 08:29:24,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-02-08 08:29:24,261 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2025-02-08 08:29:24,261 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 139 flow [2025-02-08 08:29:24,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:24,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:24,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:24,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:29:24,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:24,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash -881912508, now seen corresponding path program 1 times [2025-02-08 08:29:24,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:24,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360716806] [2025-02-08 08:29:24,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:24,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:24,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:29:24,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:29:24,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:24,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:24,421 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:29:24,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:24,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360716806] [2025-02-08 08:29:24,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360716806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:24,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:24,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:29:24,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471983066] [2025-02-08 08:29:24,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:24,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:29:24,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:24,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:29:24,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:29:24,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2025-02-08 08:29:24,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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:29:24,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:24,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2025-02-08 08:29:24,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:24,754 INFO L124 PetriNetUnfolderBase]: 63/239 cut-off events. [2025-02-08 08:29:24,754 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 08:29:24,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 239 events. 63/239 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1110 event pairs, 54 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 421. Up to 126 conditions per place. [2025-02-08 08:29:24,755 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 26 selfloop transitions, 8 changer transitions 3/60 dead transitions. [2025-02-08 08:29:24,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 225 flow [2025-02-08 08:29:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:29:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:29:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 290 transitions. [2025-02-08 08:29:24,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6004140786749482 [2025-02-08 08:29:24,757 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 139 flow. Second operand 7 states and 290 transitions. [2025-02-08 08:29:24,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 225 flow [2025-02-08 08:29:24,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 209 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:29:24,758 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 135 flow [2025-02-08 08:29:24,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2025-02-08 08:29:24,759 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-02-08 08:29:24,759 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 135 flow [2025-02-08 08:29:24,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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:29:24,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:24,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:24,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:29:24,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:24,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:24,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1409348917, now seen corresponding path program 1 times [2025-02-08 08:29:24,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:24,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668327388] [2025-02-08 08:29:24,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:24,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:24,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:29:24,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:29:24,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:24,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:24,923 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:29:24,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668327388] [2025-02-08 08:29:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668327388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:24,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:29:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803251323] [2025-02-08 08:29:24,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:24,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:29:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:24,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:29:24,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:29:25,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2025-02-08 08:29:25,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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:29:25,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:25,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2025-02-08 08:29:25,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:25,137 INFO L124 PetriNetUnfolderBase]: 63/238 cut-off events. [2025-02-08 08:29:25,138 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-08 08:29:25,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 238 events. 63/238 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1106 event pairs, 62 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 418. Up to 146 conditions per place. [2025-02-08 08:29:25,140 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 20 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2025-02-08 08:29:25,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 51 transitions, 185 flow [2025-02-08 08:29:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:29:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:29:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2025-02-08 08:29:25,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-02-08 08:29:25,142 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 135 flow. Second operand 5 states and 225 transitions. [2025-02-08 08:29:25,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 51 transitions, 185 flow [2025-02-08 08:29:25,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 169 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:29:25,143 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 129 flow [2025-02-08 08:29:25,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2025-02-08 08:29:25,144 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2025-02-08 08:29:25,144 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 129 flow [2025-02-08 08:29:25,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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:29:25,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:25,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:25,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:29:25,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:25,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1409348918, now seen corresponding path program 1 times [2025-02-08 08:29:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:25,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409647104] [2025-02-08 08:29:25,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:25,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:29:25,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:29:25,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:25,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:25,212 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:29:25,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:25,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409647104] [2025-02-08 08:29:25,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409647104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:25,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:25,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:29:25,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171340224] [2025-02-08 08:29:25,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:25,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:29:25,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:25,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:29:25,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:29:25,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 69 [2025-02-08 08:29:25,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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:29:25,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:25,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 69 [2025-02-08 08:29:25,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:25,400 INFO L124 PetriNetUnfolderBase]: 63/237 cut-off events. [2025-02-08 08:29:25,400 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 08:29:25,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 237 events. 63/237 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1107 event pairs, 62 based on Foata normal form. 1/199 useless extension candidates. Maximal degree in co-relation 408. Up to 146 conditions per place. [2025-02-08 08:29:25,406 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 22 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2025-02-08 08:29:25,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 183 flow [2025-02-08 08:29:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:29:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:29:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2025-02-08 08:29:25,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6289855072463768 [2025-02-08 08:29:25,407 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 129 flow. Second operand 5 states and 217 transitions. [2025-02-08 08:29:25,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 183 flow [2025-02-08 08:29:25,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 171 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:29:25,408 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 127 flow [2025-02-08 08:29:25,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=5, PETRI_FLOW=127, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2025-02-08 08:29:25,408 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2025-02-08 08:29:25,408 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 127 flow [2025-02-08 08:29:25,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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:29:25,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:25,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:25,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:29:25,409 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:25,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2140286039, now seen corresponding path program 1 times [2025-02-08 08:29:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:25,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912387550] [2025-02-08 08:29:25,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:25,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:29:25,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:29:25,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:25,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:25,475 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:29:25,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:25,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912387550] [2025-02-08 08:29:25,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912387550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:25,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:25,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:29:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120315903] [2025-02-08 08:29:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:25,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:29:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:25,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:29:25,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:29:25,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2025-02-08 08:29:25,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:29:25,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:25,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2025-02-08 08:29:25,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:25,581 INFO L124 PetriNetUnfolderBase]: 70/253 cut-off events. [2025-02-08 08:29:25,581 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 08:29:25,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 253 events. 70/253 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1178 event pairs, 51 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 439. Up to 136 conditions per place. [2025-02-08 08:29:25,582 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 31 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-02-08 08:29:25,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 207 flow [2025-02-08 08:29:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:29:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:29:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-02-08 08:29:25,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7729468599033816 [2025-02-08 08:29:25,583 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 127 flow. Second operand 3 states and 160 transitions. [2025-02-08 08:29:25,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 207 flow [2025-02-08 08:29:25,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:29:25,584 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 117 flow [2025-02-08 08:29:25,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-02-08 08:29:25,585 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2025-02-08 08:29:25,585 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 117 flow [2025-02-08 08:29:25,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:29:25,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:25,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:25,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:29:25,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:25,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:25,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2140286040, now seen corresponding path program 1 times [2025-02-08 08:29:25,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:25,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248193394] [2025-02-08 08:29:25,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:25,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:25,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:29:25,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:29:25,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:25,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:25,682 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:29:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:25,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248193394] [2025-02-08 08:29:25,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248193394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:25,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:25,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:29:25,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960735525] [2025-02-08 08:29:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:25,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:29:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:25,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:29:25,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:29:25,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 69 [2025-02-08 08:29:25,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:25,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:25,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 69 [2025-02-08 08:29:25,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:25,791 INFO L124 PetriNetUnfolderBase]: 63/231 cut-off events. [2025-02-08 08:29:25,792 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-02-08 08:29:25,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 231 events. 63/231 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1037 event pairs, 50 based on Foata normal form. 16/217 useless extension candidates. Maximal degree in co-relation 413. Up to 136 conditions per place. [2025-02-08 08:29:25,793 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 30 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-02-08 08:29:25,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 195 flow [2025-02-08 08:29:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:29:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:29:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-02-08 08:29:25,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2025-02-08 08:29:25,794 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 117 flow. Second operand 3 states and 162 transitions. [2025-02-08 08:29:25,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 195 flow [2025-02-08 08:29:25,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:29:25,795 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 113 flow [2025-02-08 08:29:25,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2025-02-08 08:29:25,796 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -20 predicate places. [2025-02-08 08:29:25,796 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 113 flow [2025-02-08 08:29:25,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:25,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:25,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:25,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:29:25,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:25,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1897400001, now seen corresponding path program 1 times [2025-02-08 08:29:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392071427] [2025-02-08 08:29:25,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:25,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:29:25,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:29:25,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:25,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:26,005 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:29:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:26,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392071427] [2025-02-08 08:29:26,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392071427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:29:26,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240229079] [2025-02-08 08:29:26,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:26,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:29:26,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:29:26,008 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:29:26,009 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:29:26,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:29:26,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:29:26,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:26,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:26,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 08:29:26,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:29:26,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 08:29:26,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-02-08 08:29:26,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2025-02-08 08:29:26,258 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:29:26,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:29:26,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240229079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:26,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:29:26,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 11 [2025-02-08 08:29:26,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750205963] [2025-02-08 08:29:26,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:26,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:29:26,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:26,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:29:26,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:29:26,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2025-02-08 08:29:26,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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:29:26,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:26,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2025-02-08 08:29:26,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:26,525 INFO L124 PetriNetUnfolderBase]: 78/273 cut-off events. [2025-02-08 08:29:26,526 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-08 08:29:26,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 273 events. 78/273 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1304 event pairs, 30 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 492. Up to 142 conditions per place. [2025-02-08 08:29:26,527 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 33 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2025-02-08 08:29:26,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 223 flow [2025-02-08 08:29:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:29:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:29:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 294 transitions. [2025-02-08 08:29:26,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7101449275362319 [2025-02-08 08:29:26,528 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 113 flow. Second operand 6 states and 294 transitions. [2025-02-08 08:29:26,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 223 flow [2025-02-08 08:29:26,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:29:26,529 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 145 flow [2025-02-08 08:29:26,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2025-02-08 08:29:26,530 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2025-02-08 08:29:26,530 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 145 flow [2025-02-08 08:29:26,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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:29:26,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:26,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:26,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:29:26,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 08:29:26,731 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:26,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1897400000, now seen corresponding path program 1 times [2025-02-08 08:29:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933223940] [2025-02-08 08:29:26,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:26,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:29:26,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:29:26,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:26,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:26,810 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:29:26,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933223940] [2025-02-08 08:29:26,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933223940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:26,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:26,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:29:26,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602522475] [2025-02-08 08:29:26,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:26,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:29:26,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:26,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:29:26,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:29:26,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2025-02-08 08:29:26,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 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:29:26,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:26,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2025-02-08 08:29:26,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:27,052 INFO L124 PetriNetUnfolderBase]: 72/238 cut-off events. [2025-02-08 08:29:27,052 INFO L125 PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES. [2025-02-08 08:29:27,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 238 events. 72/238 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1018 event pairs, 47 based on Foata normal form. 10/225 useless extension candidates. Maximal degree in co-relation 483. Up to 125 conditions per place. [2025-02-08 08:29:27,053 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 35 selfloop transitions, 9 changer transitions 3/64 dead transitions. [2025-02-08 08:29:27,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 269 flow [2025-02-08 08:29:27,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:29:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:29:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2025-02-08 08:29:27,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6884057971014492 [2025-02-08 08:29:27,055 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 145 flow. Second operand 6 states and 285 transitions. [2025-02-08 08:29:27,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 269 flow [2025-02-08 08:29:27,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 257 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:29:27,056 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 149 flow [2025-02-08 08:29:27,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-02-08 08:29:27,057 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2025-02-08 08:29:27,058 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 149 flow [2025-02-08 08:29:27,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 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:29:27,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:27,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:27,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:29:27,059 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:27,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:27,059 INFO L85 PathProgramCache]: Analyzing trace with hash -474439464, now seen corresponding path program 1 times [2025-02-08 08:29:27,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:27,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747129047] [2025-02-08 08:29:27,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:27,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:27,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:29:27,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:29:27,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:27,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:27,335 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:29:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:27,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747129047] [2025-02-08 08:29:27,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747129047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:27,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:27,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:29:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723531685] [2025-02-08 08:29:27,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:27,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:29:27,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:27,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:29:27,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:29:27,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 69 [2025-02-08 08:29:27,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 7 states have internal predecessors, (272), 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:29:27,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:27,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 69 [2025-02-08 08:29:27,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:27,705 INFO L124 PetriNetUnfolderBase]: 72/248 cut-off events. [2025-02-08 08:29:27,705 INFO L125 PetriNetUnfolderBase]: For 109/115 co-relation queries the response was YES. [2025-02-08 08:29:27,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 248 events. 72/248 cut-off events. For 109/115 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1136 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 506. Up to 136 conditions per place. [2025-02-08 08:29:27,707 INFO L140 encePairwiseOnDemand]: 64/69 looper letters, 40 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-02-08 08:29:27,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 300 flow [2025-02-08 08:29:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:29:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:29:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2025-02-08 08:29:27,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6579710144927536 [2025-02-08 08:29:27,708 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 149 flow. Second operand 5 states and 227 transitions. [2025-02-08 08:29:27,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 300 flow [2025-02-08 08:29:27,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 270 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 08:29:27,709 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 141 flow [2025-02-08 08:29:27,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2025-02-08 08:29:27,711 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -17 predicate places. [2025-02-08 08:29:27,711 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 141 flow [2025-02-08 08:29:27,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 7 states have internal predecessors, (272), 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:29:27,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:27,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:27,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:29:27,712 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1310141726, now seen corresponding path program 1 times [2025-02-08 08:29:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:27,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753510930] [2025-02-08 08:29:27,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:27,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:27,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:29:27,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:29:27,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:27,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:28,491 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:29:28,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:28,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753510930] [2025-02-08 08:29:28,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753510930] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:29:28,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236845894] [2025-02-08 08:29:28,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:28,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:29:28,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:29:28,493 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:29:28,495 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:29:28,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:29:28,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:29:28,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:28,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:28,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-08 08:29:28,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:29:28,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:29:28,685 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-02-08 08:29:28,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-02-08 08:29:28,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:29:28,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 08:29:28,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-02-08 08:29:28,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-02-08 08:29:28,899 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-02-08 08:29:28,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 121 [2025-02-08 08:29:28,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 29 [2025-02-08 08:29:28,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 58 [2025-02-08 08:29:28,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 34 [2025-02-08 08:29:29,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 08:29:29,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 08:29:29,012 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:29:29,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:29:29,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:29:29,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2025-02-08 08:29:29,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:29:29,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2025-02-08 08:29:29,218 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 15 treesize of output 3 [2025-02-08 08:29:29,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:29:29,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 78 [2025-02-08 08:29:29,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:29:29,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 68 [2025-02-08 08:29:29,252 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 08:29:29,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:29:29,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2025-02-08 08:29:29,259 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 08:29:29,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:29:29,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 12 [2025-02-08 08:29:29,429 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:29:29,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236845894] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:29:29,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:29:29,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2025-02-08 08:29:29,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391470226] [2025-02-08 08:29:29,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:29:29,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 08:29:29,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:29,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 08:29:29,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=782, Unknown=12, NotChecked=0, Total=870 [2025-02-08 08:29:31,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 69 [2025-02-08 08:29:31,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 141 flow. Second operand has 30 states, 30 states have (on average 3.566666666666667) internal successors, (107), 30 states have internal predecessors, (107), 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:29:31,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:31,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 69 [2025-02-08 08:29:31,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:32,211 INFO L124 PetriNetUnfolderBase]: 291/632 cut-off events. [2025-02-08 08:29:32,211 INFO L125 PetriNetUnfolderBase]: For 107/110 co-relation queries the response was YES. [2025-02-08 08:29:32,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 632 events. 291/632 cut-off events. For 107/110 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3077 event pairs, 82 based on Foata normal form. 3/453 useless extension candidates. Maximal degree in co-relation 1430. Up to 287 conditions per place. [2025-02-08 08:29:32,216 INFO L140 encePairwiseOnDemand]: 55/69 looper letters, 86 selfloop transitions, 24 changer transitions 0/111 dead transitions. [2025-02-08 08:29:32,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 111 transitions, 520 flow [2025-02-08 08:29:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 08:29:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 08:29:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2025-02-08 08:29:32,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.12531969309462915 [2025-02-08 08:29:32,218 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 141 flow. Second operand 17 states and 147 transitions. [2025-02-08 08:29:32,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 111 transitions, 520 flow [2025-02-08 08:29:32,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 111 transitions, 496 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:29:32,221 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 248 flow [2025-02-08 08:29:32,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=248, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2025-02-08 08:29:32,221 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2025-02-08 08:29:32,221 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 248 flow [2025-02-08 08:29:32,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.566666666666667) internal successors, (107), 30 states have internal predecessors, (107), 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:29:32,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:32,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:32,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:29:32,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:29:32,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:32,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1310141727, now seen corresponding path program 1 times [2025-02-08 08:29:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:32,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739540122] [2025-02-08 08:29:32,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:32,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:29:32,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:29:32,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:32,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:32,837 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:29:32,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:32,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739540122] [2025-02-08 08:29:32,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739540122] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:29:32,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012219593] [2025-02-08 08:29:32,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:32,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:29:32,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:29:32,842 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:29:32,844 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:29:32,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:29:32,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:29:32,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:32,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:32,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 08:29:32,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:29:32,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:29:32,985 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-02-08 08:29:32,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-02-08 08:29:32,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 08:29:33,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-02-08 08:29:33,083 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-02-08 08:29:33,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 89 [2025-02-08 08:29:33,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 41 [2025-02-08 08:29:33,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2025-02-08 08:29:33,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 08:29:33,171 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:29:33,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:29:33,227 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-02-08 08:29:33,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2025-02-08 08:29:33,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:29:33,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2025-02-08 08:29:33,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:29:33,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 75 [2025-02-08 08:29:33,270 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 15 treesize of output 3 [2025-02-08 08:29:33,320 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:29:33,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012219593] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:29:33,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:29:33,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-02-08 08:29:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740179045] [2025-02-08 08:29:33,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:29:33,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 08:29:33,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:33,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 08:29:33,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=621, Unknown=6, NotChecked=0, Total=702 [2025-02-08 08:29:34,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 69 [2025-02-08 08:29:34,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 248 flow. Second operand has 27 states, 27 states have (on average 8.555555555555555) internal successors, (231), 27 states have internal predecessors, (231), 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:29:34,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:34,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 69 [2025-02-08 08:29:34,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:35,338 INFO L124 PetriNetUnfolderBase]: 220/515 cut-off events. [2025-02-08 08:29:35,338 INFO L125 PetriNetUnfolderBase]: For 331/336 co-relation queries the response was YES. [2025-02-08 08:29:35,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 515 events. 220/515 cut-off events. For 331/336 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2438 event pairs, 66 based on Foata normal form. 16/474 useless extension candidates. Maximal degree in co-relation 1290. Up to 227 conditions per place. [2025-02-08 08:29:35,340 INFO L140 encePairwiseOnDemand]: 56/69 looper letters, 57 selfloop transitions, 21 changer transitions 0/82 dead transitions. [2025-02-08 08:29:35,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 82 transitions, 458 flow [2025-02-08 08:29:35,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:29:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:29:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2025-02-08 08:29:35,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19894598155467721 [2025-02-08 08:29:35,342 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 248 flow. Second operand 11 states and 151 transitions. [2025-02-08 08:29:35,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 82 transitions, 458 flow [2025-02-08 08:29:35,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 82 transitions, 429 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-02-08 08:29:35,344 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 275 flow [2025-02-08 08:29:35,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=275, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2025-02-08 08:29:35,345 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2025-02-08 08:29:35,345 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 275 flow [2025-02-08 08:29:35,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.555555555555555) internal successors, (231), 27 states have internal predecessors, (231), 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:29:35,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:35,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:35,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:29:35,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:29:35,546 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:35,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1639967184, now seen corresponding path program 1 times [2025-02-08 08:29:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522703290] [2025-02-08 08:29:35,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:35,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:29:35,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:29:35,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:35,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:35,601 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:29:35,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:35,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522703290] [2025-02-08 08:29:35,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522703290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:35,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:35,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:29:35,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182844458] [2025-02-08 08:29:35,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:35,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:29:35,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:35,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:29:35,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:29:35,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 69 [2025-02-08 08:29:35,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:29:35,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:35,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 69 [2025-02-08 08:29:35,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:35,662 INFO L124 PetriNetUnfolderBase]: 39/175 cut-off events. [2025-02-08 08:29:35,662 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2025-02-08 08:29:35,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 175 events. 39/175 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 651 event pairs, 11 based on Foata normal form. 9/164 useless extension candidates. Maximal degree in co-relation 418. Up to 67 conditions per place. [2025-02-08 08:29:35,663 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 31 selfloop transitions, 4 changer transitions 2/58 dead transitions. [2025-02-08 08:29:35,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 58 transitions, 330 flow [2025-02-08 08:29:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:29:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:29:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-02-08 08:29:35,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8019323671497585 [2025-02-08 08:29:35,664 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 275 flow. Second operand 3 states and 166 transitions. [2025-02-08 08:29:35,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 58 transitions, 330 flow [2025-02-08 08:29:35,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 273 flow, removed 4 selfloop flow, removed 14 redundant places. [2025-02-08 08:29:35,666 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 180 flow [2025-02-08 08:29:35,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2025-02-08 08:29:35,667 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-02-08 08:29:35,667 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 180 flow [2025-02-08 08:29:35,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:29:35,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:35,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:35,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:29:35,668 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-08 08:29:35,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1822721060, now seen corresponding path program 1 times [2025-02-08 08:29:35,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:35,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778142686] [2025-02-08 08:29:35,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:35,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:29:35,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:29:35,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:35,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:29:35,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:29:35,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:29:35,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:29:35,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:35,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:29:35,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:29:35,854 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:29:35,854 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2025-02-08 08:29:35,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-02-08 08:29:35,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-02-08 08:29:35,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-02-08 08:29:35,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-02-08 08:29:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-02-08 08:29:35,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-02-08 08:29:35,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-02-08 08:29:35,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2025-02-08 08:29:35,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:29:35,859 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:35,883 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:29:35,883 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:29:35,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:29:35 BasicIcfg [2025-02-08 08:29:35,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:29:35,887 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:29:35,887 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:29:35,887 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:29:35,889 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:29:21" (3/4) ... [2025-02-08 08:29:35,889 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 08:29:35,938 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 16. [2025-02-08 08:29:35,976 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:29:35,976 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:29:35,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:29:35,977 INFO L158 Benchmark]: Toolchain (without parser) took 15336.26ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 126.7MB in the beginning and 203.1MB in the end (delta: -76.4MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. [2025-02-08 08:29:35,977 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:29:35,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.08ms. Allocated memory is still 167.8MB. Free memory was 126.7MB in the beginning and 88.5MB in the end (delta: 38.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 08:29:35,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.30ms. Allocated memory is still 167.8MB. Free memory was 88.5MB in the beginning and 86.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:29:35,977 INFO L158 Benchmark]: Boogie Preprocessor took 40.43ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 83.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:29:35,978 INFO L158 Benchmark]: IcfgBuilder took 594.97ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 113.7MB in the end (delta: -30.8MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2025-02-08 08:29:35,978 INFO L158 Benchmark]: TraceAbstraction took 14062.55ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 112.8MB in the beginning and 68.1MB in the end (delta: 44.7MB). Peak memory consumption was 124.3MB. Max. memory is 16.1GB. [2025-02-08 08:29:35,978 INFO L158 Benchmark]: Witness Printer took 89.75ms. Allocated memory is still 251.7MB. Free memory was 68.1MB in the beginning and 203.1MB in the end (delta: -134.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:29:35,980 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.28ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.08ms. Allocated memory is still 167.8MB. Free memory was 126.7MB in the beginning and 88.5MB in the end (delta: 38.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.30ms. Allocated memory is still 167.8MB. Free memory was 88.5MB in the beginning and 86.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.43ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 83.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 594.97ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 113.7MB in the end (delta: -30.8MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14062.55ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 112.8MB in the beginning and 68.1MB in the end (delta: 44.7MB). Peak memory consumption was 124.3MB. Max. memory is 16.1GB. * Witness Printer took 89.75ms. Allocated memory is still 251.7MB. Free memory was 68.1MB in the beginning and 203.1MB in the end (delta: -134.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int j = __VERIFIER_nondet_int(); [L1255] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1255] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1256] 0 pthread_t t1; [L1257] 0 struct s *p; [L1258] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1258] RET, EXPR 0 new(1) [L1258] 0 slot[j] = new(1) [L1259] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1259] RET, EXPR 0 new(2) [L1259] EXPR 0 slot[j] [L1259] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1259] RET 0 list_add(new(2), slot[j]) [L1260] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=8, mutex={1:0}, slot={2:0}, t1=-1] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, i=0, mutex={1:0}, slot={2:0}] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1260]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 95 locations, 50 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: 13.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 58 mSolverCounterUnknown, 3085 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2292 mSDsluCounter, 2668 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2588 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13883 IncrementalHoareTripleChecker+Invalid, 14068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 80 mSDtfsCounter, 13883 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=15, InterpolantAutomatonStates: 92, 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.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 242 ConstructedInterpolants, 2 QuantifiedInterpolants, 4812 SizeOfPredicates, 53 NumberOfNonLiveVariables, 916 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 5/12 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-08 08:29:35,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)