./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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_13-arraycollapse_nr-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:16:58,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:16:58,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:16:58,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:16:58,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:16:59,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:16:59,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:16:59,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:16:59,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:16:59,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:16:59,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:16:59,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:16:59,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:16:59,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:16:59,021 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:16:59,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:16:59,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:16:59,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:16:59,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:16:59,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:59,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:16:59,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:16:59,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:16:59,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:16:59,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:16:59,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:16:59,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:16:59,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:16:59,025 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 -> e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 [2025-03-17 14:16:59,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:16:59,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:16:59,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:16:59,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:16:59,249 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:16:59,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2025-03-17 14:17:00,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6014a49/90e34ba84cde4c3db1444af3b8c09fd5/FLAGda6867e5a [2025-03-17 14:17:00,639 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:17:00,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2025-03-17 14:17:00,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6014a49/90e34ba84cde4c3db1444af3b8c09fd5/FLAGda6867e5a [2025-03-17 14:17:00,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6014a49/90e34ba84cde4c3db1444af3b8c09fd5 [2025-03-17 14:17:00,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:17:00,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:17:00,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:17:00,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:17:00,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:17:00,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af21f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:00, skipping insertion in model container [2025-03-17 14:17:00,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:17:00" (1/1) ... [2025-03-17 14:17:00,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:17:01,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:17:01,159 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:17:01,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:17:01,261 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:17:01,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01 WrapperNode [2025-03-17 14:17:01,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:17:01,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:17:01,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:17:01,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:17:01,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,304 INFO L138 Inliner]: procedures = 372, calls = 100, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 257 [2025-03-17 14:17:01,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:17:01,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:17:01,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:17:01,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:17:01,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,343 INFO L175 MemorySlicer]: Split 99 memory accesses to 3 slices as follows [50, 18, 31]. 51 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 26 writes are split as follows [0, 2, 24]. [2025-03-17 14:17:01,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:17:01,360 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:17:01,360 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:17:01,360 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:17:01,361 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (1/1) ... [2025-03-17 14:17:01,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:17:01,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:01,392 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-17 14:17:01,395 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-17 14:17:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:17:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:17:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 14:17:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 14:17:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 14:17:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 14:17:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:17:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:17:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:17:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:17:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:17:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:17:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:17:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:17:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:17:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:17:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:17:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:17:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 14:17:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 14:17:01,413 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 14:17:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:17:01,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:17:01,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:17:01,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:17:01,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:17:01,415 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:17:01,547 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:17:01,549 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:17:02,094 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:17:02,094 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:17:02,361 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:17:02,362 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:17:02,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:17:02 BoogieIcfgContainer [2025-03-17 14:17:02,363 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:17:02,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:17:02,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:17:02,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:17:02,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:17:00" (1/3) ... [2025-03-17 14:17:02,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460c124d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:17:02, skipping insertion in model container [2025-03-17 14:17:02,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:01" (2/3) ... [2025-03-17 14:17:02,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460c124d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:17:02, skipping insertion in model container [2025-03-17 14:17:02,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:17:02" (3/3) ... [2025-03-17 14:17:02,371 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr-deref.i [2025-03-17 14:17:02,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:17:02,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr-deref.i that has 2 procedures, 134 locations, 1 initial locations, 1 loop locations, and 79 error locations. [2025-03-17 14:17:02,387 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:17:02,442 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:17:02,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 272 flow [2025-03-17 14:17:02,501 INFO L124 PetriNetUnfolderBase]: 1/133 cut-off events. [2025-03-17 14:17:02,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:02,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 133 events. 1/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 270 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2025-03-17 14:17:02,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 134 transitions, 272 flow [2025-03-17 14:17:02,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 133 transitions, 269 flow [2025-03-17 14:17:02,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:17:02,531 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;@5b4662b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:17:02,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-03-17 14:17:02,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:17:02,534 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:17:02,535 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:02,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:02,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:17:02,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:02,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:02,540 INFO L85 PathProgramCache]: Analyzing trace with hash 801869, now seen corresponding path program 1 times [2025-03-17 14:17:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:02,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432777454] [2025-03-17 14:17:02,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:02,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:02,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:17:02,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:17:02,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:02,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:02,800 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-17 14:17:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432777454] [2025-03-17 14:17:02,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432777454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:02,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:02,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865754636] [2025-03-17 14:17:02,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:02,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:02,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:02,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:02,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:02,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-03-17 14:17:02,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-17 14:17:02,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:02,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-03-17 14:17:02,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:03,013 INFO L124 PetriNetUnfolderBase]: 64/330 cut-off events. [2025-03-17 14:17:03,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:03,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 330 events. 64/330 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1325 event pairs, 63 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 377. Up to 167 conditions per place. [2025-03-17 14:17:03,017 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-03-17 14:17:03,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 353 flow [2025-03-17 14:17:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-03-17 14:17:03,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8059701492537313 [2025-03-17 14:17:03,028 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 269 flow. Second operand 3 states and 324 transitions. [2025-03-17 14:17:03,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 353 flow [2025-03-17 14:17:03,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:03,038 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 280 flow [2025-03-17 14:17:03,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=138, PETRI_TRANSITIONS=134} [2025-03-17 14:17:03,044 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2025-03-17 14:17:03,044 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 280 flow [2025-03-17 14:17:03,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-17 14:17:03,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:03,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:17:03,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:17:03,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:03,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash 24854738, now seen corresponding path program 1 times [2025-03-17 14:17:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:03,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452929985] [2025-03-17 14:17:03,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:03,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:03,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:17:03,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:17:03,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:03,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:03,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:03,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452929985] [2025-03-17 14:17:03,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452929985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:03,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117508715] [2025-03-17 14:17:03,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:03,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:03,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:03,152 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-17 14:17:03,153 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-17 14:17:03,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:17:03,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:17:03,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:03,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:03,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:17:03,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:03,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:03,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117508715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:03,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:03,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:17:03,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125687400] [2025-03-17 14:17:03,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:03,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:17:03,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:03,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:17:03,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:17:03,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-03-17 14:17:03,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 134 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-17 14:17:03,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:03,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-03-17 14:17:03,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:03,449 INFO L124 PetriNetUnfolderBase]: 64/333 cut-off events. [2025-03-17 14:17:03,449 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:03,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 333 events. 64/333 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1319 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 506. Up to 167 conditions per place. [2025-03-17 14:17:03,452 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-17 14:17:03,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 380 flow [2025-03-17 14:17:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:17:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:17:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2025-03-17 14:17:03,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7599502487562189 [2025-03-17 14:17:03,456 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 280 flow. Second operand 6 states and 611 transitions. [2025-03-17 14:17:03,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 380 flow [2025-03-17 14:17:03,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 137 transitions, 376 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:03,461 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 312 flow [2025-03-17 14:17:03,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2025-03-17 14:17:03,462 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 9 predicate places. [2025-03-17 14:17:03,462 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 312 flow [2025-03-17 14:17:03,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-17 14:17:03,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:03,463 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-03-17 14:17:03,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:03,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:03,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:03,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1709946253, now seen corresponding path program 2 times [2025-03-17 14:17:03,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:03,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083659723] [2025-03-17 14:17:03,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:17:03,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:03,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-17 14:17:03,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 7 statements. [2025-03-17 14:17:03,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:17:03,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:17:03,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:03,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083659723] [2025-03-17 14:17:03,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083659723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:03,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:03,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:03,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11508598] [2025-03-17 14:17:03,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:03,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:03,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:03,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:03,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:03,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2025-03-17 14:17:03,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-17 14:17:03,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:03,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2025-03-17 14:17:03,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:03,976 INFO L124 PetriNetUnfolderBase]: 64/321 cut-off events. [2025-03-17 14:17:03,976 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:17:03,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 321 events. 64/321 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1263 event pairs, 63 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 491. Up to 165 conditions per place. [2025-03-17 14:17:03,980 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2025-03-17 14:17:03,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 388 flow [2025-03-17 14:17:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-17 14:17:03,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2025-03-17 14:17:03,983 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 312 flow. Second operand 3 states and 286 transitions. [2025-03-17 14:17:03,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 125 transitions, 388 flow [2025-03-17 14:17:03,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 374 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:03,987 INFO L231 Difference]: Finished difference. Result has 134 places, 125 transitions, 298 flow [2025-03-17 14:17:03,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=134, PETRI_TRANSITIONS=125} [2025-03-17 14:17:03,988 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-03-17 14:17:03,989 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 125 transitions, 298 flow [2025-03-17 14:17:03,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-17 14:17:03,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:03,989 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-03-17 14:17:03,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:17:03,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:03,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:03,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1709946254, now seen corresponding path program 1 times [2025-03-17 14:17:03,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:03,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948001013] [2025-03-17 14:17:03,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:03,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:04,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:17:04,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:17:04,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:04,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:04,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948001013] [2025-03-17 14:17:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948001013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705314497] [2025-03-17 14:17:04,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:04,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:04,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:04,122 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-17 14:17:04,123 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-17 14:17:04,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:17:04,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:17:04,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:04,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:04,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:17:04,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:04,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:04,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705314497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:04,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:04,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 14:17:04,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329218151] [2025-03-17 14:17:04,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:04,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:17:04,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:04,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:17:04,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:17:04,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-03-17 14:17:04,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 125 transitions, 298 flow. Second operand has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 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-17 14:17:04,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:04,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-03-17 14:17:04,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:04,408 INFO L124 PetriNetUnfolderBase]: 64/327 cut-off events. [2025-03-17 14:17:04,408 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-17 14:17:04,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 327 events. 64/327 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1279 event pairs, 63 based on Foata normal form. 6/256 useless extension candidates. Maximal degree in co-relation 497. Up to 167 conditions per place. [2025-03-17 14:17:04,410 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 11 changer transitions 0/131 dead transitions. [2025-03-17 14:17:04,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 131 transitions, 434 flow [2025-03-17 14:17:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:17:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:17:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1184 transitions. [2025-03-17 14:17:04,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2025-03-17 14:17:04,412 INFO L175 Difference]: Start difference. First operand has 134 places, 125 transitions, 298 flow. Second operand 12 states and 1184 transitions. [2025-03-17 14:17:04,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 131 transitions, 434 flow [2025-03-17 14:17:04,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 131 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:04,415 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 358 flow [2025-03-17 14:17:04,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=358, PETRI_PLACES=149, PETRI_TRANSITIONS=131} [2025-03-17 14:17:04,416 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 13 predicate places. [2025-03-17 14:17:04,416 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 131 transitions, 358 flow [2025-03-17 14:17:04,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 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-17 14:17:04,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:04,417 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2025-03-17 14:17:04,424 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-17 14:17:04,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 14:17:04,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:04,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash -402489490, now seen corresponding path program 2 times [2025-03-17 14:17:04,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:04,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588096459] [2025-03-17 14:17:04,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:17:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:04,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 14:17:04,633 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 13 statements. [2025-03-17 14:17:04,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:17:04,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588096459] [2025-03-17 14:17:04,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588096459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:04,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:04,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:04,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100687354] [2025-03-17 14:17:04,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:04,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:04,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:04,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:04,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:04,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2025-03-17 14:17:04,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 131 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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-17 14:17:04,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:04,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2025-03-17 14:17:04,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:04,893 INFO L124 PetriNetUnfolderBase]: 64/315 cut-off events. [2025-03-17 14:17:04,893 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-17 14:17:04,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 315 events. 64/315 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1243 event pairs, 63 based on Foata normal form. 6/250 useless extension candidates. Maximal degree in co-relation 479. Up to 171 conditions per place. [2025-03-17 14:17:04,895 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/119 dead transitions. [2025-03-17 14:17:04,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 119 transitions, 434 flow [2025-03-17 14:17:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:04,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2025-03-17 14:17:04,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2025-03-17 14:17:04,896 INFO L175 Difference]: Start difference. First operand has 149 places, 131 transitions, 358 flow. Second operand 3 states and 298 transitions. [2025-03-17 14:17:04,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 119 transitions, 434 flow [2025-03-17 14:17:04,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 386 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-17 14:17:04,901 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 310 flow [2025-03-17 14:17:04,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2025-03-17 14:17:04,901 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-03-17 14:17:04,901 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 310 flow [2025-03-17 14:17:04,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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-17 14:17:04,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:04,902 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-17 14:17:04,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:17:04,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:04,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:04,902 INFO L85 PathProgramCache]: Analyzing trace with hash -245323049, now seen corresponding path program 1 times [2025-03-17 14:17:04,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:04,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322053368] [2025-03-17 14:17:04,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:04,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:04,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:17:04,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:17:04,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:04,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:05,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:05,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322053368] [2025-03-17 14:17:05,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322053368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:05,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:05,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:05,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248684908] [2025-03-17 14:17:05,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:05,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:17:05,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:05,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:17:05,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:17:05,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 134 [2025-03-17 14:17:05,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-17 14:17:05,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:05,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 134 [2025-03-17 14:17:05,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:05,428 INFO L124 PetriNetUnfolderBase]: 73/329 cut-off events. [2025-03-17 14:17:05,430 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-17 14:17:05,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 329 events. 73/329 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1341 event pairs, 72 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 530. Up to 201 conditions per place. [2025-03-17 14:17:05,434 INFO L140 encePairwiseOnDemand]: 125/134 looper letters, 56 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2025-03-17 14:17:05,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 111 transitions, 408 flow [2025-03-17 14:17:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-03-17 14:17:05,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2025-03-17 14:17:05,435 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 310 flow. Second operand 3 states and 292 transitions. [2025-03-17 14:17:05,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 111 transitions, 408 flow [2025-03-17 14:17:05,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 111 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:05,437 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 272 flow [2025-03-17 14:17:05,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2025-03-17 14:17:05,440 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -10 predicate places. [2025-03-17 14:17:05,441 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 272 flow [2025-03-17 14:17:05,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-17 14:17:05,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:05,442 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-17 14:17:05,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:17:05,442 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:05,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:05,443 INFO L85 PathProgramCache]: Analyzing trace with hash -245323048, now seen corresponding path program 1 times [2025-03-17 14:17:05,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:05,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527939467] [2025-03-17 14:17:05,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:05,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:05,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:17:05,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:17:05,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:05,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:05,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527939467] [2025-03-17 14:17:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527939467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:05,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:17:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652932918] [2025-03-17 14:17:05,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:05,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:05,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:05,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:05,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:05,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 134 [2025-03-17 14:17:05,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 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-17 14:17:05,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:05,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 134 [2025-03-17 14:17:05,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:06,156 INFO L124 PetriNetUnfolderBase]: 73/323 cut-off events. [2025-03-17 14:17:06,156 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-17 14:17:06,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 323 events. 73/323 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1311 event pairs, 63 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 540. Up to 158 conditions per place. [2025-03-17 14:17:06,157 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 43 selfloop transitions, 14 changer transitions 3/116 dead transitions. [2025-03-17 14:17:06,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 402 flow [2025-03-17 14:17:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2025-03-17 14:17:06,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6850746268656717 [2025-03-17 14:17:06,161 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 272 flow. Second operand 5 states and 459 transitions. [2025-03-17 14:17:06,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 402 flow [2025-03-17 14:17:06,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 116 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:06,163 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 291 flow [2025-03-17 14:17:06,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2025-03-17 14:17:06,166 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -11 predicate places. [2025-03-17 14:17:06,166 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 291 flow [2025-03-17 14:17:06,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 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-17 14:17:06,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:06,166 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:06,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:17:06,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:06,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:06,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1438238183, now seen corresponding path program 1 times [2025-03-17 14:17:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:06,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419676874] [2025-03-17 14:17:06,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:06,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:06,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:17:06,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:17:06,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:06,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:06,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:06,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419676874] [2025-03-17 14:17:06,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419676874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:06,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:06,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:17:06,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35029902] [2025-03-17 14:17:06,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:06,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:17:06,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:06,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:17:06,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:17:06,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2025-03-17 14:17:06,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 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-17 14:17:06,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:06,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2025-03-17 14:17:06,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:07,071 INFO L124 PetriNetUnfolderBase]: 64/291 cut-off events. [2025-03-17 14:17:07,071 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 14:17:07,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 291 events. 64/291 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1132 event pairs, 63 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 524. Up to 166 conditions per place. [2025-03-17 14:17:07,072 INFO L140 encePairwiseOnDemand]: 112/134 looper letters, 46 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-03-17 14:17:07,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 102 transitions, 407 flow [2025-03-17 14:17:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:17:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:17:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 570 transitions. [2025-03-17 14:17:07,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5317164179104478 [2025-03-17 14:17:07,074 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 291 flow. Second operand 8 states and 570 transitions. [2025-03-17 14:17:07,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 102 transitions, 407 flow [2025-03-17 14:17:07,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 102 transitions, 379 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:07,076 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 287 flow [2025-03-17 14:17:07,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=123, PETRI_TRANSITIONS=102} [2025-03-17 14:17:07,077 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -13 predicate places. [2025-03-17 14:17:07,077 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 287 flow [2025-03-17 14:17:07,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 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-17 14:17:07,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:07,078 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:07,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:17:07,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:07,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1438238182, now seen corresponding path program 1 times [2025-03-17 14:17:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:07,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606452268] [2025-03-17 14:17:07,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:07,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:17:07,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:17:07,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:07,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:07,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:07,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606452268] [2025-03-17 14:17:07,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606452268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:07,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:07,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:17:07,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29215801] [2025-03-17 14:17:07,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:07,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:17:07,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:07,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:17:07,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:17:07,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2025-03-17 14:17:07,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 287 flow. Second operand has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 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-17 14:17:07,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:07,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2025-03-17 14:17:07,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:08,188 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2025-03-17 14:17:08,188 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-17 14:17:08,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 289 events. 64/289 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1142 event pairs, 63 based on Foata normal form. 1/247 useless extension candidates. Maximal degree in co-relation 516. Up to 172 conditions per place. [2025-03-17 14:17:08,190 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 49 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2025-03-17 14:17:08,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 100 transitions, 407 flow [2025-03-17 14:17:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:17:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:17:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 446 transitions. [2025-03-17 14:17:08,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47547974413646055 [2025-03-17 14:17:08,192 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 287 flow. Second operand 7 states and 446 transitions. [2025-03-17 14:17:08,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 100 transitions, 407 flow [2025-03-17 14:17:08,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 100 transitions, 373 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 14:17:08,195 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 275 flow [2025-03-17 14:17:08,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=120, PETRI_TRANSITIONS=100} [2025-03-17 14:17:08,196 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -16 predicate places. [2025-03-17 14:17:08,197 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 275 flow [2025-03-17 14:17:08,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 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-17 14:17:08,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:08,197 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:08,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:17:08,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:08,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:08,197 INFO L85 PathProgramCache]: Analyzing trace with hash 832601586, now seen corresponding path program 1 times [2025-03-17 14:17:08,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:08,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846414988] [2025-03-17 14:17:08,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:08,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:08,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:17:08,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:17:08,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:08,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:08,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:08,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846414988] [2025-03-17 14:17:08,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846414988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:08,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:08,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:08,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112379863] [2025-03-17 14:17:08,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:08,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:08,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:08,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:08,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:08,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 134 [2025-03-17 14:17:08,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 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-17 14:17:08,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:08,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 134 [2025-03-17 14:17:08,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:08,741 INFO L124 PetriNetUnfolderBase]: 64/288 cut-off events. [2025-03-17 14:17:08,741 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-17 14:17:08,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 288 events. 64/288 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1127 event pairs, 63 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 502. Up to 171 conditions per place. [2025-03-17 14:17:08,743 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 40 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2025-03-17 14:17:08,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 99 transitions, 379 flow [2025-03-17 14:17:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2025-03-17 14:17:08,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2025-03-17 14:17:08,745 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 275 flow. Second operand 5 states and 494 transitions. [2025-03-17 14:17:08,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 99 transitions, 379 flow [2025-03-17 14:17:08,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 99 transitions, 353 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:17:08,747 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 273 flow [2025-03-17 14:17:08,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2025-03-17 14:17:08,748 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -19 predicate places. [2025-03-17 14:17:08,749 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 99 transitions, 273 flow [2025-03-17 14:17:08,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 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-17 14:17:08,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:08,749 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:08,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:17:08,749 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:08,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash 832601585, now seen corresponding path program 1 times [2025-03-17 14:17:08,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:08,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718105297] [2025-03-17 14:17:08,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:08,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:08,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:17:08,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:17:08,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:08,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:08,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:08,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718105297] [2025-03-17 14:17:08,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718105297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:08,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:08,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:08,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22788372] [2025-03-17 14:17:08,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:08,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:08,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:08,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:08,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:09,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-03-17 14:17:09,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 99 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-17 14:17:09,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:09,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-03-17 14:17:09,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:09,167 INFO L124 PetriNetUnfolderBase]: 64/287 cut-off events. [2025-03-17 14:17:09,168 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-17 14:17:09,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 287 events. 64/287 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1133 event pairs, 63 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 507. Up to 171 conditions per place. [2025-03-17 14:17:09,169 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 46 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2025-03-17 14:17:09,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 98 transitions, 389 flow [2025-03-17 14:17:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2025-03-17 14:17:09,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2025-03-17 14:17:09,171 INFO L175 Difference]: Start difference. First operand has 117 places, 99 transitions, 273 flow. Second operand 5 states and 410 transitions. [2025-03-17 14:17:09,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 98 transitions, 389 flow [2025-03-17 14:17:09,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 98 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:09,172 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 271 flow [2025-03-17 14:17:09,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=116, PETRI_TRANSITIONS=98} [2025-03-17 14:17:09,173 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -20 predicate places. [2025-03-17 14:17:09,173 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 271 flow [2025-03-17 14:17:09,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-17 14:17:09,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:09,173 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:09,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:17:09,174 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:09,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 598520752, now seen corresponding path program 1 times [2025-03-17 14:17:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:09,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113550875] [2025-03-17 14:17:09,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:09,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:09,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:17:09,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:17:09,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:09,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:09,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:09,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113550875] [2025-03-17 14:17:09,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113550875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:09,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:09,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:09,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734316780] [2025-03-17 14:17:09,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:09,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:17:09,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:09,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:17:09,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:17:09,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2025-03-17 14:17:09,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 98 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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-17 14:17:09,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:09,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2025-03-17 14:17:09,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:09,912 INFO L124 PetriNetUnfolderBase]: 73/311 cut-off events. [2025-03-17 14:17:09,912 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-17 14:17:09,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 311 events. 73/311 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1293 event pairs, 63 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 541. Up to 164 conditions per place. [2025-03-17 14:17:09,913 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 54 selfloop transitions, 3 changer transitions 3/104 dead transitions. [2025-03-17 14:17:09,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 403 flow [2025-03-17 14:17:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:17:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:17:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2025-03-17 14:17:09,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.710820895522388 [2025-03-17 14:17:09,915 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 271 flow. Second operand 4 states and 381 transitions. [2025-03-17 14:17:09,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 403 flow [2025-03-17 14:17:09,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:09,917 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 245 flow [2025-03-17 14:17:09,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=112, PETRI_TRANSITIONS=95} [2025-03-17 14:17:09,917 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -24 predicate places. [2025-03-17 14:17:09,917 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 245 flow [2025-03-17 14:17:09,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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-17 14:17:09,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:09,918 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:09,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:17:09,918 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:09,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:09,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1394591632, now seen corresponding path program 1 times [2025-03-17 14:17:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:09,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820184793] [2025-03-17 14:17:09,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:09,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:09,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:17:09,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:17:09,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:09,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 14:17:10,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:10,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820184793] [2025-03-17 14:17:10,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820184793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:10,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:10,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:17:10,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592836984] [2025-03-17 14:17:10,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:10,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:17:10,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:10,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:17:10,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:17:10,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 134 [2025-03-17 14:17:10,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 95 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-17 14:17:10,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:10,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 134 [2025-03-17 14:17:10,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:10,727 INFO L124 PetriNetUnfolderBase]: 64/280 cut-off events. [2025-03-17 14:17:10,727 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 14:17:10,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 280 events. 64/280 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1115 event pairs, 54 based on Foata normal form. 2/239 useless extension candidates. Maximal degree in co-relation 491. Up to 132 conditions per place. [2025-03-17 14:17:10,728 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 42 selfloop transitions, 16 changer transitions 3/100 dead transitions. [2025-03-17 14:17:10,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 377 flow [2025-03-17 14:17:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:17:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:17:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 573 transitions. [2025-03-17 14:17:10,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6108742004264393 [2025-03-17 14:17:10,730 INFO L175 Difference]: Start difference. First operand has 112 places, 95 transitions, 245 flow. Second operand 7 states and 573 transitions. [2025-03-17 14:17:10,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 377 flow [2025-03-17 14:17:10,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 371 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:17:10,732 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 263 flow [2025-03-17 14:17:10,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2025-03-17 14:17:10,732 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2025-03-17 14:17:10,732 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 263 flow [2025-03-17 14:17:10,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-17 14:17:10,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:10,732 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:10,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:17:10,733 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:10,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1394591631, now seen corresponding path program 1 times [2025-03-17 14:17:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:10,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275365388] [2025-03-17 14:17:10,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:10,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:17:10,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:17:10,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:10,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 14:17:10,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:10,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275365388] [2025-03-17 14:17:10,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275365388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:10,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:10,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:17:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113331908] [2025-03-17 14:17:10,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:10,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:17:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:10,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:17:10,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:17:11,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2025-03-17 14:17:11,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 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-17 14:17:11,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:11,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2025-03-17 14:17:11,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:11,413 INFO L124 PetriNetUnfolderBase]: 64/278 cut-off events. [2025-03-17 14:17:11,413 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 14:17:11,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 278 events. 64/278 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1110 event pairs, 54 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 512. Up to 130 conditions per place. [2025-03-17 14:17:11,434 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 49 selfloop transitions, 18 changer transitions 3/98 dead transitions. [2025-03-17 14:17:11,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 417 flow [2025-03-17 14:17:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:17:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:17:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 574 transitions. [2025-03-17 14:17:11,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5354477611940298 [2025-03-17 14:17:11,436 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 263 flow. Second operand 8 states and 574 transitions. [2025-03-17 14:17:11,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 417 flow [2025-03-17 14:17:11,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 385 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:17:11,438 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 263 flow [2025-03-17 14:17:11,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=110, PETRI_TRANSITIONS=89} [2025-03-17 14:17:11,439 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2025-03-17 14:17:11,439 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 263 flow [2025-03-17 14:17:11,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 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-17 14:17:11,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:11,439 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:11,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:17:11,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:11,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:11,441 INFO L85 PathProgramCache]: Analyzing trace with hash 172786308, now seen corresponding path program 1 times [2025-03-17 14:17:11,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:11,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497450638] [2025-03-17 14:17:11,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:11,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:11,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:17:11,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:17:11,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:11,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 14:17:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:11,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497450638] [2025-03-17 14:17:11,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497450638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:11,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:11,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:11,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981338700] [2025-03-17 14:17:11,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:11,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:11,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:11,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:11,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:11,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-03-17 14:17:11,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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-17 14:17:11,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:11,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-03-17 14:17:11,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:11,847 INFO L124 PetriNetUnfolderBase]: 64/277 cut-off events. [2025-03-17 14:17:11,848 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-17 14:17:11,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 277 events. 64/277 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1103 event pairs, 63 based on Foata normal form. 1/237 useless extension candidates. Maximal degree in co-relation 510. Up to 170 conditions per place. [2025-03-17 14:17:11,849 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 45 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2025-03-17 14:17:11,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 88 transitions, 377 flow [2025-03-17 14:17:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2025-03-17 14:17:11,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104477611940299 [2025-03-17 14:17:11,850 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 263 flow. Second operand 5 states and 409 transitions. [2025-03-17 14:17:11,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 88 transitions, 377 flow [2025-03-17 14:17:11,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 88 transitions, 341 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 14:17:11,852 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 251 flow [2025-03-17 14:17:11,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2025-03-17 14:17:11,852 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2025-03-17 14:17:11,852 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 251 flow [2025-03-17 14:17:11,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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-17 14:17:11,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:11,853 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:11,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:17:11,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:11,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash 172786309, now seen corresponding path program 1 times [2025-03-17 14:17:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:11,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321429780] [2025-03-17 14:17:11,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:11,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:17:11,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:17:11,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:11,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 14:17:11,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:11,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321429780] [2025-03-17 14:17:11,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321429780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:11,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:11,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:12,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976671152] [2025-03-17 14:17:12,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:12,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:12,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:12,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:12,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:12,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2025-03-17 14:17:12,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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-17 14:17:12,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:12,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2025-03-17 14:17:12,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:12,287 INFO L124 PetriNetUnfolderBase]: 64/276 cut-off events. [2025-03-17 14:17:12,287 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-17 14:17:12,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 276 events. 64/276 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1098 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 489. Up to 170 conditions per place. [2025-03-17 14:17:12,289 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 39 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2025-03-17 14:17:12,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 87 transitions, 353 flow [2025-03-17 14:17:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2025-03-17 14:17:12,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6462686567164179 [2025-03-17 14:17:12,290 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 251 flow. Second operand 5 states and 433 transitions. [2025-03-17 14:17:12,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 87 transitions, 353 flow [2025-03-17 14:17:12,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 87 transitions, 327 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:12,292 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 249 flow [2025-03-17 14:17:12,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2025-03-17 14:17:12,293 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2025-03-17 14:17:12,293 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 249 flow [2025-03-17 14:17:12,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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-17 14:17:12,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:12,294 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:12,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:17:12,294 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:12,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:12,294 INFO L85 PathProgramCache]: Analyzing trace with hash 889319287, now seen corresponding path program 1 times [2025-03-17 14:17:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:12,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694193943] [2025-03-17 14:17:12,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:12,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:17:12,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:17:12,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:12,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694193943] [2025-03-17 14:17:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694193943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362655684] [2025-03-17 14:17:13,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:13,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:13,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:13,626 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-17 14:17:13,627 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-17 14:17:13,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:17:13,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:17:13,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:13,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:13,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-03-17 14:17:13,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:13,824 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-17 14:17:13,829 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-17 14:17:13,890 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-03-17 14:17:13,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-03-17 14:17:13,893 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 22 treesize of output 17 [2025-03-17 14:17:13,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 14:17:13,900 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 11 [2025-03-17 14:17:13,953 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-03-17 14:17:13,953 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 20 treesize of output 22 [2025-03-17 14:17:13,961 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-17 14:17:14,048 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-17 14:17:14,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2025-03-17 14:17:14,067 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-17 14:17:14,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2025-03-17 14:17:14,087 INFO L349 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2025-03-17 14:17:14,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 30 [2025-03-17 14:17:14,108 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-03-17 14:17:14,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-03-17 14:17:14,381 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-03-17 14:17:14,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-03-17 14:17:14,400 INFO L349 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2025-03-17 14:17:14,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 46 [2025-03-17 14:17:16,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:16,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2025-03-17 14:17:16,418 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 14:17:16,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2025-03-17 14:17:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:16,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:16,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:16,583 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 61 treesize of output 79 [2025-03-17 14:17:16,921 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 10 treesize of output 8 [2025-03-17 14:17:17,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96 [2025-03-17 14:17:17,164 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 126 treesize of output 120 [2025-03-17 14:17:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:17,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362655684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:17,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:17,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 36 [2025-03-17 14:17:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60621135] [2025-03-17 14:17:17,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:17,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-17 14:17:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:17,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-17 14:17:17,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1134, Unknown=1, NotChecked=0, Total=1332 [2025-03-17 14:17:30,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:17:37,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 134 [2025-03-17 14:17:37,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 249 flow. Second operand has 37 states, 37 states have (on average 43.91891891891892) internal successors, (1625), 37 states have internal predecessors, (1625), 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-17 14:17:37,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:37,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 134 [2025-03-17 14:17:37,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:38,843 INFO L124 PetriNetUnfolderBase]: 73/295 cut-off events. [2025-03-17 14:17:38,844 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-17 14:17:38,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 295 events. 73/295 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1208 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 536. Up to 148 conditions per place. [2025-03-17 14:17:38,845 INFO L140 encePairwiseOnDemand]: 112/134 looper letters, 48 selfloop transitions, 20 changer transitions 3/94 dead transitions. [2025-03-17 14:17:38,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 94 transitions, 405 flow [2025-03-17 14:17:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:17:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 14:17:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 609 transitions. [2025-03-17 14:17:38,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34959816303099883 [2025-03-17 14:17:38,847 INFO L175 Difference]: Start difference. First operand has 105 places, 87 transitions, 249 flow. Second operand 13 states and 609 transitions. [2025-03-17 14:17:38,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 94 transitions, 405 flow [2025-03-17 14:17:38,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 94 transitions, 379 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:38,849 INFO L231 Difference]: Finished difference. Result has 111 places, 85 transitions, 259 flow [2025-03-17 14:17:38,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=259, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2025-03-17 14:17:38,849 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2025-03-17 14:17:38,849 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 259 flow [2025-03-17 14:17:38,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 43.91891891891892) internal successors, (1625), 37 states have internal predecessors, (1625), 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-17 14:17:38,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:38,850 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:38,858 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-17 14:17:39,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:39,051 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:39,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash 889319286, now seen corresponding path program 1 times [2025-03-17 14:17:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:39,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206784308] [2025-03-17 14:17:39,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:39,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:17:39,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:17:39,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:39,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 14:17:39,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:39,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206784308] [2025-03-17 14:17:39,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206784308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:39,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:39,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:17:39,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331517334] [2025-03-17 14:17:39,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:39,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:17:39,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:39,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:17:39,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:17:39,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2025-03-17 14:17:39,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 259 flow. Second operand has 10 states, 10 states have (on average 78.5) internal successors, (785), 10 states have internal predecessors, (785), 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-17 14:17:39,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:39,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2025-03-17 14:17:39,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:40,150 INFO L124 PetriNetUnfolderBase]: 64/273 cut-off events. [2025-03-17 14:17:40,150 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 14:17:40,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 273 events. 64/273 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1100 event pairs, 54 based on Foata normal form. 1/233 useless extension candidates. Maximal degree in co-relation 510. Up to 135 conditions per place. [2025-03-17 14:17:40,151 INFO L140 encePairwiseOnDemand]: 121/134 looper letters, 54 selfloop transitions, 12 changer transitions 3/93 dead transitions. [2025-03-17 14:17:40,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 93 transitions, 413 flow [2025-03-17 14:17:40,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:17:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:17:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 668 transitions. [2025-03-17 14:17:40,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6231343283582089 [2025-03-17 14:17:40,153 INFO L175 Difference]: Start difference. First operand has 111 places, 85 transitions, 259 flow. Second operand 8 states and 668 transitions. [2025-03-17 14:17:40,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 93 transitions, 413 flow [2025-03-17 14:17:40,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 93 transitions, 373 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-17 14:17:40,154 INFO L231 Difference]: Finished difference. Result has 105 places, 84 transitions, 241 flow [2025-03-17 14:17:40,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=241, PETRI_PLACES=105, PETRI_TRANSITIONS=84} [2025-03-17 14:17:40,155 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2025-03-17 14:17:40,155 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 84 transitions, 241 flow [2025-03-17 14:17:40,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.5) internal successors, (785), 10 states have internal predecessors, (785), 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-17 14:17:40,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:40,155 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:40,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:17:40,156 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:40,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash -62633757, now seen corresponding path program 1 times [2025-03-17 14:17:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817493198] [2025-03-17 14:17:40,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:40,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 14:17:40,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 14:17:40,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:40,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 14:17:40,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:40,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817493198] [2025-03-17 14:17:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817493198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:40,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930934055] [2025-03-17 14:17:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:40,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:40,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:40,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:40,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 134 [2025-03-17 14:17:40,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 84 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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-17 14:17:40,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:40,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 134 [2025-03-17 14:17:40,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:40,571 INFO L124 PetriNetUnfolderBase]: 73/289 cut-off events. [2025-03-17 14:17:40,571 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-17 14:17:40,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 289 events. 73/289 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1181 event pairs, 45 based on Foata normal form. 2/248 useless extension candidates. Maximal degree in co-relation 533. Up to 108 conditions per place. [2025-03-17 14:17:40,573 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 48 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2025-03-17 14:17:40,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 91 transitions, 387 flow [2025-03-17 14:17:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:17:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:17:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2025-03-17 14:17:40,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6019900497512438 [2025-03-17 14:17:40,575 INFO L175 Difference]: Start difference. First operand has 105 places, 84 transitions, 241 flow. Second operand 6 states and 484 transitions. [2025-03-17 14:17:40,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 91 transitions, 387 flow [2025-03-17 14:17:40,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 91 transitions, 363 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 14:17:40,576 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 249 flow [2025-03-17 14:17:40,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2025-03-17 14:17:40,577 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -35 predicate places. [2025-03-17 14:17:40,577 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 249 flow [2025-03-17 14:17:40,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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-17 14:17:40,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:40,577 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:40,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:17:40,577 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:40,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash -62633756, now seen corresponding path program 1 times [2025-03-17 14:17:40,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:40,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880665239] [2025-03-17 14:17:40,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:40,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:40,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 14:17:40,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 14:17:40,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:40,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 14:17:40,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:40,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880665239] [2025-03-17 14:17:40,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880665239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:40,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:40,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:40,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670222932] [2025-03-17 14:17:40,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:40,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:40,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:40,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:40,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:40,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 134 [2025-03-17 14:17:40,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 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-17 14:17:40,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:40,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 134 [2025-03-17 14:17:40,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:41,054 INFO L124 PetriNetUnfolderBase]: 73/276 cut-off events. [2025-03-17 14:17:41,054 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-17 14:17:41,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 276 events. 73/276 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1073 event pairs, 18 based on Foata normal form. 2/253 useless extension candidates. Maximal degree in co-relation 538. Up to 135 conditions per place. [2025-03-17 14:17:41,055 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 44 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2025-03-17 14:17:41,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 383 flow [2025-03-17 14:17:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:17:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:17:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2025-03-17 14:17:41,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6393034825870647 [2025-03-17 14:17:41,057 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 249 flow. Second operand 6 states and 514 transitions. [2025-03-17 14:17:41,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 383 flow [2025-03-17 14:17:41,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 89 transitions, 347 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 14:17:41,058 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 241 flow [2025-03-17 14:17:41,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2025-03-17 14:17:41,059 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -37 predicate places. [2025-03-17 14:17:41,059 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 241 flow [2025-03-17 14:17:41,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 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-17 14:17:41,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:41,059 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:41,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:17:41,060 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:41,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:41,061 INFO L85 PathProgramCache]: Analyzing trace with hash -931741022, now seen corresponding path program 1 times [2025-03-17 14:17:41,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:41,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136827839] [2025-03-17 14:17:41,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:41,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:41,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:17:41,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:17:41,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:41,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 14:17:41,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:41,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136827839] [2025-03-17 14:17:41,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136827839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:41,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:41,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832587360] [2025-03-17 14:17:41,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:41,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:41,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:41,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:41,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 134 [2025-03-17 14:17:41,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-17 14:17:41,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:41,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 134 [2025-03-17 14:17:41,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:41,285 INFO L124 PetriNetUnfolderBase]: 71/279 cut-off events. [2025-03-17 14:17:41,286 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-17 14:17:41,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 279 events. 71/279 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1133 event pairs, 56 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 518. Up to 162 conditions per place. [2025-03-17 14:17:41,287 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 56 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-03-17 14:17:41,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 85 transitions, 369 flow [2025-03-17 14:17:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2025-03-17 14:17:41,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8034825870646766 [2025-03-17 14:17:41,288 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 241 flow. Second operand 3 states and 323 transitions. [2025-03-17 14:17:41,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 85 transitions, 369 flow [2025-03-17 14:17:41,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 335 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 14:17:41,290 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 209 flow [2025-03-17 14:17:41,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2025-03-17 14:17:41,291 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -42 predicate places. [2025-03-17 14:17:41,292 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 209 flow [2025-03-17 14:17:41,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-17 14:17:41,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:41,292 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:41,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 14:17:41,292 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:41,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:41,293 INFO L85 PathProgramCache]: Analyzing trace with hash -931741021, now seen corresponding path program 1 times [2025-03-17 14:17:41,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:41,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521442303] [2025-03-17 14:17:41,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:41,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:41,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:17:41,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:17:41,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:41,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 14:17:41,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:41,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521442303] [2025-03-17 14:17:41,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521442303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:41,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:41,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979407630] [2025-03-17 14:17:41,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:41,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:41,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:41,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:41,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:41,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 134 [2025-03-17 14:17:41,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-17 14:17:41,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:41,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 134 [2025-03-17 14:17:41,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:41,567 INFO L124 PetriNetUnfolderBase]: 64/256 cut-off events. [2025-03-17 14:17:41,568 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-17 14:17:41,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 256 events. 64/256 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 966 event pairs, 56 based on Foata normal form. 16/246 useless extension candidates. Maximal degree in co-relation 470. Up to 162 conditions per place. [2025-03-17 14:17:41,569 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 55 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2025-03-17 14:17:41,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 83 transitions, 333 flow [2025-03-17 14:17:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2025-03-17 14:17:41,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8084577114427861 [2025-03-17 14:17:41,570 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 209 flow. Second operand 3 states and 325 transitions. [2025-03-17 14:17:41,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 83 transitions, 333 flow [2025-03-17 14:17:41,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 83 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:41,572 INFO L231 Difference]: Finished difference. Result has 92 places, 76 transitions, 205 flow [2025-03-17 14:17:41,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=92, PETRI_TRANSITIONS=76} [2025-03-17 14:17:41,572 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -44 predicate places. [2025-03-17 14:17:41,572 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 76 transitions, 205 flow [2025-03-17 14:17:41,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-17 14:17:41,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:41,573 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:41,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 14:17:41,573 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:41,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:41,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1164473574, now seen corresponding path program 1 times [2025-03-17 14:17:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:41,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568541315] [2025-03-17 14:17:41,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:41,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:41,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 14:17:41,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 14:17:41,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:41,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 14:17:41,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:41,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568541315] [2025-03-17 14:17:41,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568541315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:41,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:41,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:17:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570820031] [2025-03-17 14:17:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:41,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:17:41,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:41,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:17:41,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:17:41,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 134 [2025-03-17 14:17:41,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 76 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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-17 14:17:41,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:41,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 134 [2025-03-17 14:17:41,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:42,103 INFO L124 PetriNetUnfolderBase]: 73/273 cut-off events. [2025-03-17 14:17:42,103 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-17 14:17:42,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 273 events. 73/273 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1025 event pairs, 54 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 512. Up to 132 conditions per place. [2025-03-17 14:17:42,104 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 60 selfloop transitions, 10 changer transitions 3/93 dead transitions. [2025-03-17 14:17:42,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 393 flow [2025-03-17 14:17:42,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:17:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:17:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2025-03-17 14:17:42,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6766169154228856 [2025-03-17 14:17:42,105 INFO L175 Difference]: Start difference. First operand has 92 places, 76 transitions, 205 flow. Second operand 6 states and 544 transitions. [2025-03-17 14:17:42,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 393 flow [2025-03-17 14:17:42,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 93 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:42,106 INFO L231 Difference]: Finished difference. Result has 94 places, 75 transitions, 219 flow [2025-03-17 14:17:42,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=94, PETRI_TRANSITIONS=75} [2025-03-17 14:17:42,107 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -42 predicate places. [2025-03-17 14:17:42,107 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 75 transitions, 219 flow [2025-03-17 14:17:42,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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-17 14:17:42,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:42,107 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:42,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 14:17:42,107 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:42,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:42,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1164473575, now seen corresponding path program 1 times [2025-03-17 14:17:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:42,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117342770] [2025-03-17 14:17:42,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:42,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:42,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 14:17:42,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 14:17:42,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:42,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 14:17:42,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:42,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117342770] [2025-03-17 14:17:42,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117342770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:42,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:42,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:17:42,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506472228] [2025-03-17 14:17:42,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:42,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:17:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:42,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:17:42,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:17:42,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-03-17 14:17:42,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 75 transitions, 219 flow. Second operand has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 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-17 14:17:42,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:42,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-03-17 14:17:42,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:42,948 INFO L124 PetriNetUnfolderBase]: 85/298 cut-off events. [2025-03-17 14:17:42,949 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-17 14:17:42,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 298 events. 85/298 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1176 event pairs, 60 based on Foata normal form. 10/279 useless extension candidates. Maximal degree in co-relation 589. Up to 157 conditions per place. [2025-03-17 14:17:42,950 INFO L140 encePairwiseOnDemand]: 118/134 looper letters, 57 selfloop transitions, 15 changer transitions 3/94 dead transitions. [2025-03-17 14:17:42,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 409 flow [2025-03-17 14:17:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:17:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:17:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2025-03-17 14:17:42,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5988805970149254 [2025-03-17 14:17:42,951 INFO L175 Difference]: Start difference. First operand has 94 places, 75 transitions, 219 flow. Second operand 8 states and 642 transitions. [2025-03-17 14:17:42,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 409 flow [2025-03-17 14:17:42,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 387 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 14:17:42,952 INFO L231 Difference]: Finished difference. Result has 97 places, 77 transitions, 242 flow [2025-03-17 14:17:42,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=242, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2025-03-17 14:17:42,953 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -39 predicate places. [2025-03-17 14:17:42,953 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 77 transitions, 242 flow [2025-03-17 14:17:42,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 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-17 14:17:42,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:42,953 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:42,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 14:17:42,953 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 14:17:42,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:42,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2049899613, now seen corresponding path program 1 times [2025-03-17 14:17:42,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337273807] [2025-03-17 14:17:42,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:42,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:42,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:17:43,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:17:43,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:43,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 14:17:43,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:43,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337273807] [2025-03-17 14:17:43,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337273807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:43,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273749882] [2025-03-17 14:17:43,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:43,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:43,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:43,480 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-17 14:17:43,482 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-17 14:17:43,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:17:43,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:17:43,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:43,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:43,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-03-17 14:17:43,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:43,804 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:17:43,804 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-17 14:17:43,806 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-17 14:17:43,844 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:17:43,844 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-17 14:17:43,849 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-17 14:17:43,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 14:17:43,931 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:17:43,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 14:17:43,940 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:17:43,940 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-17 14:17:43,994 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-17 14:17:43,995 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 1 case distinctions, treesize of input 30 treesize of output 18 [2025-03-17 14:17:43,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:43,998 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-17 14:17:44,043 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:17:44,043 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-17 14:17:44,045 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-17 14:17:44,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:44,082 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-17 14:17:44,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:44,155 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-17 14:17:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:44,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:44,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:44,305 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 37 treesize of output 55 [2025-03-17 14:17:44,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:44,377 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 37 treesize of output 55 [2025-03-17 14:17:44,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:44,454 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 37 treesize of output 55 [2025-03-17 14:17:44,493 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:17:44,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 14:17:44,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:44,558 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 37 treesize of output 55 [2025-03-17 14:17:44,588 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:17:44,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 14:17:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 14:17:44,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273749882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:44,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:44,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 4] total 23 [2025-03-17 14:17:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98993223] [2025-03-17 14:17:44,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:44,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 14:17:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:44,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 14:17:44,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2025-03-17 14:17:49,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:17:53,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:17:57,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:02,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:06,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:10,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:15,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:19,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:23,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:28,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:18:32,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]