./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:13:47,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:13:47,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:13:47,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:13:47,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:13:47,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:13:47,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:13:47,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:13:47,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:13:47,720 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:13:47,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:13:47,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:13:47,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:13:47,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:13:47,721 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:13:47,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:13:47,721 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:13:47,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:13:47,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:13:47,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:13:47,721 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:13:47,722 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:13:47,722 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:13:47,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:13:47,722 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:13:47,722 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:13:47,722 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:13:47,722 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:13:47,722 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:13:47,722 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:13:47,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:13:47,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:13:47,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:13:47,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:47,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:13:47,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:13:47,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:13:47,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:13:47,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:13:47,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:13:47,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:13:47,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:13:47,723 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/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 -> 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb [2025-03-09 01:13:47,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:13:47,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:13:47,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:13:47,963 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:13:47,963 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:13:47,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i [2025-03-09 01:13:49,102 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad37e30e/aa4cd2779b634ae2a312a33eabc0bce2/FLAG76b8e4c28 [2025-03-09 01:13:49,374 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:13:49,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i [2025-03-09 01:13:49,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad37e30e/aa4cd2779b634ae2a312a33eabc0bce2/FLAG76b8e4c28 [2025-03-09 01:13:49,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad37e30e/aa4cd2779b634ae2a312a33eabc0bce2 [2025-03-09 01:13:49,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:13:49,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:13:49,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:49,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:13:49,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:13:49,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:49" (1/1) ... [2025-03-09 01:13:49,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c61e2f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:49, skipping insertion in model container [2025-03-09 01:13:49,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:49" (1/1) ... [2025-03-09 01:13:49,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:13:49,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:50,010 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:13:50,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:50,121 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:13:50,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50 WrapperNode [2025-03-09 01:13:50,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:50,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:50,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:13:50,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:13:50,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,165 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 174 [2025-03-09 01:13:50,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:50,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:13:50,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:13:50,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:13:50,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,197 INFO L175 MemorySlicer]: Split 78 memory accesses to 2 slices as follows [64, 14]. 82 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60, 0]. The 11 writes are split as follows [1, 10]. [2025-03-09 01:13:50,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:13:50,219 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:13:50,219 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:13:50,219 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:13:50,219 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (1/1) ... [2025-03-09 01:13:50,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:50,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:50,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:13:50,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:13:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:13:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 01:13:50,261 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 01:13:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:13:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:13:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:13:50,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:13:50,262 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:13:50,370 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:13:50,372 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:13:50,771 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:13:50,772 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:13:50,993 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:13:50,994 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:13:50,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:50 BoogieIcfgContainer [2025-03-09 01:13:50,994 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:13:50,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:13:50,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:13:50,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:13:50,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:13:49" (1/3) ... [2025-03-09 01:13:51,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e54e823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:51, skipping insertion in model container [2025-03-09 01:13:51,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:50" (2/3) ... [2025-03-09 01:13:51,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e54e823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:51, skipping insertion in model container [2025-03-09 01:13:51,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:50" (3/3) ... [2025-03-09 01:13:51,001 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr-deref.i [2025-03-09 01:13:51,017 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:13:51,018 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_19-nested_nr-deref.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 37 error locations. [2025-03-09 01:13:51,018 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:13:51,053 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:13:51,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 146 flow [2025-03-09 01:13:51,112 INFO L124 PetriNetUnfolderBase]: 1/70 cut-off events. [2025-03-09 01:13:51,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:51,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 160 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-03-09 01:13:51,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 146 flow [2025-03-09 01:13:51,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 70 transitions, 143 flow [2025-03-09 01:13:51,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:13:51,138 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;@5f5e38ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:13:51,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-09 01:13:51,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:13:51,144 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:13:51,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:51,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:51,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:13:51,146 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-03-09 01:13:51,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash 507005, now seen corresponding path program 1 times [2025-03-09 01:13:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:51,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498130252] [2025-03-09 01:13:51,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:51,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:51,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:13:51,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:13:51,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:51,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:51,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498130252] [2025-03-09 01:13:51,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498130252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:51,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:51,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267971098] [2025-03-09 01:13:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:51,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:51,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:51,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:51,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-03-09 01:13:51,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-03-09 01:13:51,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:51,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-03-09 01:13:51,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:51,522 INFO L124 PetriNetUnfolderBase]: 64/266 cut-off events. [2025-03-09 01:13:51,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:51,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 266 events. 64/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1206 event pairs, 63 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 376. Up to 153 conditions per place. [2025-03-09 01:13:51,525 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-03-09 01:13:51,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 199 flow [2025-03-09 01:13:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-03-09 01:13:51,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7652582159624414 [2025-03-09 01:13:51,535 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 143 flow. Second operand 3 states and 163 transitions. [2025-03-09 01:13:51,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 199 flow [2025-03-09 01:13:51,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:51,544 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 154 flow [2025-03-09 01:13:51,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-03-09 01:13:51,549 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2025-03-09 01:13:51,549 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 154 flow [2025-03-09 01:13:51,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-03-09 01:13:51,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:51,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:13:51,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:13:51,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:51,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:51,551 INFO L85 PathProgramCache]: Analyzing trace with hash 15716752, now seen corresponding path program 1 times [2025-03-09 01:13:51,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:51,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043122019] [2025-03-09 01:13:51,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:51,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:51,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:13:51,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:13:51,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:51,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:51,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:51,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043122019] [2025-03-09 01:13:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043122019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:51,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152794379] [2025-03-09 01:13:51,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:51,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:51,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:51,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:51,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:13:51,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:13:51,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:13:51,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:51,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:51,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:13:51,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:51,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152794379] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:51,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:51,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:13:51,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570548782] [2025-03-09 01:13:51,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:51,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:51,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:51,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:51,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:51,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-03-09 01:13:51,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 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-03-09 01:13:51,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:51,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-03-09 01:13:51,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:51,935 INFO L124 PetriNetUnfolderBase]: 64/269 cut-off events. [2025-03-09 01:13:51,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:51,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 269 events. 64/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1206 event pairs, 63 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 428. Up to 153 conditions per place. [2025-03-09 01:13:51,939 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2025-03-09 01:13:51,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 226 flow [2025-03-09 01:13:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:13:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:13:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2025-03-09 01:13:51,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7112676056338029 [2025-03-09 01:13:51,944 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 154 flow. Second operand 6 states and 303 transitions. [2025-03-09 01:13:51,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 226 flow [2025-03-09 01:13:51,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 222 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:51,947 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 186 flow [2025-03-09 01:13:51,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2025-03-09 01:13:51,948 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places. [2025-03-09 01:13:51,948 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 186 flow [2025-03-09 01:13:51,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 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-03-09 01:13:51,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:51,949 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-03-09 01:13:51,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:13:52,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:52,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:52,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash 65923389, now seen corresponding path program 2 times [2025-03-09 01:13:52,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:52,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589682236] [2025-03-09 01:13:52,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:52,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:52,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-09 01:13:52,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 7 statements. [2025-03-09 01:13:52,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:13:52,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:13:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:52,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589682236] [2025-03-09 01:13:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589682236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:52,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:52,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922152960] [2025-03-09 01:13:52,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:52,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:52,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:52,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:52,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:52,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2025-03-09 01:13:52,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-03-09 01:13:52,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:52,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2025-03-09 01:13:52,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:52,383 INFO L124 PetriNetUnfolderBase]: 64/265 cut-off events. [2025-03-09 01:13:52,383 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:13:52,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 265 events. 64/265 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1186 event pairs, 63 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 417. Up to 155 conditions per place. [2025-03-09 01:13:52,385 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 28 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2025-03-09 01:13:52,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 242 flow [2025-03-09 01:13:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-03-09 01:13:52,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2025-03-09 01:13:52,387 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 186 flow. Second operand 3 states and 149 transitions. [2025-03-09 01:13:52,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 242 flow [2025-03-09 01:13:52,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 70 transitions, 228 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:52,389 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 172 flow [2025-03-09 01:13:52,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2025-03-09 01:13:52,389 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2025-03-09 01:13:52,389 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 172 flow [2025-03-09 01:13:52,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-03-09 01:13:52,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:52,390 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-03-09 01:13:52,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:13:52,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:52,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash 65923390, now seen corresponding path program 1 times [2025-03-09 01:13:52,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:52,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787523481] [2025-03-09 01:13:52,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:52,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:52,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:13:52,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:13:52,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:52,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:52,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:52,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787523481] [2025-03-09 01:13:52,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787523481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:52,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055761065] [2025-03-09 01:13:52,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:52,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:52,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:52,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:52,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:13:52,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:13:52,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:13:52,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:52,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:52,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:13:52,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:52,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:52,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055761065] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:52,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:52,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 01:13:52,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931310670] [2025-03-09 01:13:52,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:52,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:13:52,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:52,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:13:52,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:13:52,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-03-09 01:13:52,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 172 flow. Second operand has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 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-03-09 01:13:52,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:52,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-03-09 01:13:52,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:52,819 INFO L124 PetriNetUnfolderBase]: 64/271 cut-off events. [2025-03-09 01:13:52,819 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-09 01:13:52,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 271 events. 64/271 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1186 event pairs, 63 based on Foata normal form. 6/219 useless extension candidates. Maximal degree in co-relation 419. Up to 153 conditions per place. [2025-03-09 01:13:52,821 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2025-03-09 01:13:52,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 280 flow [2025-03-09 01:13:52,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:13:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:13:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 582 transitions. [2025-03-09 01:13:52,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6830985915492958 [2025-03-09 01:13:52,824 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 172 flow. Second operand 12 states and 582 transitions. [2025-03-09 01:13:52,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 280 flow [2025-03-09 01:13:52,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 76 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:52,826 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 248 flow [2025-03-09 01:13:52,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=248, PETRI_PLACES=94, PETRI_TRANSITIONS=76} [2025-03-09 01:13:52,827 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2025-03-09 01:13:52,827 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 248 flow [2025-03-09 01:13:52,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 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-03-09 01:13:52,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:52,827 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2025-03-09 01:13:52,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:13:53,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 01:13:53,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:53,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash -27658146, now seen corresponding path program 2 times [2025-03-09 01:13:53,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:53,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778462815] [2025-03-09 01:13:53,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:53,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:13:53,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 13 statements. [2025-03-09 01:13:53,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:13:53,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:53,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:53,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778462815] [2025-03-09 01:13:53,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778462815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:53,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:53,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:53,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460728435] [2025-03-09 01:13:53,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:53,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:53,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:53,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:53,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:53,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 71 [2025-03-09 01:13:53,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-03-09 01:13:53,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:53,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 71 [2025-03-09 01:13:53,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:53,258 INFO L124 PetriNetUnfolderBase]: 64/267 cut-off events. [2025-03-09 01:13:53,258 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-09 01:13:53,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 267 events. 64/267 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1184 event pairs, 63 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 417. Up to 161 conditions per place. [2025-03-09 01:13:53,264 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 32 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-03-09 01:13:53,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 72 transitions, 312 flow [2025-03-09 01:13:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-03-09 01:13:53,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7183098591549296 [2025-03-09 01:13:53,265 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 248 flow. Second operand 3 states and 153 transitions. [2025-03-09 01:13:53,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 72 transitions, 312 flow [2025-03-09 01:13:53,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 72 transitions, 264 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-09 01:13:53,269 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 200 flow [2025-03-09 01:13:53,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2025-03-09 01:13:53,270 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2025-03-09 01:13:53,270 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 200 flow [2025-03-09 01:13:53,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-03-09 01:13:53,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:53,270 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-09 01:13:53,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:13:53,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:53,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:53,273 INFO L85 PathProgramCache]: Analyzing trace with hash -809660835, now seen corresponding path program 1 times [2025-03-09 01:13:53,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:53,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675506018] [2025-03-09 01:13:53,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:53,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:53,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:13:53,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:13:53,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:53,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:53,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:53,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675506018] [2025-03-09 01:13:53,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675506018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:53,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:53,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:53,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762282480] [2025-03-09 01:13:53,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:53,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:13:53,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:53,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:13:53,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:13:53,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-03-09 01:13:53,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 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-03-09 01:13:53,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:53,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-03-09 01:13:53,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:53,681 INFO L124 PetriNetUnfolderBase]: 73/289 cut-off events. [2025-03-09 01:13:53,682 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-09 01:13:53,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 289 events. 73/289 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1305 event pairs, 72 based on Foata normal form. 1/238 useless extension candidates. Maximal degree in co-relation 464. Up to 183 conditions per place. [2025-03-09 01:13:53,684 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 38 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2025-03-09 01:13:53,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 68 transitions, 270 flow [2025-03-09 01:13:53,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-03-09 01:13:53,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2025-03-09 01:13:53,686 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 200 flow. Second operand 3 states and 147 transitions. [2025-03-09 01:13:53,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 68 transitions, 270 flow [2025-03-09 01:13:53,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:53,689 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 186 flow [2025-03-09 01:13:53,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2025-03-09 01:13:53,691 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2025-03-09 01:13:53,691 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 186 flow [2025-03-09 01:13:53,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 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-03-09 01:13:53,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:53,691 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-09 01:13:53,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:13:53,692 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:53,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:53,692 INFO L85 PathProgramCache]: Analyzing trace with hash -809660834, now seen corresponding path program 1 times [2025-03-09 01:13:53,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:53,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358304313] [2025-03-09 01:13:53,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:53,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:53,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:13:53,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:13:53,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:53,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:53,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:53,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358304313] [2025-03-09 01:13:53,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358304313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:53,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:53,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:13:53,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27970525] [2025-03-09 01:13:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:53,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:53,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:53,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:53,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:54,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-03-09 01:13:54,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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-03-09 01:13:54,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:54,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-03-09 01:13:54,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:54,197 INFO L124 PetriNetUnfolderBase]: 64/255 cut-off events. [2025-03-09 01:13:54,198 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-09 01:13:54,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 255 events. 64/255 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1098 event pairs, 54 based on Foata normal form. 9/218 useless extension candidates. Maximal degree in co-relation 439. Up to 129 conditions per place. [2025-03-09 01:13:54,199 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 36 selfloop transitions, 6 changer transitions 3/74 dead transitions. [2025-03-09 01:13:54,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 74 transitions, 288 flow [2025-03-09 01:13:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:13:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:13:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2025-03-09 01:13:54,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6422535211267606 [2025-03-09 01:13:54,200 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 186 flow. Second operand 5 states and 228 transitions. [2025-03-09 01:13:54,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 74 transitions, 288 flow [2025-03-09 01:13:54,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:54,202 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 191 flow [2025-03-09 01:13:54,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2025-03-09 01:13:54,203 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2025-03-09 01:13:54,203 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 191 flow [2025-03-09 01:13:54,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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-03-09 01:13:54,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:54,203 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:54,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:13:54,204 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:54,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2142074593, now seen corresponding path program 1 times [2025-03-09 01:13:54,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:54,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44921091] [2025-03-09 01:13:54,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:54,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:13:54,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:13:54,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:54,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:54,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:54,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44921091] [2025-03-09 01:13:54,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44921091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:54,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:54,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:13:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498353296] [2025-03-09 01:13:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:54,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:54,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:54,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:54,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:54,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2025-03-09 01:13:54,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 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-03-09 01:13:54,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:54,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2025-03-09 01:13:54,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:54,899 INFO L124 PetriNetUnfolderBase]: 64/253 cut-off events. [2025-03-09 01:13:54,899 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-09 01:13:54,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 253 events. 64/253 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1091 event pairs, 54 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 454. Up to 126 conditions per place. [2025-03-09 01:13:54,901 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 38 selfloop transitions, 7 changer transitions 3/72 dead transitions. [2025-03-09 01:13:54,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 72 transitions, 301 flow [2025-03-09 01:13:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:13:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:13:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 292 transitions. [2025-03-09 01:13:54,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5875251509054326 [2025-03-09 01:13:54,902 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 191 flow. Second operand 7 states and 292 transitions. [2025-03-09 01:13:54,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 72 transitions, 301 flow [2025-03-09 01:13:54,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 72 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:13:54,904 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 189 flow [2025-03-09 01:13:54,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2025-03-09 01:13:54,905 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2025-03-09 01:13:54,906 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 189 flow [2025-03-09 01:13:54,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 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-03-09 01:13:54,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:54,906 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:54,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:13:54,906 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:54,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:54,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2142074592, now seen corresponding path program 1 times [2025-03-09 01:13:54,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:54,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387151475] [2025-03-09 01:13:54,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:54,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:54,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:13:54,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:13:54,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:54,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:55,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:55,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387151475] [2025-03-09 01:13:55,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387151475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:55,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:55,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:13:55,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587404829] [2025-03-09 01:13:55,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:55,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:55,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:55,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:55,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:55,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 71 [2025-03-09 01:13:55,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 189 flow. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 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-03-09 01:13:55,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:55,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 71 [2025-03-09 01:13:55,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:55,675 INFO L124 PetriNetUnfolderBase]: 64/251 cut-off events. [2025-03-09 01:13:55,675 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-09 01:13:55,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 251 events. 64/251 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1089 event pairs, 54 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 453. Up to 126 conditions per place. [2025-03-09 01:13:55,676 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 37 selfloop transitions, 7 changer transitions 3/70 dead transitions. [2025-03-09 01:13:55,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 70 transitions, 297 flow [2025-03-09 01:13:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:13:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:13:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 270 transitions. [2025-03-09 01:13:55,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432595573440644 [2025-03-09 01:13:55,680 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 189 flow. Second operand 7 states and 270 transitions. [2025-03-09 01:13:55,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 70 transitions, 297 flow [2025-03-09 01:13:55,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 70 transitions, 283 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:13:55,681 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 185 flow [2025-03-09 01:13:55,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2025-03-09 01:13:55,682 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 8 predicate places. [2025-03-09 01:13:55,682 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 185 flow [2025-03-09 01:13:55,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 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-03-09 01:13:55,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:55,683 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:55,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:13:55,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:55,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:55,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1244331390, now seen corresponding path program 1 times [2025-03-09 01:13:55,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:55,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288589239] [2025-03-09 01:13:55,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:55,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:55,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:13:55,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:13:55,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:55,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:55,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:55,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288589239] [2025-03-09 01:13:55,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288589239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:55,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:55,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:55,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056125515] [2025-03-09 01:13:55,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:55,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:55,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:55,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:55,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:55,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 71 [2025-03-09 01:13:55,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-03-09 01:13:55,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:55,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 71 [2025-03-09 01:13:55,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:56,017 INFO L124 PetriNetUnfolderBase]: 64/250 cut-off events. [2025-03-09 01:13:56,018 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-03-09 01:13:56,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 250 events. 64/250 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1083 event pairs, 63 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 450. Up to 158 conditions per place. [2025-03-09 01:13:56,019 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 30 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-03-09 01:13:56,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 60 transitions, 255 flow [2025-03-09 01:13:56,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:13:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:13:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2025-03-09 01:13:56,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957746478873239 [2025-03-09 01:13:56,020 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 185 flow. Second operand 5 states and 247 transitions. [2025-03-09 01:13:56,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 60 transitions, 255 flow [2025-03-09 01:13:56,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 60 transitions, 241 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:13:56,022 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 181 flow [2025-03-09 01:13:56,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2025-03-09 01:13:56,022 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-03-09 01:13:56,022 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 181 flow [2025-03-09 01:13:56,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-03-09 01:13:56,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:56,022 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:56,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:13:56,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:56,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:56,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1244331391, now seen corresponding path program 1 times [2025-03-09 01:13:56,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:56,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877218057] [2025-03-09 01:13:56,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:56,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:56,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:13:56,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:13:56,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:56,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-09 01:13:56,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:56,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877218057] [2025-03-09 01:13:56,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877218057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:56,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:56,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535743310] [2025-03-09 01:13:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:56,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:56,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:56,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:56,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-03-09 01:13:56,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-03-09 01:13:56,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:56,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-03-09 01:13:56,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:56,323 INFO L124 PetriNetUnfolderBase]: 64/249 cut-off events. [2025-03-09 01:13:56,323 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-09 01:13:56,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 249 events. 64/249 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1086 event pairs, 63 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 441. Up to 158 conditions per place. [2025-03-09 01:13:56,324 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 32 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2025-03-09 01:13:56,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 59 transitions, 255 flow [2025-03-09 01:13:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:13:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:13:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-03-09 01:13:56,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6169014084507042 [2025-03-09 01:13:56,326 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 181 flow. Second operand 5 states and 219 transitions. [2025-03-09 01:13:56,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 59 transitions, 255 flow [2025-03-09 01:13:56,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 59 transitions, 243 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:13:56,327 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 179 flow [2025-03-09 01:13:56,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2025-03-09 01:13:56,328 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2025-03-09 01:13:56,329 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 179 flow [2025-03-09 01:13:56,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-03-09 01:13:56,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:56,329 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:56,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:13:56,329 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:56,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash 237827306, now seen corresponding path program 1 times [2025-03-09 01:13:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127834256] [2025-03-09 01:13:56,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:56,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:13:56,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:13:56,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:56,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-09 01:13:56,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:56,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127834256] [2025-03-09 01:13:56,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127834256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:56,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:56,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:56,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354897891] [2025-03-09 01:13:56,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:56,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:56,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:56,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:56,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:56,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 71 [2025-03-09 01:13:56,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-03-09 01:13:56,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:56,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 71 [2025-03-09 01:13:56,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:56,498 INFO L124 PetriNetUnfolderBase]: 71/259 cut-off events. [2025-03-09 01:13:56,498 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-09 01:13:56,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 259 events. 71/259 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1126 event pairs, 56 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 464. Up to 148 conditions per place. [2025-03-09 01:13:56,500 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-03-09 01:13:56,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 64 transitions, 277 flow [2025-03-09 01:13:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-03-09 01:13:56,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605633802816901 [2025-03-09 01:13:56,501 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 179 flow. Second operand 3 states and 162 transitions. [2025-03-09 01:13:56,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 64 transitions, 277 flow [2025-03-09 01:13:56,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 265 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:13:56,502 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 167 flow [2025-03-09 01:13:56,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2025-03-09 01:13:56,502 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2025-03-09 01:13:56,502 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 167 flow [2025-03-09 01:13:56,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-03-09 01:13:56,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:56,503 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:56,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:13:56,503 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:56,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:56,503 INFO L85 PathProgramCache]: Analyzing trace with hash 237827307, now seen corresponding path program 1 times [2025-03-09 01:13:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:56,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445582741] [2025-03-09 01:13:56,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:56,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:13:56,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:13:56,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:56,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-09 01:13:56,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445582741] [2025-03-09 01:13:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445582741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:56,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:56,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:56,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186828328] [2025-03-09 01:13:56,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:56,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:56,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:56,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:56,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 71 [2025-03-09 01:13:56,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-03-09 01:13:56,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:56,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 71 [2025-03-09 01:13:56,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:56,697 INFO L124 PetriNetUnfolderBase]: 64/236 cut-off events. [2025-03-09 01:13:56,698 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-09 01:13:56,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 236 events. 64/236 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 957 event pairs, 56 based on Foata normal form. 16/223 useless extension candidates. Maximal degree in co-relation 436. Up to 148 conditions per place. [2025-03-09 01:13:56,699 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-03-09 01:13:56,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 263 flow [2025-03-09 01:13:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2025-03-09 01:13:56,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7699530516431925 [2025-03-09 01:13:56,700 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 167 flow. Second operand 3 states and 164 transitions. [2025-03-09 01:13:56,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 263 flow [2025-03-09 01:13:56,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:56,701 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 163 flow [2025-03-09 01:13:56,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2025-03-09 01:13:56,702 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2025-03-09 01:13:56,702 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 163 flow [2025-03-09 01:13:56,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-03-09 01:13:56,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:56,702 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:56,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:13:56,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:56,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1241814193, now seen corresponding path program 1 times [2025-03-09 01:13:56,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:56,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486750331] [2025-03-09 01:13:56,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:56,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:56,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:13:56,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:13:56,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:56,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486750331] [2025-03-09 01:13:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486750331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550120764] [2025-03-09 01:13:56,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:56,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:56,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:57,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:57,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:13:57,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:13:57,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:13:57,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:57,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:57,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 01:13:57,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:57,182 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-03-09 01:13:57,186 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-03-09 01:13:57,256 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-03-09 01:13:57,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-03-09 01:13:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:57,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:57,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:57,326 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 45 treesize of output 49 [2025-03-09 01:13:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:57,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550120764] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:57,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-03-09 01:13:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306131597] [2025-03-09 01:13:57,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:57,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:13:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:57,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:13:57,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:13:58,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-03-09 01:13:58,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 163 flow. Second operand has 19 states, 19 states have (on average 40.1578947368421) internal successors, (763), 19 states have internal predecessors, (763), 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-03-09 01:13:58,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:58,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-03-09 01:13:58,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:58,276 INFO L124 PetriNetUnfolderBase]: 85/291 cut-off events. [2025-03-09 01:13:58,276 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-09 01:13:58,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 291 events. 85/291 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1294 event pairs, 60 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 543. Up to 152 conditions per place. [2025-03-09 01:13:58,277 INFO L140 encePairwiseOnDemand]: 59/71 looper letters, 46 selfloop transitions, 11 changer transitions 3/74 dead transitions. [2025-03-09 01:13:58,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 329 flow [2025-03-09 01:13:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:13:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:13:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 431 transitions. [2025-03-09 01:13:58,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6070422535211267 [2025-03-09 01:13:58,278 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 163 flow. Second operand 10 states and 431 transitions. [2025-03-09 01:13:58,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 329 flow [2025-03-09 01:13:58,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:58,280 INFO L231 Difference]: Finished difference. Result has 79 places, 57 transitions, 194 flow [2025-03-09 01:13:58,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=194, PETRI_PLACES=79, PETRI_TRANSITIONS=57} [2025-03-09 01:13:58,280 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2025-03-09 01:13:58,280 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 57 transitions, 194 flow [2025-03-09 01:13:58,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 40.1578947368421) internal successors, (763), 19 states have internal predecessors, (763), 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-03-09 01:13:58,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:58,281 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:58,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:13:58,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:58,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:58,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1241814194, now seen corresponding path program 1 times [2025-03-09 01:13:58,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668662797] [2025-03-09 01:13:58,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:58,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:13:58,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:13:58,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:58,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-09 01:13:58,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:58,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668662797] [2025-03-09 01:13:58,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668662797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:58,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:58,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:13:58,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726661767] [2025-03-09 01:13:58,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:58,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:13:58,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:58,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:13:58,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:13:58,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2025-03-09 01:13:58,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 57 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 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-03-09 01:13:58,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:58,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2025-03-09 01:13:58,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:58,806 INFO L124 PetriNetUnfolderBase]: 79/269 cut-off events. [2025-03-09 01:13:58,806 INFO L125 PetriNetUnfolderBase]: For 98/104 co-relation queries the response was YES. [2025-03-09 01:13:58,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 269 events. 79/269 cut-off events. For 98/104 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1129 event pairs, 54 based on Foata normal form. 17/255 useless extension candidates. Maximal degree in co-relation 551. Up to 132 conditions per place. [2025-03-09 01:13:58,808 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 47 selfloop transitions, 7 changer transitions 3/73 dead transitions. [2025-03-09 01:13:58,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 342 flow [2025-03-09 01:13:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:13:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:13:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2025-03-09 01:13:58,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6737089201877934 [2025-03-09 01:13:58,811 INFO L175 Difference]: Start difference. First operand has 79 places, 57 transitions, 194 flow. Second operand 6 states and 287 transitions. [2025-03-09 01:13:58,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 342 flow [2025-03-09 01:13:58,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 323 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:13:58,814 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 187 flow [2025-03-09 01:13:58,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2025-03-09 01:13:58,814 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2025-03-09 01:13:58,814 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 187 flow [2025-03-09 01:13:58,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 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-03-09 01:13:58,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:58,815 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:58,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:13:58,815 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:58,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash 158466170, now seen corresponding path program 1 times [2025-03-09 01:13:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:58,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209050447] [2025-03-09 01:13:58,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:58,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:13:58,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:13:58,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:58,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:59,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209050447] [2025-03-09 01:13:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209050447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713734038] [2025-03-09 01:13:59,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:59,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:59,355 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:59,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:13:59,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:13:59,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:13:59,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:59,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:59,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-09 01:13:59,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:59,491 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-03-09 01:13:59,518 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-03-09 01:13:59,524 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-03-09 01:13:59,525 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-03-09 01:13:59,588 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-03-09 01:13:59,619 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-03-09 01:13:59,619 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-03-09 01:13:59,659 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-03-09 01:13:59,666 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-03-09 01:13:59,688 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-03-09 01:13:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:59,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:59,742 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-09 01:13:59,742 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-03-09 01:13:59,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (= (let ((.cse0 (+ |c_~#c~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_845) (select (select |c_#memory_$Pointer$#0.base| |c_~#c~0.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_~#c~0.base|) .cse0) 4))) |c_ULTIMATE.start_list_add_~node#1.base|)) is different from false [2025-03-09 01:13:59,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:59,761 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-03-09 01:13:59,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:59,772 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-03-09 01:13:59,785 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-03-09 01:13:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:59,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713734038] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:59,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:59,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2025-03-09 01:13:59,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359940279] [2025-03-09 01:13:59,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:59,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-09 01:13:59,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:59,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 01:13:59,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=573, Unknown=1, NotChecked=48, Total=702 [2025-03-09 01:13:59,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 71 [2025-03-09 01:13:59,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 187 flow. Second operand has 27 states, 27 states have (on average 8.703703703703704) internal successors, (235), 27 states have internal predecessors, (235), 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-03-09 01:13:59,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:59,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 71 [2025-03-09 01:13:59,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:00,608 INFO L124 PetriNetUnfolderBase]: 208/508 cut-off events. [2025-03-09 01:14:00,608 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2025-03-09 01:14:00,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 508 events. 208/508 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2375 event pairs, 39 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 1130. Up to 244 conditions per place. [2025-03-09 01:14:00,611 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 71 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2025-03-09 01:14:00,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 92 transitions, 455 flow [2025-03-09 01:14:00,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:14:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:14:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 169 transitions. [2025-03-09 01:14:00,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.18309859154929578 [2025-03-09 01:14:00,613 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 187 flow. Second operand 13 states and 169 transitions. [2025-03-09 01:14:00,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 92 transitions, 455 flow [2025-03-09 01:14:00,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 92 transitions, 433 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:14:00,615 INFO L231 Difference]: Finished difference. Result has 87 places, 64 transitions, 264 flow [2025-03-09 01:14:00,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=264, PETRI_PLACES=87, PETRI_TRANSITIONS=64} [2025-03-09 01:14:00,616 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2025-03-09 01:14:00,616 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 64 transitions, 264 flow [2025-03-09 01:14:00,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.703703703703704) internal successors, (235), 27 states have internal predecessors, (235), 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-03-09 01:14:00,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:00,616 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:00,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:14:00,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 01:14:00,817 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:14:00,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash 158466171, now seen corresponding path program 1 times [2025-03-09 01:14:00,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:00,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988953703] [2025-03-09 01:14:00,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:00,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:00,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:14:00,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:14:00,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:00,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:14:01,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:01,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988953703] [2025-03-09 01:14:01,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988953703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:14:01,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14665885] [2025-03-09 01:14:01,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:01,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:01,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:14:01,596 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:14:01,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:14:01,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:14:01,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:14:01,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:01,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:01,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-09 01:14:01,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:14:01,740 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-03-09 01:14:01,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:14:01,774 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-03-09 01:14:01,775 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-03-09 01:14:01,779 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-03-09 01:14:01,865 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-03-09 01:14:01,870 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-03-09 01:14:01,906 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-03-09 01:14:01,906 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-03-09 01:14:01,915 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-03-09 01:14:01,969 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-03-09 01:14:01,972 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-03-09 01:14:02,005 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-03-09 01:14:02,008 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-03-09 01:14:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:14:02,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:14:02,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#c~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_~#c~0.base|) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_~#c~0.base|) .cse2) 4))) (and (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_989 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_989) .cse0) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_988) .cse0) .cse1)))) (forall ((v_ArrVal_989 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_989) .cse0) .cse1)))))) is different from false [2025-03-09 01:14:02,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:14:02,126 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-03-09 01:14:02,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:14:02,135 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-03-09 01:14:02,149 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-03-09 01:14:02,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:14:02,155 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-03-09 01:14:02,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:14:02,160 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-03-09 01:14:02,167 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 01:14:02,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:02,170 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-03-09 01:14:02,177 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 01:14:02,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:02,180 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-03-09 01:14:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:14:02,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14665885] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:14:02,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:14:02,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2025-03-09 01:14:02,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797773726] [2025-03-09 01:14:02,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:14:02,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-09 01:14:02,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:02,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 01:14:02,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=778, Unknown=1, NotChecked=56, Total=930 [2025-03-09 01:14:02,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 71 [2025-03-09 01:14:02,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 64 transitions, 264 flow. Second operand has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 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-03-09 01:14:02,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:02,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 71 [2025-03-09 01:14:02,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:03,108 INFO L124 PetriNetUnfolderBase]: 291/641 cut-off events. [2025-03-09 01:14:03,108 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2025-03-09 01:14:03,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 641 events. 291/641 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3037 event pairs, 48 based on Foata normal form. 19/526 useless extension candidates. Maximal degree in co-relation 1623. Up to 316 conditions per place. [2025-03-09 01:14:03,111 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 92 selfloop transitions, 18 changer transitions 0/111 dead transitions. [2025-03-09 01:14:03,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 590 flow [2025-03-09 01:14:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:14:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:14:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 128 transitions. [2025-03-09 01:14:03,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.12877263581488935 [2025-03-09 01:14:03,114 INFO L175 Difference]: Start difference. First operand has 87 places, 64 transitions, 264 flow. Second operand 14 states and 128 transitions. [2025-03-09 01:14:03,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 590 flow [2025-03-09 01:14:03,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 111 transitions, 577 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-09 01:14:03,118 INFO L231 Difference]: Finished difference. Result has 95 places, 65 transitions, 303 flow [2025-03-09 01:14:03,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=303, PETRI_PLACES=95, PETRI_TRANSITIONS=65} [2025-03-09 01:14:03,118 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 22 predicate places. [2025-03-09 01:14:03,118 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 65 transitions, 303 flow [2025-03-09 01:14:03,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 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-03-09 01:14:03,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:03,118 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:03,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:14:03,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:14:03,319 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:14:03,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash 918789611, now seen corresponding path program 1 times [2025-03-09 01:14:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:03,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722197650] [2025-03-09 01:14:03,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:03,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:14:03,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:14:03,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:03,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-09 01:14:03,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:03,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722197650] [2025-03-09 01:14:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722197650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:14:03,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:14:03,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:14:03,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792966287] [2025-03-09 01:14:03,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:14:03,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:14:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:03,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:14:03,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:14:03,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2025-03-09 01:14:03,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 65 transitions, 303 flow. Second operand has 7 states, 7 states have (on average 41.142857142857146) internal successors, (288), 7 states have internal predecessors, (288), 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-03-09 01:14:03,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:03,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2025-03-09 01:14:03,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:03,893 INFO L124 PetriNetUnfolderBase]: 107/332 cut-off events. [2025-03-09 01:14:03,893 INFO L125 PetriNetUnfolderBase]: For 326/334 co-relation queries the response was YES. [2025-03-09 01:14:03,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 332 events. 107/332 cut-off events. For 326/334 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1535 event pairs, 59 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 837. Up to 222 conditions per place. [2025-03-09 01:14:03,895 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 51 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-09 01:14:03,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 72 transitions, 449 flow [2025-03-09 01:14:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:14:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:14:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2025-03-09 01:14:03,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.676056338028169 [2025-03-09 01:14:03,897 INFO L175 Difference]: Start difference. First operand has 95 places, 65 transitions, 303 flow. Second operand 4 states and 192 transitions. [2025-03-09 01:14:03,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 72 transitions, 449 flow [2025-03-09 01:14:03,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 72 transitions, 407 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-09 01:14:03,900 INFO L231 Difference]: Finished difference. Result has 85 places, 64 transitions, 269 flow [2025-03-09 01:14:03,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=85, PETRI_TRANSITIONS=64} [2025-03-09 01:14:03,901 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 12 predicate places. [2025-03-09 01:14:03,901 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 64 transitions, 269 flow [2025-03-09 01:14:03,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.142857142857146) internal successors, (288), 7 states have internal predecessors, (288), 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-03-09 01:14:03,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:03,901 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:03,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:14:03,901 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:14:03,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:03,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1582292589, now seen corresponding path program 1 times [2025-03-09 01:14:03,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:03,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821348384] [2025-03-09 01:14:03,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:03,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:14:04,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:14:04,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:04,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:14:04,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:14:04,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:14:04,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:14:04,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:04,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:14:04,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:14:04,153 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:14:04,153 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2025-03-09 01:14:04,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-03-09 01:14:04,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-03-09 01:14:04,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-03-09 01:14:04,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-03-09 01:14:04,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2025-03-09 01:14:04,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-03-09 01:14:04,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-03-09 01:14:04,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-03-09 01:14:04,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-03-09 01:14:04,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2025-03-09 01:14:04,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:14:04,159 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:04,187 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:14:04,188 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:14:04,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:14:04 BasicIcfg [2025-03-09 01:14:04,193 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:14:04,193 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:14:04,193 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:14:04,193 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:14:04,194 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:50" (3/4) ... [2025-03-09 01:14:04,194 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-09 01:14:04,243 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 27. [2025-03-09 01:14:04,296 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:14:04,296 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:14:04,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:14:04,297 INFO L158 Benchmark]: Toolchain (without parser) took 14641.93ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 111.4MB in the beginning and 181.8MB in the end (delta: -70.4MB). Peak memory consumption was 234.7MB. Max. memory is 16.1GB. [2025-03-09 01:14:04,297 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:14:04,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.35ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 71.2MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-09 01:14:04,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.24ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 68.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:14:04,299 INFO L158 Benchmark]: Boogie Preprocessor took 52.53ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 65.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:14:04,299 INFO L158 Benchmark]: IcfgBuilder took 775.31ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 104.5MB in the end (delta: -39.4MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2025-03-09 01:14:04,299 INFO L158 Benchmark]: TraceAbstraction took 13196.45ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 104.5MB in the beginning and 190.2MB in the end (delta: -85.7MB). Peak memory consumption was 216.8MB. Max. memory is 16.1GB. [2025-03-09 01:14:04,300 INFO L158 Benchmark]: Witness Printer took 103.21ms. Allocated memory is still 444.6MB. Free memory was 190.2MB in the beginning and 181.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:14:04,300 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.35ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 71.2MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.24ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 68.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.53ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 65.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 775.31ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 104.5MB in the end (delta: -39.4MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13196.45ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 104.5MB in the beginning and 190.2MB in the end (delta: -85.7MB). Peak memory consumption was 216.8MB. Max. memory is 16.1GB. * Witness Printer took 103.21ms. Allocated memory is still 444.6MB. Free memory was 190.2MB in the beginning and 181.8MB in the end (delta: 8.4MB). 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: [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1256] 0 int i = 0; VAL [c={1:0}, i=0] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=1] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=2] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=3] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=4] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=5] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=6] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=7] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=8] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=9] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=10] [L1256] COND FALSE 0 !(i < 10) [L1258] 0 int j = __VERIFIER_nondet_int(); [L1259] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1259] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1260] 0 struct s *p; [L1261] 0 pthread_t t1; [L1262] CALL, EXPR 0 new(1) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x VAL [c={1:0}] [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1262] RET, EXPR 0 new(1) [L1262] 0 c.slots[j] = new(1) [L1263] CALL, EXPR 0 new(2) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x VAL [c={1:0}] [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1263] RET, EXPR 0 new(2) [L1263] EXPR 0 c.slots[j] [L1263] CALL 0 list_add(new(2), c.slots[j]) [L1243] EXPR 0 list->next [L1243] 0 struct s *temp = list->next; [L1244] 0 list->next = node VAL [c={1:0}] [L1245] 0 node->next = temp [L1263] RET 0 list_add(new(2), c.slots[j]) [L1264] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [c={1:0}, j=7, t1=-1] [L1248] 1 int i = __VERIFIER_nondet_int(); [L1249] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1249] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1251] CALL, EXPR 1 new(3) [L1237] 1 struct s *p = malloc(sizeof(struct s)); [L1238] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, c={1:0}, i=8] [L1239] 1 p->next = ((void *)0) [L1240] 1 return p; [L1251] RET, EXPR 1 new(3) [L1251] EXPR 1 c.slots[i] [L1251] CALL 1 list_add(new(3), c.slots[i]) [L1243] 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: 1255]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1264]: 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, 96 locations, 95 edges, 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.1s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2961 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2178 mSDsluCounter, 1100 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 245 IncrementalHoareTripleChecker+Unchecked, 1000 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7628 IncrementalHoareTripleChecker+Invalid, 7996 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 100 mSDtfsCounter, 7628 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=17, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 457 NumberOfCodeBlocks, 443 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 494 ConstructedInterpolants, 2 QuantifiedInterpolants, 5663 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1770 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 28 InterpolantComputations, 13 PerfectInterpolantSequences, 1145/1193 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-03-09 01:14:04,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)