./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_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_17-arrayloop_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 b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:00:42,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:00:43,028 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:43,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:00:43,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:00:43,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:00:43,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:00:43,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:00:43,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:00:43,052 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:00:43,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:00:43,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:00:43,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:00:43,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:00:43,054 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:00:43,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:00:43,055 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:00:43,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:00:43,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:00:43,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:00:43,055 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:00:43,055 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:00:43,055 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:00:43,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:00:43,055 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:00:43,055 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:00:43,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:43,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:00:43,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:00:43,056 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 -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 [2025-03-04 10:00:43,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:00:43,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:00:43,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:00:43,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:00:43,315 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:00:43,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-04 10:00:44,520 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45eeee84f/168e9ce3b6054b4594a001934f26ea4d/FLAG46f04632f [2025-03-04 10:00:44,824 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:00:44,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-04 10:00:44,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45eeee84f/168e9ce3b6054b4594a001934f26ea4d/FLAG46f04632f [2025-03-04 10:00:44,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45eeee84f/168e9ce3b6054b4594a001934f26ea4d [2025-03-04 10:00:44,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:00:44,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:00:44,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:44,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:00:44,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:00:44,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:44" (1/1) ... [2025-03-04 10:00:44,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb54bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:44, skipping insertion in model container [2025-03-04 10:00:44,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:44" (1/1) ... [2025-03-04 10:00:44,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:00:45,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:45,312 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:00:45,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:45,420 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:00:45,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:45 WrapperNode [2025-03-04 10:00:45,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:45,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:45,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:00:45,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:00:45,426 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:45" (1/1) ... [2025-03-04 10:00:45,437 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:45" (1/1) ... [2025-03-04 10:00:45,462 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 171 [2025-03-04 10:00:45,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:45,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:00:45,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:00:45,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:00:45,469 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:45" (1/1) ... [2025-03-04 10:00:45,470 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:45" (1/1) ... [2025-03-04 10:00:45,474 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:45" (1/1) ... [2025-03-04 10:00:45,487 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-03-04 10:00:45,487 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:45" (1/1) ... [2025-03-04 10:00:45,487 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:45" (1/1) ... [2025-03-04 10:00:45,495 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:45" (1/1) ... [2025-03-04 10:00:45,495 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:45" (1/1) ... [2025-03-04 10:00:45,497 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:45" (1/1) ... [2025-03-04 10:00:45,498 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:45" (1/1) ... [2025-03-04 10:00:45,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:00:45,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:00:45,500 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:00:45,500 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:00:45,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:45" (1/1) ... [2025-03-04 10:00:45,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:45,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:45,526 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:45,529 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:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 10:00:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 10:00:45,543 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 10:00:45,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:00:45,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:00:45,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:00:45,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:00:45,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:00:45,545 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:45,659 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:00:45,661 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:00:45,994 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:00:45,994 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:00:46,189 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:00:46,190 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:00:46,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:46 BoogieIcfgContainer [2025-03-04 10:00:46,190 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:00:46,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:00:46,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:00:46,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:00:46,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:00:44" (1/3) ... [2025-03-04 10:00:46,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f64bc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:46, skipping insertion in model container [2025-03-04 10:00:46,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:45" (2/3) ... [2025-03-04 10:00:46,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f64bc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:46, skipping insertion in model container [2025-03-04 10:00:46,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:46" (3/3) ... [2025-03-04 10:00:46,196 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2025-03-04 10:00:46,208 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:00:46,209 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_17-arrayloop_nr.i that has 2 procedures, 73 locations, 1 initial locations, 3 loop locations, and 37 error locations. [2025-03-04 10:00:46,210 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:00:46,259 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 10:00:46,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 154 flow [2025-03-04 10:00:46,306 INFO L124 PetriNetUnfolderBase]: 3/74 cut-off events. [2025-03-04 10:00:46,312 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:46,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 74 events. 3/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 238 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2025-03-04 10:00:46,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 154 flow [2025-03-04 10:00:46,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 74 transitions, 151 flow [2025-03-04 10:00:46,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:00:46,331 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;@6b9c1443, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:00:46,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 10:00:46,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:00:46,336 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-04 10:00:46,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:46,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:46,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:00:46,337 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:46,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:46,341 INFO L85 PathProgramCache]: Analyzing trace with hash 489896, now seen corresponding path program 1 times [2025-03-04 10:00:46,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004858940] [2025-03-04 10:00:46,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:46,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:46,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:00:46,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:00:46,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:46,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:46,623 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:46,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:46,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004858940] [2025-03-04 10:00:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004858940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:46,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:46,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:46,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129092028] [2025-03-04 10:00:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:46,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:46,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:46,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:46,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 75 [2025-03-04 10:00:46,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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:46,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:46,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 75 [2025-03-04 10:00:46,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:46,873 INFO L124 PetriNetUnfolderBase]: 142/528 cut-off events. [2025-03-04 10:00:46,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:46,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 528 events. 142/528 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3284 event pairs, 99 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 797. Up to 246 conditions per place. [2025-03-04 10:00:46,880 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 37 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2025-03-04 10:00:46,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 245 flow [2025-03-04 10:00:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-04 10:00:46,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-04 10:00:46,893 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 151 flow. Second operand 3 states and 165 transitions. [2025-03-04 10:00:46,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 245 flow [2025-03-04 10:00:46,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:46,903 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 150 flow [2025-03-04 10:00:46,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-03-04 10:00:46,907 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2025-03-04 10:00:46,907 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 150 flow [2025-03-04 10:00:46,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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:46,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:46,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:00:46,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:00:46,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:46,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash 489897, now seen corresponding path program 1 times [2025-03-04 10:00:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494535984] [2025-03-04 10:00:46,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:46,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:00:46,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:00:46,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:46,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:47,045 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:47,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:47,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494535984] [2025-03-04 10:00:47,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494535984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:47,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:47,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:47,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666508526] [2025-03-04 10:00:47,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:47,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:47,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:47,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:47,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:47,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 75 [2025-03-04 10:00:47,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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:47,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:47,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 75 [2025-03-04 10:00:47,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:47,262 INFO L124 PetriNetUnfolderBase]: 132/496 cut-off events. [2025-03-04 10:00:47,262 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 10:00:47,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 496 events. 132/496 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3048 event pairs, 99 based on Foata normal form. 22/393 useless extension candidates. Maximal degree in co-relation 767. Up to 246 conditions per place. [2025-03-04 10:00:47,267 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 35 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-03-04 10:00:47,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 240 flow [2025-03-04 10:00:47,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-03-04 10:00:47,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511111111111111 [2025-03-04 10:00:47,270 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 150 flow. Second operand 3 states and 169 transitions. [2025-03-04 10:00:47,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 240 flow [2025-03-04 10:00:47,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:47,272 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 142 flow [2025-03-04 10:00:47,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2025-03-04 10:00:47,274 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-03-04 10:00:47,274 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 142 flow [2025-03-04 10:00:47,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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:47,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:47,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:00:47,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:00:47,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:47,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash 470804215, now seen corresponding path program 1 times [2025-03-04 10:00:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:47,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113788363] [2025-03-04 10:00:47,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:47,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:47,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:00:47,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:00:47,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:47,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:47,513 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:47,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113788363] [2025-03-04 10:00:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113788363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:47,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:47,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740621986] [2025-03-04 10:00:47,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:47,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:47,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:47,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:47,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:47,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-04 10:00:47,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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:47,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:47,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-04 10:00:47,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:47,841 INFO L124 PetriNetUnfolderBase]: 189/617 cut-off events. [2025-03-04 10:00:47,841 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 10:00:47,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 617 events. 189/617 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3775 event pairs, 160 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 1000. Up to 383 conditions per place. [2025-03-04 10:00:47,846 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 35 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-03-04 10:00:47,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 230 flow [2025-03-04 10:00:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:00:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:00:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2025-03-04 10:00:47,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6066666666666667 [2025-03-04 10:00:47,847 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 142 flow. Second operand 4 states and 182 transitions. [2025-03-04 10:00:47,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 230 flow [2025-03-04 10:00:47,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:47,851 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 166 flow [2025-03-04 10:00:47,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2025-03-04 10:00:47,852 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -4 predicate places. [2025-03-04 10:00:47,852 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 166 flow [2025-03-04 10:00:47,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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:47,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:47,853 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1] [2025-03-04 10:00:47,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:00:47,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:47,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:47,854 INFO L85 PathProgramCache]: Analyzing trace with hash 875706113, now seen corresponding path program 1 times [2025-03-04 10:00:47,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:47,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019318405] [2025-03-04 10:00:47,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:47,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:47,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:00:47,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:00:47,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:47,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:48,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:48,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019318405] [2025-03-04 10:00:48,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019318405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034411458] [2025-03-04 10:00:48,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:48,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:48,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:48,176 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:48,178 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:48,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:00:48,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:00:48,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:48,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:48,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:00:48,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:48,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:48,339 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:00:48,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:48,417 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:00:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:48,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:48,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:48,584 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:00:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:48,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034411458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:48,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:48,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-04 10:00:48,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588535816] [2025-03-04 10:00:48,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:48,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:00:48,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:48,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:00:48,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:00:49,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-04 10:00:49,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 166 flow. Second operand has 15 states, 15 states have (on average 35.4) internal successors, (531), 15 states have internal predecessors, (531), 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:49,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:49,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-04 10:00:49,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:50,439 INFO L124 PetriNetUnfolderBase]: 213/645 cut-off events. [2025-03-04 10:00:50,440 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 10:00:50,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 645 events. 213/645 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3791 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1105. Up to 229 conditions per place. [2025-03-04 10:00:50,443 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 67 selfloop transitions, 11 changer transitions 0/107 dead transitions. [2025-03-04 10:00:50,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 428 flow [2025-03-04 10:00:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:00:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:00:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 322 transitions. [2025-03-04 10:00:50,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-03-04 10:00:50,445 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 166 flow. Second operand 7 states and 322 transitions. [2025-03-04 10:00:50,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 428 flow [2025-03-04 10:00:50,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 107 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:50,447 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 240 flow [2025-03-04 10:00:50,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-03-04 10:00:50,448 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2025-03-04 10:00:50,448 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 240 flow [2025-03-04 10:00:50,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 35.4) internal successors, (531), 15 states have internal predecessors, (531), 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:50,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:50,449 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1] [2025-03-04 10:00:50,456 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:50,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:50,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:50,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash -751209974, now seen corresponding path program 1 times [2025-03-04 10:00:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:50,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962888517] [2025-03-04 10:00:50,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:50,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:50,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:00:50,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:00:50,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:50,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:00:50,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:50,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962888517] [2025-03-04 10:00:50,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962888517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:50,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:50,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:50,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342131798] [2025-03-04 10:00:50,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:50,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:00:50,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:50,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:00:50,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:00:50,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 75 [2025-03-04 10:00:50,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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:50,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:50,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 75 [2025-03-04 10:00:50,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:50,917 INFO L124 PetriNetUnfolderBase]: 174/600 cut-off events. [2025-03-04 10:00:50,917 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 10:00:50,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 600 events. 174/600 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3592 event pairs, 126 based on Foata normal form. 13/488 useless extension candidates. Maximal degree in co-relation 873. Up to 367 conditions per place. [2025-03-04 10:00:50,921 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 41 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2025-03-04 10:00:50,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 71 transitions, 312 flow [2025-03-04 10:00:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-03-04 10:00:50,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-03-04 10:00:50,923 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 240 flow. Second operand 3 states and 153 transitions. [2025-03-04 10:00:50,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 71 transitions, 312 flow [2025-03-04 10:00:50,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 71 transitions, 304 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:50,927 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 222 flow [2025-03-04 10:00:50,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2025-03-04 10:00:50,929 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-03-04 10:00:50,929 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 222 flow [2025-03-04 10:00:50,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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:50,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:50,929 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:50,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:00:50,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1809694353, now seen corresponding path program 1 times [2025-03-04 10:00:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338851207] [2025-03-04 10:00:50,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:50,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:00:50,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:00:50,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:50,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:00:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338851207] [2025-03-04 10:00:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338851207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:50,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:50,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:50,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664392793] [2025-03-04 10:00:50,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:50,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:50,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:50,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:50,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 75 [2025-03-04 10:00:50,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:50,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:50,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 75 [2025-03-04 10:00:50,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:51,130 INFO L124 PetriNetUnfolderBase]: 254/916 cut-off events. [2025-03-04 10:00:51,130 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-04 10:00:51,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1608 conditions, 916 events. 254/916 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5551 event pairs, 153 based on Foata normal form. 10/742 useless extension candidates. Maximal degree in co-relation 1594. Up to 300 conditions per place. [2025-03-04 10:00:51,136 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 53 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2025-03-04 10:00:51,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 91 transitions, 386 flow [2025-03-04 10:00:51,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-03-04 10:00:51,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488888888888889 [2025-03-04 10:00:51,137 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 222 flow. Second operand 3 states and 191 transitions. [2025-03-04 10:00:51,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 91 transitions, 386 flow [2025-03-04 10:00:51,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:51,141 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 248 flow [2025-03-04 10:00:51,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2025-03-04 10:00:51,144 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-03-04 10:00:51,145 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 248 flow [2025-03-04 10:00:51,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:51,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:51,145 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:51,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:00:51,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:51,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:51,145 INFO L85 PathProgramCache]: Analyzing trace with hash 382510052, now seen corresponding path program 1 times [2025-03-04 10:00:51,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:51,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241995658] [2025-03-04 10:00:51,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:51,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:51,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:00:51,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:00:51,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:51,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:00:51,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241995658] [2025-03-04 10:00:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241995658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:51,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:51,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713519011] [2025-03-04 10:00:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:51,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:51,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:51,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:51,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 75 [2025-03-04 10:00:51,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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:51,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:51,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 75 [2025-03-04 10:00:51,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:51,383 INFO L124 PetriNetUnfolderBase]: 279/939 cut-off events. [2025-03-04 10:00:51,383 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2025-03-04 10:00:51,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 939 events. 279/939 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5565 event pairs, 176 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 1757. Up to 473 conditions per place. [2025-03-04 10:00:51,387 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 55 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2025-03-04 10:00:51,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 86 transitions, 423 flow [2025-03-04 10:00:51,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-03-04 10:00:51,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2025-03-04 10:00:51,388 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 248 flow. Second operand 3 states and 174 transitions. [2025-03-04 10:00:51,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 86 transitions, 423 flow [2025-03-04 10:00:51,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 86 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:51,391 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 242 flow [2025-03-04 10:00:51,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2025-03-04 10:00:51,391 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-03-04 10:00:51,391 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 242 flow [2025-03-04 10:00:51,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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:51,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:51,392 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:51,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:00:51,392 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:51,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:51,392 INFO L85 PathProgramCache]: Analyzing trace with hash 382510053, now seen corresponding path program 1 times [2025-03-04 10:00:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:51,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509756219] [2025-03-04 10:00:51,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:51,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:00:51,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:00:51,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:51,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:51,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:51,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509756219] [2025-03-04 10:00:51,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509756219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:51,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937685499] [2025-03-04 10:00:51,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:51,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:51,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:51,469 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:51,471 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:51,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:00:51,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:00:51,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:51,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:51,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:00:51,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:51,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:51,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937685499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:51,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:51,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:00:51,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999236322] [2025-03-04 10:00:51,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:51,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:00:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:51,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:00:51,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:00:51,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-03-04 10:00:51,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 242 flow. Second operand has 9 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 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:51,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:51,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-03-04 10:00:51,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:52,123 INFO L124 PetriNetUnfolderBase]: 702/2330 cut-off events. [2025-03-04 10:00:52,123 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-03-04 10:00:52,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4229 conditions, 2330 events. 702/2330 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 13325 event pairs, 88 based on Foata normal form. 50/1987 useless extension candidates. Maximal degree in co-relation 4213. Up to 234 conditions per place. [2025-03-04 10:00:52,133 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 146 selfloop transitions, 16 changer transitions 0/191 dead transitions. [2025-03-04 10:00:52,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 191 transitions, 889 flow [2025-03-04 10:00:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:00:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:00:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 531 transitions. [2025-03-04 10:00:52,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-03-04 10:00:52,135 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 242 flow. Second operand 8 states and 531 transitions. [2025-03-04 10:00:52,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 191 transitions, 889 flow [2025-03-04 10:00:52,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 191 transitions, 859 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:52,138 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 346 flow [2025-03-04 10:00:52,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2025-03-04 10:00:52,139 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2025-03-04 10:00:52,139 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 346 flow [2025-03-04 10:00:52,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 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:52,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:52,139 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 1, 1] [2025-03-04 10:00:52,148 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:52,340 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,SelfDestructingSolverStorable7 [2025-03-04 10:00:52,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:52,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash 251701535, now seen corresponding path program 2 times [2025-03-04 10:00:52,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056290796] [2025-03-04 10:00:52,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:52,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:00:52,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:00:52,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:52,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:53,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:53,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056290796] [2025-03-04 10:00:53,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056290796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:53,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155084463] [2025-03-04 10:00:53,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:53,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:53,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:53,117 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:00:53,119 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:00:53,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:00:53,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:00:53,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:53,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:53,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 10:00:53,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:53,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:53,278 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:00:53,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:53,341 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:00:53,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:53,422 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:00:53,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:53,493 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:00:53,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:53,572 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:00:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:53,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:53,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:53,735 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:00:53,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:53,881 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:00:54,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:54,024 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:00:54,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:54,170 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:00:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:54,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155084463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:54,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:54,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 32 [2025-03-04 10:00:54,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770328408] [2025-03-04 10:00:54,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:54,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 10:00:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:54,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 10:00:54,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:00:59,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-04 10:00:59,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 346 flow. Second operand has 34 states, 34 states have (on average 35.411764705882355) internal successors, (1204), 34 states have internal predecessors, (1204), 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,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:59,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-04 10:00:59,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:00,661 INFO L124 PetriNetUnfolderBase]: 806/2506 cut-off events. [2025-03-04 10:01:00,662 INFO L125 PetriNetUnfolderBase]: For 796/796 co-relation queries the response was YES. [2025-03-04 10:01:00,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4950 conditions, 2506 events. 806/2506 cut-off events. For 796/796 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 14511 event pairs, 0 based on Foata normal form. 6/2127 useless extension candidates. Maximal degree in co-relation 4927. Up to 855 conditions per place. [2025-03-04 10:01:00,670 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 91 selfloop transitions, 28 changer transitions 0/147 dead transitions. [2025-03-04 10:01:00,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 147 transitions, 926 flow [2025-03-04 10:01:00,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:01:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:01:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 630 transitions. [2025-03-04 10:01:00,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-03-04 10:01:00,673 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 346 flow. Second operand 15 states and 630 transitions. [2025-03-04 10:01:00,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 147 transitions, 926 flow [2025-03-04 10:01:00,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 147 transitions, 908 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 10:01:00,677 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 547 flow [2025-03-04 10:01:00,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=547, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2025-03-04 10:01:00,678 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 35 predicate places. [2025-03-04 10:01:00,678 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 547 flow [2025-03-04 10:01:00,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 35.411764705882355) internal successors, (1204), 34 states have internal predecessors, (1204), 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,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:00,678 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:00,685 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:00,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:00,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:00,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1057982275, now seen corresponding path program 2 times [2025-03-04 10:01:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:00,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465197518] [2025-03-04 10:01:00,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:01:00,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:00,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 10:01:00,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 32 statements. [2025-03-04 10:01:00,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:01:00,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 10:01:00,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:00,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465197518] [2025-03-04 10:01:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465197518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:01:00,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:01:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:01:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150438045] [2025-03-04 10:01:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:01:00,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:01:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:00,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:01:00,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:01:00,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 75 [2025-03-04 10:01:00,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 547 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:00,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:00,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 75 [2025-03-04 10:01:00,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:01,222 INFO L124 PetriNetUnfolderBase]: 685/2347 cut-off events. [2025-03-04 10:01:01,222 INFO L125 PetriNetUnfolderBase]: For 1503/1503 co-relation queries the response was YES. [2025-03-04 10:01:01,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 2347 events. 685/2347 cut-off events. For 1503/1503 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 13852 event pairs, 504 based on Foata normal form. 68/2058 useless extension candidates. Maximal degree in co-relation 4733. Up to 1260 conditions per place. [2025-03-04 10:01:01,232 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 77 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-03-04 10:01:01,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 857 flow [2025-03-04 10:01:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:01:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:01:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-03-04 10:01:01,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7822222222222223 [2025-03-04 10:01:01,234 INFO L175 Difference]: Start difference. First operand has 110 places, 88 transitions, 547 flow. Second operand 3 states and 176 transitions. [2025-03-04 10:01:01,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 857 flow [2025-03-04 10:01:01,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 108 transitions, 795 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-04 10:01:01,241 INFO L231 Difference]: Finished difference. Result has 105 places, 86 transitions, 492 flow [2025-03-04 10:01:01,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=105, PETRI_TRANSITIONS=86} [2025-03-04 10:01:01,242 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 30 predicate places. [2025-03-04 10:01:01,242 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 86 transitions, 492 flow [2025-03-04 10:01:01,242 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:01,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:01,243 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:01,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:01:01,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -76366143, now seen corresponding path program 1 times [2025-03-04 10:01:01,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:01,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956378719] [2025-03-04 10:01:01,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:01,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:01,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:01:01,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:01:01,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:01,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:01,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:01,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956378719] [2025-03-04 10:01:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956378719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682408725] [2025-03-04 10:01:01,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:01,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:01,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:01,424 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:01,425 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:01,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:01:01,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:01:01,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:01,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:01,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:01:01,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:01:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:01,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:01:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:01,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682408725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:01:01,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:01:01,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-04 10:01:01,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297205316] [2025-03-04 10:01:01,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:01:01,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:01:01,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:01,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:01:01,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:01:01,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-03-04 10:01:01,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 86 transitions, 492 flow. Second operand has 13 states, 13 states have (on average 48.15384615384615) internal successors, (626), 13 states have internal predecessors, (626), 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,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:01,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-03-04 10:01:01,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:02,441 INFO L124 PetriNetUnfolderBase]: 1142/3757 cut-off events. [2025-03-04 10:01:02,442 INFO L125 PetriNetUnfolderBase]: For 2034/2034 co-relation queries the response was YES. [2025-03-04 10:01:02,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7427 conditions, 3757 events. 1142/3757 cut-off events. For 2034/2034 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 21455 event pairs, 27 based on Foata normal form. 44/3193 useless extension candidates. Maximal degree in co-relation 7394. Up to 235 conditions per place. [2025-03-04 10:01:02,464 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 234 selfloop transitions, 25 changer transitions 0/286 dead transitions. [2025-03-04 10:01:02,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 286 transitions, 1611 flow [2025-03-04 10:01:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:01:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:01:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 806 transitions. [2025-03-04 10:01:02,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8955555555555555 [2025-03-04 10:01:02,467 INFO L175 Difference]: Start difference. First operand has 105 places, 86 transitions, 492 flow. Second operand 12 states and 806 transitions. [2025-03-04 10:01:02,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 286 transitions, 1611 flow [2025-03-04 10:01:02,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 286 transitions, 1565 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:01:02,476 INFO L231 Difference]: Finished difference. Result has 119 places, 88 transitions, 606 flow [2025-03-04 10:01:02,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=606, PETRI_PLACES=119, PETRI_TRANSITIONS=88} [2025-03-04 10:01:02,477 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 44 predicate places. [2025-03-04 10:01:02,477 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 88 transitions, 606 flow [2025-03-04 10:01:02,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.15384615384615) internal successors, (626), 13 states have internal predecessors, (626), 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:02,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:02,478 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 1, 1] [2025-03-04 10:01:02,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:01:02,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:02,678 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:02,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:02,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1104172635, now seen corresponding path program 3 times [2025-03-04 10:01:02,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:02,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936551293] [2025-03-04 10:01:02,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:01:02,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:02,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-03-04 10:01:02,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:01:02,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:01:02,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 183 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:03,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:03,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936551293] [2025-03-04 10:01:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936551293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:03,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919217083] [2025-03-04 10:01:03,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:01:03,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:03,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:03,111 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:03,113 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:03,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-03-04 10:01:38,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:01:38,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:01:38,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:38,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:01:38,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:01:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:38,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:01:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919217083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:01:38,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:01:38,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2025-03-04 10:01:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709477655] [2025-03-04 10:01:38,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:01:38,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:01:38,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:38,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:01:38,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:01:38,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-03-04 10:01:38,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 88 transitions, 606 flow. Second operand has 13 states, 13 states have (on average 47.53846153846154) internal successors, (618), 13 states have internal predecessors, (618), 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:38,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:38,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-03-04 10:01:38,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:39,148 INFO L124 PetriNetUnfolderBase]: 1131/3760 cut-off events. [2025-03-04 10:01:39,148 INFO L125 PetriNetUnfolderBase]: For 2323/2323 co-relation queries the response was YES. [2025-03-04 10:01:39,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7405 conditions, 3760 events. 1131/3760 cut-off events. For 2323/2323 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 21753 event pairs, 80 based on Foata normal form. 11/3146 useless extension candidates. Maximal degree in co-relation 7366. Up to 228 conditions per place. [2025-03-04 10:01:39,163 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 242 selfloop transitions, 23 changer transitions 1/292 dead transitions. [2025-03-04 10:01:39,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 292 transitions, 1647 flow [2025-03-04 10:01:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:01:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:01:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 853 transitions. [2025-03-04 10:01:39,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748717948717949 [2025-03-04 10:01:39,165 INFO L175 Difference]: Start difference. First operand has 119 places, 88 transitions, 606 flow. Second operand 13 states and 853 transitions. [2025-03-04 10:01:39,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 292 transitions, 1647 flow [2025-03-04 10:01:39,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 292 transitions, 1547 flow, removed 0 selfloop flow, removed 14 redundant places. [2025-03-04 10:01:39,174 INFO L231 Difference]: Finished difference. Result has 116 places, 84 transitions, 519 flow [2025-03-04 10:01:39,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=519, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2025-03-04 10:01:39,175 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 41 predicate places. [2025-03-04 10:01:39,175 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 84 transitions, 519 flow [2025-03-04 10:01:39,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 47.53846153846154) internal successors, (618), 13 states have internal predecessors, (618), 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:39,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:39,175 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:39,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:01:39,376 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,SelfDestructingSolverStorable11 [2025-03-04 10:01:39,376 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:39,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:39,377 INFO L85 PathProgramCache]: Analyzing trace with hash 596381081, now seen corresponding path program 2 times [2025-03-04 10:01:39,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:39,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304955284] [2025-03-04 10:01:39,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:01:39,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:39,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-04 10:01:39,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:01:39,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:01:39,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:39,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:39,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304955284] [2025-03-04 10:01:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304955284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:39,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637497304] [2025-03-04 10:01:39,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:01:39,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:39,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:39,837 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:39,838 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:39,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-04 10:01:40,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:01:40,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:01:40,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:40,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:01:40,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:01:40,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:40,188 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 16 treesize of output 11 [2025-03-04 10:01:40,194 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:01:40,194 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:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:40,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:01:40,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-04 10:01:40,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:01:40,356 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 46 treesize of output 64 [2025-03-04 10:01:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637497304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:01:40,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:01:40,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2025-03-04 10:01:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762864505] [2025-03-04 10:01:40,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:01:40,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:01:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:40,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:01:40,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:01:41,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-04 10:01:41,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 84 transitions, 519 flow. Second operand has 31 states, 31 states have (on average 36.67741935483871) internal successors, (1137), 31 states have internal predecessors, (1137), 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:41,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:41,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-04 10:01:41,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:43,054 INFO L124 PetriNetUnfolderBase]: 1211/3867 cut-off events. [2025-03-04 10:01:43,054 INFO L125 PetriNetUnfolderBase]: For 1641/1641 co-relation queries the response was YES. [2025-03-04 10:01:43,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7400 conditions, 3867 events. 1211/3867 cut-off events. For 1641/1641 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 22252 event pairs, 126 based on Foata normal form. 20/3245 useless extension candidates. Maximal degree in co-relation 7369. Up to 294 conditions per place. [2025-03-04 10:01:43,069 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 303 selfloop transitions, 50 changer transitions 1/380 dead transitions. [2025-03-04 10:01:43,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 380 transitions, 1917 flow [2025-03-04 10:01:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:01:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 10:01:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1104 transitions. [2025-03-04 10:01:43,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6690909090909091 [2025-03-04 10:01:43,071 INFO L175 Difference]: Start difference. First operand has 116 places, 84 transitions, 519 flow. Second operand 22 states and 1104 transitions. [2025-03-04 10:01:43,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 380 transitions, 1917 flow [2025-03-04 10:01:43,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 380 transitions, 1871 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-04 10:01:43,079 INFO L231 Difference]: Finished difference. Result has 127 places, 106 transitions, 697 flow [2025-03-04 10:01:43,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=697, PETRI_PLACES=127, PETRI_TRANSITIONS=106} [2025-03-04 10:01:43,080 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 52 predicate places. [2025-03-04 10:01:43,080 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 106 transitions, 697 flow [2025-03-04 10:01:43,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 36.67741935483871) internal successors, (1137), 31 states have internal predecessors, (1137), 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:43,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:43,080 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:43,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:01:43,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:43,281 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:43,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:43,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1859043861, now seen corresponding path program 1 times [2025-03-04 10:01:43,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:43,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843447974] [2025-03-04 10:01:43,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:43,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:01:43,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:01:43,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:43,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:43,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:43,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843447974] [2025-03-04 10:01:43,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843447974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:43,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772146415] [2025-03-04 10:01:43,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:43,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:43,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:43,795 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:43,796 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:01:43,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:01:44,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:01:44,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:44,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:44,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:01:44,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:01:44,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:44,132 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 16 treesize of output 11 [2025-03-04 10:01:44,141 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:01:44,141 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:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:44,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:01:44,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-04 10:01:44,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:01:44,274 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 46 treesize of output 64 [2025-03-04 10:01:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:44,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772146415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:01:44,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:01:44,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 27 [2025-03-04 10:01:44,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28732857] [2025-03-04 10:01:44,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:01:44,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:01:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:01:44,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:01:44,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:01:45,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 75 [2025-03-04 10:01:45,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 106 transitions, 697 flow. Second operand has 29 states, 29 states have (on average 40.758620689655174) internal successors, (1182), 29 states have internal predecessors, (1182), 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:45,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:01:45,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 75 [2025-03-04 10:01:45,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:01:48,137 INFO L124 PetriNetUnfolderBase]: 2713/8815 cut-off events. [2025-03-04 10:01:48,137 INFO L125 PetriNetUnfolderBase]: For 4715/4723 co-relation queries the response was YES. [2025-03-04 10:01:48,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17578 conditions, 8815 events. 2713/8815 cut-off events. For 4715/4723 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 65788 event pairs, 181 based on Foata normal form. 114/7375 useless extension candidates. Maximal degree in co-relation 17545. Up to 342 conditions per place. [2025-03-04 10:01:48,171 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 627 selfloop transitions, 120 changer transitions 2/782 dead transitions. [2025-03-04 10:01:48,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 782 transitions, 4261 flow [2025-03-04 10:01:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 10:01:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-04 10:01:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2530 transitions. [2025-03-04 10:01:48,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-04 10:01:48,175 INFO L175 Difference]: Start difference. First operand has 127 places, 106 transitions, 697 flow. Second operand 46 states and 2530 transitions. [2025-03-04 10:01:48,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 782 transitions, 4261 flow [2025-03-04 10:01:48,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 782 transitions, 3995 flow, removed 20 selfloop flow, removed 15 redundant places. [2025-03-04 10:01:48,192 INFO L231 Difference]: Finished difference. Result has 201 places, 203 transitions, 1572 flow [2025-03-04 10:01:48,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1572, PETRI_PLACES=201, PETRI_TRANSITIONS=203} [2025-03-04 10:01:48,193 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 126 predicate places. [2025-03-04 10:01:48,193 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 203 transitions, 1572 flow [2025-03-04 10:01:48,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 40.758620689655174) internal successors, (1182), 29 states have internal predecessors, (1182), 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:48,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:01:48,194 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:01:48,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:01:48,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:48,398 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:01:48,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:01:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1307944786, now seen corresponding path program 1 times [2025-03-04 10:01:48,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:01:48,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125614728] [2025-03-04 10:01:48,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:48,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:01:48,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:01:48,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:01:48,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:48,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 108 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:51,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:01:51,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125614728] [2025-03-04 10:01:51,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125614728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:01:51,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731605338] [2025-03-04 10:01:51,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:01:51,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:01:51,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:01:51,334 INFO L229 MonitoredProcess]: Starting monitored process 9 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:51,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:01:51,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:01:51,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:01:51,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:01:51,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:01:51,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-04 10:01:51,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:01:51,595 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:01:51,606 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:01:51,619 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-04 10:01:51,620 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 2 case distinctions, treesize of input 23 treesize of output 24 [2025-03-04 10:01:51,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:51,639 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 29 treesize of output 13 [2025-03-04 10:01:51,648 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-04 10:01:51,649 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 18 [2025-03-04 10:01:51,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:51,671 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 29 treesize of output 13 [2025-03-04 10:01:51,685 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-04 10:01:51,685 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 18 [2025-03-04 10:01:51,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:51,707 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 29 treesize of output 13 [2025-03-04 10:01:51,720 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-04 10:01:51,720 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 18 [2025-03-04 10:01:51,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:51,745 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 29 treesize of output 13 [2025-03-04 10:01:51,757 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2025-03-04 10:01:51,757 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 2 case distinctions, treesize of input 21 treesize of output 29 [2025-03-04 10:01:51,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:51,798 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 37 treesize of output 17 [2025-03-04 10:01:51,841 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-03-04 10:01:51,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2025-03-04 10:01:51,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:51,886 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 37 treesize of output 17 [2025-03-04 10:01:51,923 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-03-04 10:01:51,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2025-03-04 10:01:51,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:51,968 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 37 treesize of output 17 [2025-03-04 10:01:52,010 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-03-04 10:01:52,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2025-03-04 10:01:52,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:52,074 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 37 treesize of output 17 [2025-03-04 10:01:52,119 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-03-04 10:01:52,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2025-03-04 10:01:52,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:01:52,171 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 37 treesize of output 17 [2025-03-04 10:01:52,253 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-03-04 10:01:52,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2025-03-04 10:01:52,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 10:01:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:01:52,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:01:56,374 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2915) |c_~#slot~0.offset|)) 1)) is different from false [2025-03-04 10:02:10,218 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_230| Int) (v_ArrVal_2915 Int) (|v_ULTIMATE.start_new_~p~0#1.base_118| Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (v_ArrVal_2909 Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (v_ArrVal_2912 Int)) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_118| 1) |v_ULTIMATE.start_new_~p~0#1.base_117| 1) (select (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2909) (+ (* |v_ULTIMATE.start_main_~j~0#1_230| 4) |c_~#slot~0.offset|) v_ArrVal_2912) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) v_ArrVal_2915) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_230| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |v_ULTIMATE.start_main_~j~0#1_230| 1)))) is different from false [2025-03-04 10:02:11,912 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_230| Int) (v_ArrVal_2915 Int) (|v_ULTIMATE.start_new_~p~0#1.base_119| Int) (|v_ULTIMATE.start_new_~p~0#1.base_118| Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (v_ArrVal_2909 Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (v_ArrVal_2912 Int)) (or (= (select (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_119| 1) |v_ULTIMATE.start_new_~p~0#1.base_118| 1) |v_ULTIMATE.start_new_~p~0#1.base_117| 1) (select (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2909) (+ (* |v_ULTIMATE.start_main_~j~0#1_230| 4) |c_~#slot~0.offset|) v_ArrVal_2912) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) v_ArrVal_2915) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_230| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |v_ULTIMATE.start_main_~j~0#1_230| 1)))) is different from false [2025-03-04 10:02:13,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_230| Int) (v_ArrVal_2915 Int) (|v_ULTIMATE.start_new_~p~0#1.base_119| Int) (|v_ULTIMATE.start_new_~p~0#1.base_118| Int) (v_ArrVal_2906 Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (|v_ULTIMATE.start_main_~j~0#1_231| Int) (v_ArrVal_2909 Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (v_ArrVal_2912 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_230| (+ |v_ULTIMATE.start_main_~j~0#1_231| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |v_ULTIMATE.start_main_~j~0#1_230| 1)) (< |v_ULTIMATE.start_main_~j~0#1_231| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (= (select (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_119| 1) |v_ULTIMATE.start_new_~p~0#1.base_118| 1) |v_ULTIMATE.start_new_~p~0#1.base_117| 1) (select (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2906) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_231| 4)) v_ArrVal_2909) (+ (* |v_ULTIMATE.start_main_~j~0#1_230| 4) |c_~#slot~0.offset|) v_ArrVal_2912) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) v_ArrVal_2915) |c_~#slot~0.offset|)) 1))) is different from false [2025-03-04 10:02:15,529 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_230| Int) (v_ArrVal_2915 Int) (|v_ULTIMATE.start_new_~p~0#1.base_119| Int) (|v_ULTIMATE.start_new_~p~0#1.base_118| Int) (v_ArrVal_2906 Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (|v_ULTIMATE.start_main_~j~0#1_231| Int) (v_ArrVal_2909 Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (|v_ULTIMATE.start_new_~p~0#1.base_120| Int) (v_ArrVal_2912 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_230| (+ |v_ULTIMATE.start_main_~j~0#1_231| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |v_ULTIMATE.start_main_~j~0#1_230| 1)) (< |v_ULTIMATE.start_main_~j~0#1_231| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (= (select (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_120| 1) |v_ULTIMATE.start_new_~p~0#1.base_119| 1) |v_ULTIMATE.start_new_~p~0#1.base_118| 1) |v_ULTIMATE.start_new_~p~0#1.base_117| 1) (select (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2906) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_231| 4)) v_ArrVal_2909) (+ (* |v_ULTIMATE.start_main_~j~0#1_230| 4) |c_~#slot~0.offset|) v_ArrVal_2912) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) v_ArrVal_2915) |c_~#slot~0.offset|)) 1))) is different from false [2025-03-04 10:02:17,299 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 Int) (v_ArrVal_2906 Int) (v_ArrVal_2909 Int) (|v_ULTIMATE.start_new_~p~0#1.base_120| Int) (|v_ULTIMATE.start_main_~j~0#1_230| Int) (|v_ULTIMATE.start_new_~p~0#1.base_119| Int) (|v_ULTIMATE.start_new_~p~0#1.base_118| Int) (|v_ULTIMATE.start_main_~j~0#1_232| Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (|v_ULTIMATE.start_main_~j~0#1_231| Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (v_ArrVal_2902 Int) (v_ArrVal_2912 Int)) (or (= (select (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_120| 1) |v_ULTIMATE.start_new_~p~0#1.base_119| 1) |v_ULTIMATE.start_new_~p~0#1.base_118| 1) |v_ULTIMATE.start_new_~p~0#1.base_117| 1) (select (store (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2902) (+ (* |v_ULTIMATE.start_main_~j~0#1_232| 4) |c_~#slot~0.offset|) v_ArrVal_2906) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_231| 4)) v_ArrVal_2909) (+ (* |v_ULTIMATE.start_main_~j~0#1_230| 4) |c_~#slot~0.offset|) v_ArrVal_2912) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) v_ArrVal_2915) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_230| (+ |v_ULTIMATE.start_main_~j~0#1_231| 1)) (< |v_ULTIMATE.start_main_~j~0#1_232| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |v_ULTIMATE.start_main_~j~0#1_230| 1)) (< |v_ULTIMATE.start_main_~j~0#1_231| (+ |v_ULTIMATE.start_main_~j~0#1_232| 1)))) is different from false