./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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.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 e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:00:52,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:00:52,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:00:52,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:00:52,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:00:52,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:00:52,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:00:52,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:00:52,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:00:52,938 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:00:52,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:00:52,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:00:52,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:00:52,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:00:52,939 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:00:52,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:00:52,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:00:52,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:00:52,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:00:52,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:00:52,939 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:00:52,939 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:00:52,939 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:00:52,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:00:52,940 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:00:52,940 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:00:52,940 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:00:52,940 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:00:52,940 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:00:52,940 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:00:52,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:00:52,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:00:52,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:00:52,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:52,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:00:52,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:00:52,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:00:52,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:00:52,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:00:52,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:00:52,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:00:52,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:00:52,941 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 -> e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a [2025-03-04 10:00:53,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:00:53,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:00:53,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:00:53,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:00:53,185 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:00:53,186 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.i [2025-03-04 10:00:54,304 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccbd5342/f99c38619d8545099fd96b369620c0d2/FLAG2a17c9a6a [2025-03-04 10:00:54,602 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:00:54,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2025-03-04 10:00:54,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccbd5342/f99c38619d8545099fd96b369620c0d2/FLAG2a17c9a6a [2025-03-04 10:00:54,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccbd5342/f99c38619d8545099fd96b369620c0d2 [2025-03-04 10:00:54,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:00:54,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:00:54,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:54,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:00:54,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:00:54,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:54" (1/1) ... [2025-03-04 10:00:54,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc7df18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:54, skipping insertion in model container [2025-03-04 10:00:54,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:54" (1/1) ... [2025-03-04 10:00:54,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:00:54,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:55,023 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:00:55,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:55,129 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:00:55,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55 WrapperNode [2025-03-04 10:00:55,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:55,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:55,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:00:55,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:00:55,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,165 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 180 [2025-03-04 10:00:55,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:55,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:00:55,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:00:55,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:00:55,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,190 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-04 10:00:55,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,197 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:00:55,204 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:00:55,204 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:00:55,204 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:00:55,205 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (1/1) ... [2025-03-04 10:00:55,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:55,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:55,235 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-04 10:00:55,238 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-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 10:00:55,255 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:00:55,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:00:55,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:00:55,256 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:00:55,396 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:00:55,398 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:00:55,812 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:00:55,812 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:00:56,109 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:00:56,110 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:00:56,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:56 BoogieIcfgContainer [2025-03-04 10:00:56,110 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:00:56,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:00:56,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:00:56,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:00:56,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:00:54" (1/3) ... [2025-03-04 10:00:56,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d035219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:56, skipping insertion in model container [2025-03-04 10:00:56,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:55" (2/3) ... [2025-03-04 10:00:56,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d035219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:56, skipping insertion in model container [2025-03-04 10:00:56,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:56" (3/3) ... [2025-03-04 10:00:56,119 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2025-03-04 10:00:56,134 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:00:56,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_19-nested_nr.i that has 2 procedures, 72 locations, 1 initial locations, 2 loop locations, and 37 error locations. [2025-03-04 10:00:56,136 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:00:56,188 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 10:00:56,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 73 transitions, 150 flow [2025-03-04 10:00:56,275 INFO L124 PetriNetUnfolderBase]: 2/72 cut-off events. [2025-03-04 10:00:56,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:56,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 277 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-03-04 10:00:56,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 73 transitions, 150 flow [2025-03-04 10:00:56,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 72 transitions, 147 flow [2025-03-04 10:00:56,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:00:56,301 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;@489d76c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:00:56,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 10:00:56,306 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:00:56,306 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2025-03-04 10:00:56,306 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:56,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:56,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:00:56,307 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-04 10:00:56,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash 16087680, now seen corresponding path program 1 times [2025-03-04 10:00:56,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:56,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526513787] [2025-03-04 10:00:56,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:56,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:56,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:00:56,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:00:56,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:56,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:56,558 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-04 10:00:56,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:56,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526513787] [2025-03-04 10:00:56,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526513787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:56,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:56,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588802366] [2025-03-04 10:00:56,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:56,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:56,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:56,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:56,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:56,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-03-04 10:00:56,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:56,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:56,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-03-04 10:00:56,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:56,721 INFO L124 PetriNetUnfolderBase]: 65/268 cut-off events. [2025-03-04 10:00:56,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:56,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 268 events. 65/268 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1367 event pairs, 63 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 376. Up to 155 conditions per place. [2025-03-04 10:00:56,726 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-03-04 10:00:56,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 207 flow [2025-03-04 10:00:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-04 10:00:56,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7534246575342466 [2025-03-04 10:00:56,738 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 147 flow. Second operand 3 states and 165 transitions. [2025-03-04 10:00:56,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 207 flow [2025-03-04 10:00:56,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:56,747 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 158 flow [2025-03-04 10:00:56,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2025-03-04 10:00:56,752 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2025-03-04 10:00:56,752 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 158 flow [2025-03-04 10:00:56,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:56,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:56,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:00:56,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:00:56,753 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-04 10:00:56,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash 498701880, now seen corresponding path program 1 times [2025-03-04 10:00:56,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:56,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891636209] [2025-03-04 10:00:56,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:56,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:56,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:00:56,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:00:56,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:56,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:56,885 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-04 10:00:56,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:56,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891636209] [2025-03-04 10:00:56,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891636209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:56,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390137334] [2025-03-04 10:00:56,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:56,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:56,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:56,888 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-04 10:00:56,889 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-04 10:00:56,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:00:56,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:00:56,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:56,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:56,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:00:56,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:56,993 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-04 10:00:56,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:57,010 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-04 10:00:57,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390137334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:57,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:57,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:00:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278665559] [2025-03-04 10:00:57,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:57,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:57,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:57,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:57,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-03-04 10:00:57,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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-04 10:00:57,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:57,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-03-04 10:00:57,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:57,151 INFO L124 PetriNetUnfolderBase]: 65/271 cut-off events. [2025-03-04 10:00:57,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:57,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 271 events. 65/271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1366 event pairs, 63 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 432. Up to 155 conditions per place. [2025-03-04 10:00:57,154 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-03-04 10:00:57,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 234 flow [2025-03-04 10:00:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:00:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:00:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 305 transitions. [2025-03-04 10:00:57,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6963470319634704 [2025-03-04 10:00:57,157 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 158 flow. Second operand 6 states and 305 transitions. [2025-03-04 10:00:57,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 234 flow [2025-03-04 10:00:57,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:57,158 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 190 flow [2025-03-04 10:00:57,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2025-03-04 10:00:57,160 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2025-03-04 10:00:57,161 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 190 flow [2025-03-04 10:00:57,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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-04 10:00:57,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:57,161 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-04 10:00:57,168 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-04 10:00:57,362 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-04 10:00:57,362 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-04 10:00:57,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash 519743616, now seen corresponding path program 2 times [2025-03-04 10:00:57,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:57,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062631895] [2025-03-04 10:00:57,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:57,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 10:00:57,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-03-04 10:00:57,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:00:57,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:57,454 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-04 10:00:57,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:57,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062631895] [2025-03-04 10:00:57,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062631895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:57,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:57,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023036051] [2025-03-04 10:00:57,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:57,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:57,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:57,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:57,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 73 [2025-03-04 10:00:57,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-04 10:00:57,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:57,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 73 [2025-03-04 10:00:57,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:57,585 INFO L124 PetriNetUnfolderBase]: 65/267 cut-off events. [2025-03-04 10:00:57,585 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:00:57,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 267 events. 65/267 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1337 event pairs, 63 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 421. Up to 157 conditions per place. [2025-03-04 10:00:57,587 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 30 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-03-04 10:00:57,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 250 flow [2025-03-04 10:00:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-03-04 10:00:57,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6894977168949772 [2025-03-04 10:00:57,590 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 190 flow. Second operand 3 states and 151 transitions. [2025-03-04 10:00:57,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 250 flow [2025-03-04 10:00:57,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 236 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:57,591 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 176 flow [2025-03-04 10:00:57,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, 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=176, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-03-04 10:00:57,592 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2025-03-04 10:00:57,592 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 176 flow [2025-03-04 10:00:57,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-04 10:00:57,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:57,592 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-04 10:00:57,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:00:57,595 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-04 10:00:57,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:57,595 INFO L85 PathProgramCache]: Analyzing trace with hash 519743617, now seen corresponding path program 1 times [2025-03-04 10:00:57,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:57,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064600860] [2025-03-04 10:00:57,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:57,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:57,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:00:57,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:00:57,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:57,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:57,723 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-04 10:00:57,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:57,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064600860] [2025-03-04 10:00:57,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064600860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:57,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147307184] [2025-03-04 10:00:57,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:57,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:57,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:57,726 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-04 10:00:57,728 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-04 10:00:57,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:00:57,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:00:57,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:57,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:57,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:00:57,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:57,823 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-04 10:00:57,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:57,891 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-04 10:00:57,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147307184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:57,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:57,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 10:00:57,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417611203] [2025-03-04 10:00:57,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:57,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:00:57,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:57,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:00:57,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:00:57,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-03-04 10:00:57,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 176 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 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-04 10:00:57,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:57,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-03-04 10:00:57,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:58,013 INFO L124 PetriNetUnfolderBase]: 65/273 cut-off events. [2025-03-04 10:00:58,014 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 10:00:58,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 273 events. 65/273 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1333 event pairs, 63 based on Foata normal form. 6/221 useless extension candidates. Maximal degree in co-relation 431. Up to 155 conditions per place. [2025-03-04 10:00:58,018 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2025-03-04 10:00:58,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 78 transitions, 288 flow [2025-03-04 10:00:58,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:00:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:00:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 584 transitions. [2025-03-04 10:00:58,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 10:00:58,022 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 176 flow. Second operand 12 states and 584 transitions. [2025-03-04 10:00:58,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 78 transitions, 288 flow [2025-03-04 10:00:58,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 78 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:58,024 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 252 flow [2025-03-04 10:00:58,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=252, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-03-04 10:00:58,025 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 21 predicate places. [2025-03-04 10:00:58,025 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 252 flow [2025-03-04 10:00:58,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 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-04 10:00:58,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:58,025 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-03-04 10:00:58,033 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-04 10:00:58,226 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-04 10:00:58,226 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-04 10:00:58,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:58,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1876249985, now seen corresponding path program 2 times [2025-03-04 10:00:58,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:58,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876655642] [2025-03-04 10:00:58,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:58,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:58,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:00:58,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-03-04 10:00:58,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:00:58,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:58,309 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-04 10:00:58,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:58,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876655642] [2025-03-04 10:00:58,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876655642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:58,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:58,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:58,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123444683] [2025-03-04 10:00:58,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:58,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:58,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:58,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:58,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:58,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 73 [2025-03-04 10:00:58,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-04 10:00:58,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:58,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 73 [2025-03-04 10:00:58,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:58,426 INFO L124 PetriNetUnfolderBase]: 65/269 cut-off events. [2025-03-04 10:00:58,426 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 10:00:58,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 269 events. 65/269 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1308 event pairs, 63 based on Foata normal form. 2/214 useless extension candidates. Maximal degree in co-relation 421. Up to 163 conditions per place. [2025-03-04 10:00:58,428 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 34 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-03-04 10:00:58,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 74 transitions, 320 flow [2025-03-04 10:00:58,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-04 10:00:58,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7077625570776256 [2025-03-04 10:00:58,429 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 252 flow. Second operand 3 states and 155 transitions. [2025-03-04 10:00:58,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 74 transitions, 320 flow [2025-03-04 10:00:58,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 74 transitions, 272 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-04 10:00:58,432 INFO L231 Difference]: Finished difference. Result has 88 places, 74 transitions, 204 flow [2025-03-04 10:00:58,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=88, PETRI_TRANSITIONS=74} [2025-03-04 10:00:58,433 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 14 predicate places. [2025-03-04 10:00:58,433 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 74 transitions, 204 flow [2025-03-04 10:00:58,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-04 10:00:58,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:58,433 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:58,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:00:58,433 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-04 10:00:58,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash -810014663, now seen corresponding path program 1 times [2025-03-04 10:00:58,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:58,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361444123] [2025-03-04 10:00:58,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:58,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:58,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:00:58,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:00:58,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:58,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:58,633 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-04 10:00:58,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:58,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361444123] [2025-03-04 10:00:58,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361444123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:58,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:58,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:58,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445444492] [2025-03-04 10:00:58,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:58,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:00:58,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:58,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:00:58,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:00:58,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 73 [2025-03-04 10:00:58,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 74 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 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-04 10:00:58,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:58,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 73 [2025-03-04 10:00:58,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:58,850 INFO L124 PetriNetUnfolderBase]: 74/291 cut-off events. [2025-03-04 10:00:58,851 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-04 10:00:58,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 291 events. 74/291 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1429 event pairs, 72 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 474. Up to 185 conditions per place. [2025-03-04 10:00:58,853 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 40 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2025-03-04 10:00:58,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 70 transitions, 278 flow [2025-03-04 10:00:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-03-04 10:00:58,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680365296803653 [2025-03-04 10:00:58,855 INFO L175 Difference]: Start difference. First operand has 88 places, 74 transitions, 204 flow. Second operand 3 states and 149 transitions. [2025-03-04 10:00:58,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 70 transitions, 278 flow [2025-03-04 10:00:58,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:58,860 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 190 flow [2025-03-04 10:00:58,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2025-03-04 10:00:58,861 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 10 predicate places. [2025-03-04 10:00:58,861 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 190 flow [2025-03-04 10:00:58,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 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-04 10:00:58,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:58,861 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:58,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:00:58,861 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-04 10:00:58,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash -810014662, now seen corresponding path program 1 times [2025-03-04 10:00:58,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:58,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680155719] [2025-03-04 10:00:58,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:58,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:58,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:00:58,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:00:58,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:58,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:59,089 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-04 10:00:59,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:59,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680155719] [2025-03-04 10:00:59,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680155719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:59,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:59,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:59,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359825086] [2025-03-04 10:00:59,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:59,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:00:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:59,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:00:59,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:00:59,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 73 [2025-03-04 10:00:59,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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-04 10:00:59,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:59,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 73 [2025-03-04 10:00:59,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:59,421 INFO L124 PetriNetUnfolderBase]: 65/277 cut-off events. [2025-03-04 10:00:59,421 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-04 10:00:59,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 277 events. 65/277 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1235 event pairs, 63 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 472. Up to 166 conditions per place. [2025-03-04 10:00:59,422 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 40 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2025-03-04 10:00:59,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 298 flow [2025-03-04 10:00:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2025-03-04 10:00:59,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.589041095890411 [2025-03-04 10:00:59,423 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 190 flow. Second operand 5 states and 215 transitions. [2025-03-04 10:00:59,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 298 flow [2025-03-04 10:00:59,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 77 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:59,425 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 239 flow [2025-03-04 10:00:59,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2025-03-04 10:00:59,426 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2025-03-04 10:00:59,426 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 239 flow [2025-03-04 10:00:59,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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-04 10:00:59,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:59,426 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:59,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:00:59,426 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-04 10:00:59,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:59,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1803249761, now seen corresponding path program 1 times [2025-03-04 10:00:59,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:59,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015834700] [2025-03-04 10:00:59,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:59,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:59,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:00:59,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:00:59,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:59,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:59,679 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-04 10:00:59,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:59,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015834700] [2025-03-04 10:00:59,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015834700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:59,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:59,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:00:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421372030] [2025-03-04 10:00:59,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:59,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:59,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:59,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:59,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2025-03-04 10:00:59,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 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-04 10:00:59,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:59,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2025-03-04 10:00:59,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:59,998 INFO L124 PetriNetUnfolderBase]: 65/273 cut-off events. [2025-03-04 10:00:59,998 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-04 10:00:59,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 273 events. 65/273 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1207 event pairs, 63 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 491. Up to 160 conditions per place. [2025-03-04 10:01:00,000 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 35 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2025-03-04 10:01:00,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 73 transitions, 327 flow [2025-03-04 10:01:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:01:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:01:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 285 transitions. [2025-03-04 10:01:00,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5577299412915852 [2025-03-04 10:01:00,002 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 239 flow. Second operand 7 states and 285 transitions. [2025-03-04 10:01:00,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 73 transitions, 327 flow [2025-03-04 10:01:00,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 73 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:01:00,006 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 253 flow [2025-03-04 10:01:00,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2025-03-04 10:01:00,011 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2025-03-04 10:01:00,011 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 253 flow [2025-03-04 10:01:00,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 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-04 10:01:00,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:00,012 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:00,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:01:00,012 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-04 10:01:00,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:00,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1803249762, now seen corresponding path program 1 times [2025-03-04 10:01:00,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:00,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251920172] [2025-03-04 10:01:00,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:00,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:00,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:01:00,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:01:00,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:00,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:00,338 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-04 10:01:00,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:00,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251920172] [2025-03-04 10:01:00,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251920172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:01:00,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:01:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:01:00,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10983010] [2025-03-04 10:01:00,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:01:00,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:01:00,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:00,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:01:00,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:01:00,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 73 [2025-03-04 10:01:00,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 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-04 10:01:00,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:00,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 73 [2025-03-04 10:01:00,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:00,650 INFO L124 PetriNetUnfolderBase]: 65/269 cut-off events. [2025-03-04 10:01:00,650 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-04 10:01:00,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 269 events. 65/269 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1187 event pairs, 63 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 492. Up to 160 conditions per place. [2025-03-04 10:01:00,652 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 32 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2025-03-04 10:01:00,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 71 transitions, 335 flow [2025-03-04 10:01:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:01:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:01:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 303 transitions. [2025-03-04 10:01:00,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5929549902152642 [2025-03-04 10:01:00,653 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 253 flow. Second operand 7 states and 303 transitions. [2025-03-04 10:01:00,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 71 transitions, 335 flow [2025-03-04 10:01:00,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 71 transitions, 313 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:01:00,655 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 249 flow [2025-03-04 10:01:00,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2025-03-04 10:01:00,655 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2025-03-04 10:01:00,655 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 249 flow [2025-03-04 10:01:00,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 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-04 10:01:00,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:00,658 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:00,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:01:00,658 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-04 10:01:00,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2051218085, now seen corresponding path program 1 times [2025-03-04 10:01:00,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:00,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148575644] [2025-03-04 10:01:00,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:00,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:00,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:01:00,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:01:00,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:00,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:00,867 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-04 10:01:00,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:00,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148575644] [2025-03-04 10:01:00,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148575644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:01:00,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:01:00,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:01:00,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799107276] [2025-03-04 10:01:00,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:01:00,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:01:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:00,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:01:00,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:01:00,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 73 [2025-03-04 10:01:00,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 71 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-04 10:01:00,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:00,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 73 [2025-03-04 10:01:00,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:01,102 INFO L124 PetriNetUnfolderBase]: 65/267 cut-off events. [2025-03-04 10:01:01,103 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-04 10:01:01,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 267 events. 65/267 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1174 event pairs, 63 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 490. Up to 162 conditions per place. [2025-03-04 10:01:01,104 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 32 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2025-03-04 10:01:01,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 70 transitions, 333 flow [2025-03-04 10:01:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:01:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:01:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2025-03-04 10:01:01,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6273972602739726 [2025-03-04 10:01:01,106 INFO L175 Difference]: Start difference. First operand has 89 places, 71 transitions, 249 flow. Second operand 5 states and 229 transitions. [2025-03-04 10:01:01,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 70 transitions, 333 flow [2025-03-04 10:01:01,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 70 transitions, 311 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:01:01,108 INFO L231 Difference]: Finished difference. Result has 86 places, 70 transitions, 247 flow [2025-03-04 10:01:01,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2025-03-04 10:01:01,109 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2025-03-04 10:01:01,109 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 247 flow [2025-03-04 10:01:01,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-04 10:01:01,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:01,109 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:01,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:01:01,110 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-04 10:01:01,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2051218084, now seen corresponding path program 1 times [2025-03-04 10:01:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:01,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124971930] [2025-03-04 10:01:01,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:01,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:01,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:01:01,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:01:01,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:01,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:01,209 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-04 10:01:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124971930] [2025-03-04 10:01:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124971930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:01:01,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:01:01,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:01:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858143621] [2025-03-04 10:01:01,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:01:01,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:01:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:01,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:01:01,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:01:01,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 73 [2025-03-04 10:01:01,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:01:01,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:01,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 73 [2025-03-04 10:01:01,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:01,449 INFO L124 PetriNetUnfolderBase]: 65/265 cut-off events. [2025-03-04 10:01:01,449 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-04 10:01:01,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 265 events. 65/265 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1169 event pairs, 63 based on Foata normal form. 2/223 useless extension candidates. Maximal degree in co-relation 492. Up to 162 conditions per place. [2025-03-04 10:01:01,451 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 34 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2025-03-04 10:01:01,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 69 transitions, 335 flow [2025-03-04 10:01:01,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:01:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:01:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2025-03-04 10:01:01,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054794520547945 [2025-03-04 10:01:01,453 INFO L175 Difference]: Start difference. First operand has 86 places, 70 transitions, 247 flow. Second operand 5 states and 221 transitions. [2025-03-04 10:01:01,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 69 transitions, 335 flow [2025-03-04 10:01:01,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 69 transitions, 313 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:01:01,456 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 245 flow [2025-03-04 10:01:01,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2025-03-04 10:01:01,457 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 11 predicate places. [2025-03-04 10:01:01,458 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 245 flow [2025-03-04 10:01:01,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:01:01,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:01,458 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:01,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:01:01,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:01,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash 421846539, now seen corresponding path program 1 times [2025-03-04 10:01:01,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:01,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970121586] [2025-03-04 10:01:01,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:01,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:01:01,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:01:01,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:01,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:01:01,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:01,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970121586] [2025-03-04 10:01:01,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970121586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:01,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929167980] [2025-03-04 10:01:01,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:01,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:01,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:01,801 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-04 10:01:01,802 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-04 10:01:01,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:01:01,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:01:01,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:01,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:01,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 10:01:01,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:01:02,055 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:01:02,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 13 [2025-03-04 10:01:02,072 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:01:02,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:01:02,142 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:01:02,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 13 [2025-03-04 10:01:02,156 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:01:02,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:01:02,162 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 15 treesize of output 1 [2025-03-04 10:01:02,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:02,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:01:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:01:02,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:01:02,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:01:02,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-04 10:01:02,568 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:01:02,568 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 13 treesize of output 12 [2025-03-04 10:01:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:01:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929167980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:01:02,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:01:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 21 [2025-03-04 10:01:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996685581] [2025-03-04 10:01:02,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:01:02,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:01:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:02,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:01:02,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:01:04,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-03-04 10:01:04,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 245 flow. Second operand has 23 states, 23 states have (on average 35.69565217391305) internal successors, (821), 23 states have internal predecessors, (821), 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-04 10:01:04,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:04,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-03-04 10:01:04,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:04,980 INFO L124 PetriNetUnfolderBase]: 75/305 cut-off events. [2025-03-04 10:01:04,980 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-04 10:01:04,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 305 events. 75/305 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1351 event pairs, 72 based on Foata normal form. 5/262 useless extension candidates. Maximal degree in co-relation 568. Up to 176 conditions per place. [2025-03-04 10:01:04,982 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 43 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2025-03-04 10:01:04,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 78 transitions, 399 flow [2025-03-04 10:01:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:01:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:01:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 424 transitions. [2025-03-04 10:01:04,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5280199252801993 [2025-03-04 10:01:04,983 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 245 flow. Second operand 11 states and 424 transitions. [2025-03-04 10:01:04,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 78 transitions, 399 flow [2025-03-04 10:01:04,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 78 transitions, 361 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:01:04,985 INFO L231 Difference]: Finished difference. Result has 90 places, 70 transitions, 256 flow [2025-03-04 10:01:04,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=256, PETRI_PLACES=90, PETRI_TRANSITIONS=70} [2025-03-04 10:01:04,986 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2025-03-04 10:01:04,986 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 70 transitions, 256 flow [2025-03-04 10:01:04,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.69565217391305) internal successors, (821), 23 states have internal predecessors, (821), 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-04 10:01:04,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:04,987 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:04,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:01:05,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:05,187 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:05,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:05,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1223128912, now seen corresponding path program 1 times [2025-03-04 10:01:05,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:05,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690905526] [2025-03-04 10:01:05,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:05,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:05,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:01:05,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:01:05,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:05,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:01:05,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:05,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690905526] [2025-03-04 10:01:05,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690905526] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:05,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462987302] [2025-03-04 10:01:05,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:05,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:05,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:05,313 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-04 10:01:05,315 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-04 10:01:05,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:01:05,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:01:05,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:05,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:05,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:01:05,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:01:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:01:05,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:01:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:01:05,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462987302] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:01:05,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:01:05,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:01:05,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072047172] [2025-03-04 10:01:05,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:01:05,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:01:05,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:05,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:01:05,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:01:05,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-03-04 10:01:05,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 70 transitions, 256 flow. Second operand has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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-04 10:01:05,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:05,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-03-04 10:01:05,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:05,711 INFO L124 PetriNetUnfolderBase]: 65/304 cut-off events. [2025-03-04 10:01:05,711 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-04 10:01:05,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 304 events. 65/304 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1097 event pairs, 63 based on Foata normal form. 1/260 useless extension candidates. Maximal degree in co-relation 586. Up to 158 conditions per place. [2025-03-04 10:01:05,713 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 66 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2025-03-04 10:01:05,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 98 transitions, 514 flow [2025-03-04 10:01:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:01:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:01:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 428 transitions. [2025-03-04 10:01:05,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7328767123287672 [2025-03-04 10:01:05,715 INFO L175 Difference]: Start difference. First operand has 90 places, 70 transitions, 256 flow. Second operand 8 states and 428 transitions. [2025-03-04 10:01:05,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 98 transitions, 514 flow [2025-03-04 10:01:05,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 98 transitions, 490 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 10:01:05,718 INFO L231 Difference]: Finished difference. Result has 97 places, 73 transitions, 292 flow [2025-03-04 10:01:05,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=292, PETRI_PLACES=97, PETRI_TRANSITIONS=73} [2025-03-04 10:01:05,719 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 23 predicate places. [2025-03-04 10:01:05,719 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 73 transitions, 292 flow [2025-03-04 10:01:05,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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-04 10:01:05,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:05,719 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:05,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:01:05,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:05,920 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:05,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1549616108, now seen corresponding path program 2 times [2025-03-04 10:01:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:05,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239719038] [2025-03-04 10:01:05,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:01:05,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:05,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-04 10:01:05,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 10:01:05,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:01:05,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:01:06,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:06,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239719038] [2025-03-04 10:01:06,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239719038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:06,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92050594] [2025-03-04 10:01:06,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:01:06,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:06,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:06,222 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-04 10:01:06,223 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-04 10:01:06,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-04 10:01:06,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 10:01:06,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:01:06,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:06,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:01:06,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:01:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:01:06,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:01:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:01:06,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92050594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:01:06,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:01:06,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-04 10:01:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774418384] [2025-03-04 10:01:06,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:01:06,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:01:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:06,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:01:06,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:01:06,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-03-04 10:01:06,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 73 transitions, 292 flow. Second operand has 13 states, 13 states have (on average 51.15384615384615) internal successors, (665), 13 states have internal predecessors, (665), 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-04 10:01:06,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:06,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-03-04 10:01:06,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:06,821 INFO L124 PetriNetUnfolderBase]: 65/344 cut-off events. [2025-03-04 10:01:06,821 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2025-03-04 10:01:06,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 344 events. 65/344 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1103 event pairs, 63 based on Foata normal form. 4/304 useless extension candidates. Maximal degree in co-relation 706. Up to 158 conditions per place. [2025-03-04 10:01:06,822 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 90 selfloop transitions, 12 changer transitions 0/126 dead transitions. [2025-03-04 10:01:06,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 126 transitions, 728 flow [2025-03-04 10:01:06,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:01:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:01:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 636 transitions. [2025-03-04 10:01:06,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.726027397260274 [2025-03-04 10:01:06,827 INFO L175 Difference]: Start difference. First operand has 97 places, 73 transitions, 292 flow. Second operand 12 states and 636 transitions. [2025-03-04 10:01:06,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 126 transitions, 728 flow [2025-03-04 10:01:06,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 126 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:01:06,829 INFO L231 Difference]: Finished difference. Result has 111 places, 78 transitions, 387 flow [2025-03-04 10:01:06,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=387, PETRI_PLACES=111, PETRI_TRANSITIONS=78} [2025-03-04 10:01:06,831 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 37 predicate places. [2025-03-04 10:01:06,831 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 78 transitions, 387 flow [2025-03-04 10:01:06,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.15384615384615) internal successors, (665), 13 states have internal predecessors, (665), 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-04 10:01:06,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:06,831 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:06,839 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-04 10:01:07,032 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,SelfDestructingSolverStorable13 [2025-03-04 10:01:07,032 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:07,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1653936936, now seen corresponding path program 3 times [2025-03-04 10:01:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:07,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026167988] [2025-03-04 10:01:07,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:01:07,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:07,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 118 statements into 11 equivalence classes. [2025-03-04 10:01:07,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 118 statements. [2025-03-04 10:01:07,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:01:07,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2025-03-04 10:01:07,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:07,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026167988] [2025-03-04 10:01:07,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026167988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:07,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002738842] [2025-03-04 10:01:07,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:01:07,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:07,199 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:01:07,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:01:07,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 118 statements into 11 equivalence classes. [2025-03-04 10:01:07,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 118 statements. [2025-03-04 10:01:07,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:01:07,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:07,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:01:07,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:01:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2025-03-04 10:01:07,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:01:07,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002738842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:01:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:01:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:01:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709306505] [2025-03-04 10:01:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:01:07,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:01:07,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:07,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:01:07,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:01:08,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 73 [2025-03-04 10:01:08,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 78 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 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-04 10:01:08,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:08,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 73 [2025-03-04 10:01:08,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:08,240 INFO L124 PetriNetUnfolderBase]: 71/384 cut-off events. [2025-03-04 10:01:08,241 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2025-03-04 10:01:08,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 384 events. 71/384 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1465 event pairs, 18 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 783. Up to 126 conditions per place. [2025-03-04 10:01:08,242 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 46 selfloop transitions, 22 changer transitions 3/94 dead transitions. [2025-03-04 10:01:08,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 94 transitions, 561 flow [2025-03-04 10:01:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:01:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:01:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 355 transitions. [2025-03-04 10:01:08,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6947162426614482 [2025-03-04 10:01:08,243 INFO L175 Difference]: Start difference. First operand has 111 places, 78 transitions, 387 flow. Second operand 7 states and 355 transitions. [2025-03-04 10:01:08,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 94 transitions, 561 flow [2025-03-04 10:01:08,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 94 transitions, 551 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:01:08,246 INFO L231 Difference]: Finished difference. Result has 113 places, 80 transitions, 432 flow [2025-03-04 10:01:08,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=113, PETRI_TRANSITIONS=80} [2025-03-04 10:01:08,247 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 39 predicate places. [2025-03-04 10:01:08,247 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 80 transitions, 432 flow [2025-03-04 10:01:08,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 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-04 10:01:08,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:08,247 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:08,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:01:08,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:01:08,451 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:08,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:08,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1653142647, now seen corresponding path program 1 times [2025-03-04 10:01:08,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:08,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892868895] [2025-03-04 10:01:08,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:08,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:08,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 10:01:08,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 10:01:08,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:08,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-03-04 10:01:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892868895] [2025-03-04 10:01:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892868895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:01:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:01:08,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:01:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312234228] [2025-03-04 10:01:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:01:08,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:01:08,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:08,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:01:08,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:01:08,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 73 [2025-03-04 10:01:08,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 80 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-04 10:01:08,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:08,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 73 [2025-03-04 10:01:08,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:08,952 INFO L124 PetriNetUnfolderBase]: 65/351 cut-off events. [2025-03-04 10:01:08,952 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2025-03-04 10:01:08,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 351 events. 65/351 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1150 event pairs, 50 based on Foata normal form. 8/319 useless extension candidates. Maximal degree in co-relation 793. Up to 214 conditions per place. [2025-03-04 10:01:08,954 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 60 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-03-04 10:01:08,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 85 transitions, 570 flow [2025-03-04 10:01:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:01:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:01:08,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-03-04 10:01:08,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7579908675799086 [2025-03-04 10:01:08,955 INFO L175 Difference]: Start difference. First operand has 113 places, 80 transitions, 432 flow. Second operand 3 states and 166 transitions. [2025-03-04 10:01:08,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 85 transitions, 570 flow [2025-03-04 10:01:08,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 85 transitions, 533 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 10:01:08,959 INFO L231 Difference]: Finished difference. Result has 109 places, 78 transitions, 398 flow [2025-03-04 10:01:08,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=109, PETRI_TRANSITIONS=78} [2025-03-04 10:01:08,959 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 35 predicate places. [2025-03-04 10:01:08,959 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 78 transitions, 398 flow [2025-03-04 10:01:08,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-04 10:01:08,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:08,959 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:08,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:01:08,960 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:08,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:08,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1653142648, now seen corresponding path program 1 times [2025-03-04 10:01:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:08,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523948557] [2025-03-04 10:01:08,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:08,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:09,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 10:01:09,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 10:01:09,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:09,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-03-04 10:01:09,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:09,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523948557] [2025-03-04 10:01:09,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523948557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:01:09,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:01:09,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:01:09,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162440292] [2025-03-04 10:01:09,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:01:09,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:01:09,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:09,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:01:09,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:01:09,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 73 [2025-03-04 10:01:09,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 78 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-04 10:01:09,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:09,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 73 [2025-03-04 10:01:09,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:09,332 INFO L124 PetriNetUnfolderBase]: 72/345 cut-off events. [2025-03-04 10:01:09,332 INFO L125 PetriNetUnfolderBase]: For 334/334 co-relation queries the response was YES. [2025-03-04 10:01:09,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 345 events. 72/345 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1054 event pairs, 51 based on Foata normal form. 8/320 useless extension candidates. Maximal degree in co-relation 785. Up to 214 conditions per place. [2025-03-04 10:01:09,334 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 61 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2025-03-04 10:01:09,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 83 transitions, 537 flow [2025-03-04 10:01:09,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:01:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:01:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2025-03-04 10:01:09,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7488584474885844 [2025-03-04 10:01:09,335 INFO L175 Difference]: Start difference. First operand has 109 places, 78 transitions, 398 flow. Second operand 3 states and 164 transitions. [2025-03-04 10:01:09,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 83 transitions, 537 flow [2025-03-04 10:01:09,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 83 transitions, 531 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:01:09,337 INFO L231 Difference]: Finished difference. Result has 107 places, 76 transitions, 394 flow [2025-03-04 10:01:09,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=107, PETRI_TRANSITIONS=76} [2025-03-04 10:01:09,338 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 33 predicate places. [2025-03-04 10:01:09,338 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 76 transitions, 394 flow [2025-03-04 10:01:09,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-04 10:01:09,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:09,338 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:09,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:01:09,338 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:09,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash 267562978, now seen corresponding path program 1 times [2025-03-04 10:01:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:09,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462908953] [2025-03-04 10:01:09,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:09,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 10:01:11,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 10:01:11,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:11,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:01:59,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:59,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462908953] [2025-03-04 10:01:59,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462908953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:59,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982113384] [2025-03-04 10:01:59,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:59,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:59,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:59,775 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:01:59,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:02:00,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 10:02:01,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 10:02:01,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:01,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:01,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 2216 conjuncts, 443 conjuncts are in the unsatisfiable core [2025-03-04 10:02:01,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:02:02,935 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 15 treesize of output 1 [2025-03-04 10:02:02,938 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 11 treesize of output 7 [2025-03-04 10:02:02,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 14 treesize of output 3 [2025-03-04 10:02:03,449 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2025-03-04 10:02:03,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2025-03-04 10:02:03,471 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2025-03-04 10:02:03,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 26 [2025-03-04 10:02:03,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:02:03,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:02:03,813 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2025-03-04 10:02:03,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2025-03-04 10:02:03,834 INFO L349 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2025-03-04 10:02:03,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 35 [2025-03-04 10:02:03,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-03-04 10:02:03,854 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 21 treesize of output 20 [2025-03-04 10:02:04,625 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-04 10:02:04,645 INFO L349 Elim1Store]: treesize reduction 50, result has 48.5 percent of original size [2025-03-04 10:02:04,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 58 [2025-03-04 10:02:04,973 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-03-04 10:02:04,973 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 17 treesize of output 17 [2025-03-04 10:02:04,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2025-03-04 10:02:05,003 INFO L349 Elim1Store]: treesize reduction 88, result has 34.8 percent of original size [2025-03-04 10:02:05,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 72 [2025-03-04 10:02:05,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 10:02:05,525 INFO L349 Elim1Store]: treesize reduction 130, result has 41.7 percent of original size [2025-03-04 10:02:05,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 110 [2025-03-04 10:02:05,568 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-04 10:02:05,970 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-03-04 10:02:05,970 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 17 treesize of output 17 [2025-03-04 10:02:05,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2025-03-04 10:02:06,032 INFO L349 Elim1Store]: treesize reduction 202, result has 31.5 percent of original size [2025-03-04 10:02:06,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 54 treesize of output 124 [2025-03-04 10:02:06,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 10:02:07,742 INFO L349 Elim1Store]: treesize reduction 272, result has 46.5 percent of original size [2025-03-04 10:02:07,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 132 treesize of output 324